Contact at mumbai.academics@gmail.com or 8097636691
Responsive Ads Here

Thursday, 8 February 2018

Autonomy-Oriented Self-Equilibrium Routing Model in Traffic Networks(2010)

Autonomy-Oriented Self-Equilibrium Routing Model in Traffic Networks(2010)

Abstract
The ultimate goal of routing model in a distributed traffic network is to achieve global traffic flow equilibrium and reduce total travel cost without centralized and complicated control on an ensemble of routing components. Autonomy oriented computing can provide an autonomy-oriented selforganizing controlling method to coordinate those large-scale computational entities to achieve emergent global behavior based on local interactions and local information. To emerge system equilibrium, a new autonomy-oriented routing model is proposed, which is an integration of dynamic network, routing mechanism, local traffic flow dynamics with a great number of routing agents that asynchronously execute a basic control loop. Based on the basic control loop, traffic flow dynamics, routing agents’ routing choosing and navigated vehicles compose a feedback cycle to let the routing system (routing agents, traffic flow and vehicles) to self-organize. Moreover, a novel selfequilibrium routing schemes, considering distance cost, time delay and traffic capacity simultaneously, is proposed to reduce total time cost for all vehicles in traffic network. 
Proposed System
  •   In this Project we present a new scheme for handling link and node failures in IP networks. Multiple Routing Configurations (MRC) is a proactive and local protection mechanism that allows recovery in the range of milliseconds.
  •   MRC guarantees recovery from any single link or node failure, which constitutes a large majority of the failures experienced in a network.
  •   MRC makes no assumptions with respect to the root cause of failure, e.g., whether the packet forwarding is disrupted due to a failed link or a failed router.
  •   MRC is based on building a small set of backup routing configurations, that are used to route recovered traffic on alternate paths after a failure.
Module Description
  Generating Backup Configuration
I will first detail the requirements that must be put on the backup configurations used in MRC. Then, we propose an algorithm that can be used to automatically create such configurations. The algorithm will typically be run once at the initial start-up of the network, and each time a node or link is permanently added or removed.
 Local Forwarding Process
I will create a complete set of valid backup configurations. Based on these, a standard shortest path algorithm is used in each configuration to calculate configuration specific forwarding tables. we describe how these forwarding tables are used to avoid a failed component.
  •      When a packet reaches a point of failure, the node adjacent to the failure, called the detecting node, is responsible for finding a backup configuration where the failed component is isolated.
  •     The detecting node marks the packet as belonging to this configuration, and forwards the packet. From the packet marking, all transit routers identify the packet with the selected backup configuration, and forward it to the egress node avoiding the failed component.
  •     The detecting node must find the correct backup configuration without knowing the root cause of failure.
 Recovery Load Distribution
 MRC recovery is local, and the recovered traffic is routed in a backup configuration from the point of failure to the egress node.
This shifting of traffic from the original path to a backup path affects the load distribution in the network, and might lead to congestion. In our experience, the effect a failure has on the load distribution when MRC is used is highly variable. Occasionally the load added on a link can be significant,  we describe an approach for minimizing the impact of the MRC recovery process on the post failure load distribution.
MRC is used for fast recovery, the load distribution in the network during the failure depends on three factors:
(a) The link weight assignment used in the normal configuration Co
(b) The structure of the backup configurations, i.e., which links and nodes are isolated in each ,
                        Ci E {C1…Cn}
(c) The link weight assignments used in the backbones B1…Bn  of the backup configurations.
SYSTEM SPECIFICATION
Hardware Requirements
Processor                                                     :     Pentium IV
Speed                                                                        :     above 1GHz      
Ram capacity                                               :     2GB
Hard disk capacity                                     :     20 GB
Monitor                                                        :     14 “samtron monitor
Printer                                                           :     TVS 80 color
Motherboard                                              :     Intel
Keyboard                                                      :     Logitech Of 104 Keys
Mouse                                                           :     Logitech Mouse
Software Requirements
Operating system                                       :      Windows
Front end                                         :      Java

No comments:

Post a Comment