Sciweavers

85 search results - page 4 / 17
» Landmark-Based Routing in Dynamic Graphs
Sort
View
WG
1995
Springer
13 years 11 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...
ATMOS
2010
150views Optimization» more  ATMOS 2010»
13 years 7 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg
COMPLEX
2009
Springer
13 years 12 months ago
Capturing Internet Traffic Dynamics through Graph Distances
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
Steve Uhlig, Bingjie Fu, Almerima Jamakovic
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 8 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
ADHOC
2004
134views more  ADHOC 2004»
13 years 7 months ago
Scalable team multicast in wireless ad hoc networks exploiting coordinated motion
In this paper, we study a new multicast paradigm for large scale mobile ad hoc networks, namely team multicast. In team multicast the multicast group does not consist of individua...
Yunjung Yi, Mario Gerla, Katia Obraczka