Sciweavers

2808 search results - page 82 / 562
» Routing betweenness centrality
Sort
View
128
Voted
GLOBECOM
2008
IEEE
15 years 11 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
162
Voted
TON
2010
158views more  TON 2010»
15 years 3 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
NETWORKING
2011
14 years 8 months ago
oBGP: An Overlay for a Scalable iBGP Control Plane
The Internet is organized as a collection of networks called Autonomous Systems (ASes). The Border Gateway Protocol (BGP) is the glue that connects these administrative domains. Co...
Iuniana M. Oprescu, Mickael Meulle, Steve Uhlig, C...
NETWORKING
2004
15 years 6 months ago
Multi-domain Diagnosis of End-to-End Service Failures in Hierarchically Routed Networks
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. Since exact probabilistic diagnosis is known to be an NP-hard problem, a...
Malgorzata Steinder, Adarshpal S. Sethi
ISCC
2009
IEEE
201views Communications» more  ISCC 2009»
15 years 11 months ago
Self-Selecting Reliable Path Routing in diverse Wireless Sensor Network environments
Routing protocols for Wireless Sensor Networks (WSN) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of p...
Thomas A. Babbitt, Christopher Morrell, Boleslaw K...