Sciweavers

35 search results - page 6 / 7
» Finding Multiple Routing Paths in Wide-Area WDM Networks
Sort
View
MASS
2010
186views Communications» more  MASS 2010»
13 years 5 months ago
VAN: Vehicle-assisted shortest-time path navigation
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is gettin...
Wenping Chen, Sencun Zhu, Deying Li
COMCOM
2004
89views more  COMCOM 2004»
13 years 7 months ago
QROUTE: an QoS-guaranteed multicast routing
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...
Jinquan Dai, Touchai Angchuan, Hung Keng Pung
TON
2008
74views more  TON 2008»
13 years 7 months ago
Race conditions in coexisting overlay networks
By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
INFOCOM
2003
IEEE
14 years 24 days ago
The Impact of Correlated Link Weights on QoS Routing
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
Fernando A. Kuipers, Piet Van Mieghem
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...