نتایج جستجو برای: link based and path based traffic assignment

تعداد نتایج: 17332084  

Journal: :International Journal of Machine Learning and Cybernetics 2021

A correction to this paper has been published: https://doi.org/10.1007/s13042-021-01350-4

1999
Oliver Jan Alan J. Horowitz

A comprehensive set of GPS vehicle location data from Lexington households was analyzed to determine if such data can be helpful in improving path choice assumptions in traffic assignment models. Primarily, the portion of the data used consisted of a reconstruction of the street network and the lists of street segments in each path. Analysis was based on “matches” of trips, e.g., pairs of trips...

2001
Soumya Roy J. J. Garcia-Luna-Aceves

The on-demand routing protocols that have been proposed to date use either path information (e.g., DSR) or distance information (e.g., AODV). We present SOAR, an on-demand link-state protocol based on partial link-state information in which a wireless router communicates to its neighbors the link states of only those links in its source tree that belong to the paths it chooses to advertise for ...

Multicamera vehicle tracking is a necessary part of any video-based intelligent transportation system for extracting different traffic parameters such as link travel times and origin/destination counts. In many applications, it is needed to locate traffic cameras disjoint from each other to cover a wide area. This paper presents a method for tracking moving vehicles in such camera networks. The...

2015
K. Sailaja

In order to offer a better network survivability, it is crucial that a network manager can realize restorable traffic assignment in response to traffic dynamics and facility network reconfiguration. In this paper, I presented an optimal virtual path routing control for survivable ATM networks to minimize the expected amount of lost flow upon restoration from a network failure. The amount of los...

2008
Ziming Zeng Yuanyuan Zeng

The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of link interference. In this paper, we study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. We present distributed bandwidth guaranteed TDMA sched...

2006
S. Ramanathan G. Karthik Ms. G. Sumathi

This study deals with the formulation of an effective and efficient algorithm for load balancing in WDM networks. Here we develop a Load Balancing algorithm for IPlike Routing. The considered networks are based on a routing protocol where the next hop at a given node depends only on the destination of the communication. The aim of this work is to consider the applicability of this approach in t...

Journal: :Computers & OR 1998
Chae Y. Lee Seok Joo Koh

We propose a design of self-healing ATM virtual path (VP) networks based on backup VP. The backup VP is a preassigned virtual path to restore the traffic after a network failure. It is known that the self-healing scheme based on the backup VP is simple, fast and easy to implement. Given a set of bandwidth requirements and original routes for target demands, the design is to find the backup rout...

2012
Mikael Call

The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. This is of utmost importance. Traffic in IP networks is commonly routed along shortest paths with respect to auxiliary link weights, e.g. using the OSPF or IS-IS protocol. Here, shortest path r...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید