Sciweavers

625 search results - page 33 / 125
» Semi-preemptive routing on trees
Sort
View
ICCAD
1995
IEEE
140views Hardware» more  ICCAD 1995»
13 years 11 months ago
Bounded-skew clock and Steiner routing under Elmore delay
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
Jason Cong, Andrew B. Kahng, Cheng-Kok Koh, Chung-...
TON
2002
94views more  TON 2002»
13 years 7 months ago
Multicast routing and wavelength assignment in multihop optical networks
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
Ran Libeskind-Hadas, Rami G. Melhem
CCIA
2005
Springer
13 years 9 months ago
Multi-Objective Multicast Routing based on Ant Colony Optimization
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...
Diego Pinto, Benjamín Barán, Ram&oac...
NGC
2001
Springer
116views Communications» more  NGC 2001»
13 years 12 months ago
Scalable IP Multicast Sender Access Control for Bi-directional Trees
Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is impor...
Ning Wang, George Pavlou
NETGAMES
2003
ACM
14 years 20 days ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...