Sciweavers

474 search results - page 19 / 95
» On Multicast Path Finding Algorithms
Sort
View
CCCG
2006
13 years 9 months ago
Shortest Descending Paths through Given Faces
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw
CG
2006
Springer
13 years 7 months ago
A smooth, obstacle-avoiding curve
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
Zhong Li, Dereck S. Meek, Desmond J. Walton
LCN
2006
IEEE
14 years 1 months ago
Protecting Multicast Sessions in Wireless Mesh Networks
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha
IPPS
1997
IEEE
13 years 12 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
COR
2004
99views more  COR 2004»
13 years 7 months ago
A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
Fair bandwidth allocation is an important issue in the multicast network to serve each multicast traffic at a fair rate commensurate with the receiver's capabilities and the ...
Chae Y. Lee, Young P. Moon, Young Joo Cho