2343 search results - page 279 / 469 » The Locomotive Routing Problem |
151
click to vote
NETWORKING
2007
15 years 8 months ago
2007
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
151
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
165
click to vote
IM
1997
15 years 7 months ago
1997
In this paper we present the initial specification of a system that covers both the control and management planes of network operation, with emphasis on fault, performance, and co...
190
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
176
click to vote
TPDS
2008
15 years 6 months ago
2008
In this paper, we address the problem of destination anonymity for applications in mobile ad hoc networks where geographic information is ready for use in both ad hoc routing and I...