Sciweavers

301 search results - page 31 / 61
» On routes and multicast trees in the Internet
Sort
View
INFOCOM
1999
IEEE
13 years 12 months ago
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
Dean H. Lorenz, Ariel Orda
COMCOM
2006
81views more  COMCOM 2006»
13 years 7 months ago
A case for tree evolution in QoS multicasting
The phenomenal growth of group communications and QoS-aware applications over the Internet have accelerated the development of multicasting technologies. The Core-Based Tree (CBT) ...
Anirban Chakrabarti, G. Manimaran
LCN
2000
IEEE
14 years 1 days ago
Tree-Based Reliable Multicast in Combined Fixed/Mobile IP Networks
This paper proposes a solution to delivering multicast data reliably not only to/from fixed hosts but also to/from mobile hosts in combined fixed/mobile IP networks, particularl...
Wonyong Yoon, Dongman Lee, Chansu Yu, Myungchul Ki...
CIIT
2004
144views Communications» more  CIIT 2004»
13 years 9 months ago
Load balancing for reliable multicast
New applications emerge along with the rapid growth of the Internet. Many functionalities other than packet forwarding are being proposed to be added into routers for supporting t...
Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Ragha...
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 1 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia