Adaptive packet routing for bursty adversarial traffic

DOI10.1006/jcss.1999.1681zbMath0961.68012OpenAlexW4210598494MaRDI QIDQ1577008

William Aiello, Eyal Kushilevitz, Adi Rosén, Rafail Ostrovsky

Publication date: 27 August 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1681

zbMATH Keywords

networkingpacket routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99)

Related Items (10)

Maria Serna's contributions to adversarial queuing theory ⋮ Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Maximum throughput of multiple access channels in adversarial environments ⋮ Universal stability in multi-hop radio networks ⋮ Authenticated adversarial routing ⋮ On the stability of dynamic diffusion load balancing ⋮ The increase of the instability of networks due to quasi-static link capacities ⋮ UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS ⋮ The continuous maximum capacity path interdiction problem ⋮ A note on models for non-probabilistic analysis of packet switching networks.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the greedy routing algorithm for array networks
• Dynamic load balancing by random matchings
• Universal continuous routing strategies
• Methods for message routing in parallel machines
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
• Slide—The Key to Polynomial End-to-End Communication
• A calculus for network delay. I. Network elements in isolation
• A calculus for network delay. II. Network analysis
• Routing and Admission Control in General Topology Networks with Poisson Arrivals
• A packet routing protocol for arbitrary networks
• Greedy Packet Scheduling on Shortest Paths
• Approximate load balancing on dynamic and asynchronous networks
• The slide mechanism with applications in dynamic networks

This page was built for publication: Adaptive packet routing for bursty adversarial traffic