Sciweavers

2 search results - page 1 / 1
» Online Packet Routing on Linear Arrays and Rings
Sort
View
ICALP
2001
Springer
13 years 9 months ago
Online Packet Routing on Linear Arrays and Rings
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
Jessen T. Havill
SPAA
1999
ACM
13 years 9 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...