Approximation Schemes for Broadcasting in Heterogenous Networks

13 years 10 months ago

Download www.engr.uconn.edu

We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any other processor in the cluster. Previously,

Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger

Real-time Traffic

Algorithms | APPROX 2004 | Broadcast Time | Transmission Time |

claim paper

» Approximation Algorithms for Data Broadcast in Wireless Networks

» Flexible Broadcasting of Scalable Video Streams to Heterogeneous Mobile Devices

» Broadcasting on large scale heterogeneous platforms under the bounded multiport model

» Distributed Successive Approximation Coding using Broadcast Advantage The TwoEncoder Case

» Optimized opportunistic multicast scheduling OMS over wireless cellular networks

» Power Adaptive Broadcasting with Local Information in Ad Hoc Networks

» Market Driven Dynamic Spectrum Allocation over Space and Time among RadioAccess Networks D...

» Border Node Retransmission Based Probabilistic Broadcast Protocols in AdHoc Networks

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	APPROX
Authors	Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger

Comments (0)

Sciweavers

Approximation Schemes for Broadcasting in Heterogenous Networks

Algorithms | APPROX 2004 | Broadcast Time | Transmission Time |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers