Sciweavers

2343 search results - page 178 / 469
» The Locomotive Routing Problem
Sort
View
MINENET
2005
ACM
16 years 1 hour ago
A first step toward understanding inter-domain routing dynamics
BGP updates are triggered by a variety of events such as link failures, resets, routers crashing, configuration changes, and so on. Making sense of these updates and identifying ...
Kuai Xu, Jaideep Chandrashekar, Zhi-Li Zhang
ICCSA
2004
Springer
15 years 11 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
SPAA
1994
ACM
15 years 10 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
EUROMICRO
2004
IEEE
15 years 10 months ago
Securing Ad hoc Routing Protocols
Ad hoc networks are subject of many recent research efforts. Especially in mobile scenarios, self-organizing networks are of high interest. While the routing aspects of mobile ad ...
Frank Kargl, Stefan Schlott, Andreas Klenk, Alfred...
SPDP
1991
IEEE
15 years 10 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari