Sciweavers

410 search results - page 37 / 82
» Upgrading Shortest Paths in Networks
Sort
View
CCR
2002
86views more  CCR 2002»
15 years 1 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
EDBTW
2006
Springer
15 years 5 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo
MASS
2010
186views Communications» more  MASS 2010»
14 years 11 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
ICNP
1999
IEEE
15 years 5 months ago
Policy Disputes in Path-Vector Protocols
The Border Gateway Protocol, BGP, is currently the only interdomain routing protocol employed on the Internet. As required of any interdomain protocol, BGP allows policy-based met...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
INFOCOM
2010
IEEE
14 years 12 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer