Sciweavers

4037 search results - page 487 / 808
» Routing without ordering
Sort
View
157
Voted
JNW
2008
177views more  JNW 2008»
15 years 4 months ago
Design and Evaluation of a Novel HIP-Based Network Mobility Protocol
The rapid growth of IP-based mobile telecommunication technologies in the past few years has revealed situations where not only a single node but an entire network moves and change...
Szabolcs Nováczki, László Bok...
JSAC
2006
157views more  JSAC 2006»
15 years 4 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
CCR
2002
103views more  CCR 2002»
15 years 4 months ago
King: estimating latency between arbitrary internet end hosts
The ability to estimate network latencies between arbitrary Internet end hosts would enable new measurement studies and applications, such as investigating routing path inefficien...
P. Krishna Gummadi, Stefan Saroiu, Steven D. Gribb...
AI
1998
Springer
15 years 4 months ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
SCHEDULING
2008
89views more  SCHEDULING 2008»
15 years 3 months ago
On-line decision support for take-off runway scheduling with uncertain taxi times at London Heathrow airport
: This paper addresses the challenge of building an automated decision support methodology to tackle the complex problem faced every day by runway controllers at London Heathrow Ai...
Jason A. D. Atkin, Edmund K. Burke, John S. Greenw...