Sciweavers

35 search results - page 5 / 7
» A distributed algorithm of delay bounded multicast routing f...
Sort
View
SPAA
1996
ACM
14 years 22 days ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
ICPP
1998
IEEE
14 years 25 days ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
DFG
2009
Springer
14 years 3 months ago
Interactive Communication, Diagnosis and Error Control in Networks
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
Rudolf Ahlswede, Harout K. Aydinian
COMCOM
1998
102views more  COMCOM 1998»
13 years 8 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
ICMCS
2009
IEEE
138views Multimedia» more  ICMCS 2009»
13 years 6 months ago
Multi-rate peer-to-peer video conferencing: A distributed approach using scalable coding
We consider multi-rate peer-to-peer multi-party conferencing applications, where different receivers in the same group can receive videos at different rates using, for example, sc...
Miroslav Ponec, Sudipta Sengupta, Minghua Chen, Ji...