Search Sciweavers | Sciweavers

We consider a queue with renewal arrivals and n exponential servers in the Halfin-Whitt heavy traffic regime, where n and the arrival rate increase without bound, so that a critic...

Rami Atar, Adam Shwartz

claim paper

Read More »

133

click to vote

NETWORKS
2006

76views Computer Networks» more NETWORKS 2006»

Efficiency and fairness of system-optimal routing with user constraints

15 years 6 months ago

Download www.columbia.edu

Andreas S. Schulz, Nicolás E. Stier Moses

claim paper

Read More »

136

click to vote

JISE
2007

62views more JISE 2007»

A Scatternet Formation Algorithm for Efficient Routing on Bluetooth Networks

15 years 6 months ago

Download www.iis.sinica.edu.tw

Kuei-Ping Shih, Sheng-Shih Wang, Jen-Hung Su

claim paper

Read More »

127

click to vote

INFOCOM
2010
IEEE

284views Communications» more INFOCOM 2010»

CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments

15 years 5 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers