Sciweavers

1574 search results - page 169 / 315
» Efficient QoS Routing
Sort
View
GCC
2004
Springer
15 years 12 months ago
Gemini: Probabilistic Routing Algorithm in Structured P2P Overlay
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
Ming Li, Jinfeng Hu, Haitao Dong, Dongsheng Wang, ...
INFOCOM
1997
IEEE
15 years 10 months ago
Re-Routing in Circuit Switched Networks
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
Eric W. M. Wong, Andy K. M. Chan, Tak-Shing Peter ...
NETWORKING
2008
15 years 8 months ago
Convergence of Intra-domain Routing with Centralized Control
The decentralized control scheme for routing in current IP networks has been questioned, and a centralized control scheme has been proposed. In this paper, we compare the convergen...
Jing Fu, Peter Sjödin, Gunnar Karlsson
NETWORKING
2000
15 years 7 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal