Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

Voted

HICSS
1995
IEEE

86views Biometrics» more HICSS 1995»

Fast algorithms for finding O(congestion+dilation) packet routing schedules

15 years 6 months ago

Fast algorithms for finding O(congestion+dilation) packet routing schedules

Download www.cs.cmu.edu

Frank Thomson Leighton, Bruce M. Maggs

Real-time Traffic

Biometrics | HICSS 1995 |

claim paper

Related Content

» Finding the Fastest Path in Wireless Networks

» Source Routing and Scheduling in Packet Networks

» Switch Scheduling via Randomized Edge Coloring

» Fast Data Collection in TreeBased Wireless Sensor Networks

» CrossLayer and Path Priority Scheduling Based RealTime Video Communications over Wireless ...

» Scatternet Formation of Bluetooth Ad Hoc Networks

» Dynamic Multipath Allocation in Ad Hoc Networks

» Selective Protection A CostEfficient Backup Scheme for Link State Routing

» On the nodescheduling approach to topology control in ad hoc networks

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	HICSS
Authors	Frank Thomson Leighton, Bruce M. Maggs

Comments (0)