Universal O(congestion+dilation+log1+ε N) local control packet switching algorithms

Rafail Ostrovsky; Yuval Rabani

doi:10.1145/258533.258659

Universal O(congestion+dilation+log^1+ε N) local control packet switching algorithms

Rafail Ostrovsky^*, Yuval Rabani

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

51 Scopus citations

Abstract

A nearly optimal local control algorithm is demonstrated on the open problem given that for any network, given any collection of packets with a specified route for each packet, there exists an `optimal' schedule for all these packets. That is, there exists a schedule for the motion of the packets such that at each step, every edge is crossed by at most one packet, and all the packets are delivered to their destinations in O(C+D) steps where C is the `congestion', and D is the `dilation'. A randomized local control algorithm is shown which for any network topology delivers all the packets to their destination in time O(C+D+log^1+ε N) with high probability, where N is the size of the problem, and ε>0 is arbitrary.

Original language	American English
Pages (from-to)	644-653
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/258533.258659
State	Published - 1997
Externally published	Yes
Event	Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA Duration: 4 May 1997 → 6 May 1997

Access to Document

10.1145/258533.258659

Cite this

@article{cf6a45ecad7747288683c55e76f414ac,

title = "Universal O(congestion+dilation+log1+ε N) local control packet switching algorithms",

abstract = "A nearly optimal local control algorithm is demonstrated on the open problem given that for any network, given any collection of packets with a specified route for each packet, there exists an `optimal' schedule for all these packets. That is, there exists a schedule for the motion of the packets such that at each step, every edge is crossed by at most one packet, and all the packets are delivered to their destinations in O(C+D) steps where C is the `congestion', and D is the `dilation'. A randomized local control algorithm is shown which for any network topology delivers all the packets to their destination in time O(C+D+log1+ε N) with high probability, where N is the size of the problem, and ε>0 is arbitrary.",

author = "Rafail Ostrovsky and Yuval Rabani",

year = "1997",

doi = "10.1145/258533.258659",

language = "American English",

pages = "644--653",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing ; Conference date: 04-05-1997 Through 06-05-1997",

}

TY - JOUR

T1 - Universal O(congestion+dilation+log1+ε N) local control packet switching algorithms

AU - Ostrovsky, Rafail

AU - Rabani, Yuval

PY - 1997

Y1 - 1997

N2 - A nearly optimal local control algorithm is demonstrated on the open problem given that for any network, given any collection of packets with a specified route for each packet, there exists an `optimal' schedule for all these packets. That is, there exists a schedule for the motion of the packets such that at each step, every edge is crossed by at most one packet, and all the packets are delivered to their destinations in O(C+D) steps where C is the `congestion', and D is the `dilation'. A randomized local control algorithm is shown which for any network topology delivers all the packets to their destination in time O(C+D+log1+ε N) with high probability, where N is the size of the problem, and ε>0 is arbitrary.

AB - A nearly optimal local control algorithm is demonstrated on the open problem given that for any network, given any collection of packets with a specified route for each packet, there exists an `optimal' schedule for all these packets. That is, there exists a schedule for the motion of the packets such that at each step, every edge is crossed by at most one packet, and all the packets are delivered to their destinations in O(C+D) steps where C is the `congestion', and D is the `dilation'. A randomized local control algorithm is shown which for any network topology delivers all the packets to their destination in time O(C+D+log1+ε N) with high probability, where N is the size of the problem, and ε>0 is arbitrary.

UR - http://www.scopus.com/inward/record.url?scp=0030645275&partnerID=8YFLogxK

U2 - 10.1145/258533.258659

DO - 10.1145/258533.258659

M3 - Conference article

AN - SCOPUS:0030645275

SN - 0734-9025

SP - 644

EP - 653

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing

Y2 - 4 May 1997 through 6 May 1997

ER -

Universal O(congestion+dilation+log^1+ε N) local control packet switching algorithms

Abstract

Access to Document

Other files and links

Fingerprint

Cite this