Greedy packet scheduling on shortest paths (preliminary version)

Authors:
Yishay Mansour;Boaz Patt-Shamir
Affiliations:
Aiken computation Laboratory, Harvard University, Cambridge, MA;Laboratory for Computer Science, MIT, Cambridge, MA
Venue:
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Year:
1991

Data networks

Data networks
SNA: IBM's networking solution

SNA: IBM's networking solution
Computer networks

Computer networks
Greedy packet scheduling

Proceedings of the 4th international workshop on Distributed algorithms
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Requirements for deadlock-free, adaptive packet routing

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
On the hardness of approximating optimum schedule problems in store and forward networks

IEEE/ACM Transactions on Networking (TON)
Adversarial queueing theory

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Deadlock-free routing in arbitrary networks via the flattest common supersequence method

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Adversarial queuing theory

Journal of the ACM (JACM)
Deterministic Many-to-Many Hot Potato Routing

IEEE Transactions on Parallel and Distributed Systems
Database placement in communication networks for minimizing the overall transmission cost

Mathematical and Computer Modelling: An International Journal

Hi-index	0.00