Sciweavers

72 search results - page 2 / 15
» Design and Analysis of Improved Shortest Path Tree Update fo...
Sort
View
ORL
2010
85views more  ORL 2010»
13 years 3 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
CONEXT
2007
ACM
13 years 8 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt
ADHOC
2007
173views more  ADHOC 2007»
13 years 5 months ago
QoS multicast routing by using multiple paths/trees in wireless ad hoc networks
In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blo...
Huayi Wu, Xiaohua Jia
HICSS
2012
IEEE
251views Biometrics» more  HICSS 2012»
12 years 15 days ago
Topology Skewing for Improved Route Selection in Wireless Multi-hop Networks
—The selection of a path in a network from one node to another is performed by a routing protocol, often using the shortest path approach. However, it has been shown that in wire...
Winston Khoon Guan Seah, Alvin C. Valera, Pius W. ...
TON
2008
125views more  TON 2008»
13 years 4 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni