Sciweavers

75 search results - page 10 / 15
» Stable routing under the Spanning Tree Protocol
Sort
View
ICNP
1999
IEEE
13 years 12 months ago
Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol
While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must su...
Sylvia Ratnasamy, Steven McCanne
DAC
2009
ACM
14 years 2 months ago
O-Router: an optical routing framework for low power on-chip silicon nano-photonic integration
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
Duo Ding, Yilin Zhang, Haiyu Huang, Ray T. Chen, D...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 28 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
MMNS
2003
102views Multimedia» more  MMNS 2003»
13 years 9 months ago
A Heuristic Algorithm for the Multi-constrained Multicast Tree
Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality...
Wen-Lin Yang
JNW
2008
117views more  JNW 2008»
13 years 7 months ago
An Intelligent Multicast Ad-hoc On demand Distance Vector Protocol for MANETs
-Recently multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data disseminat...
E. Baburaj, V. Vasudevan