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 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
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 -