English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In 1988, Leighton, Maggs and Rao proved a much celebrated result: 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 of 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” (i.e., the maximum number of paths that share the same edge), and D is the “dilation” (i.e., the length of the longest path). The proof was non-constructive and relied on Lovász Local Lemma. In a followup paper, Leighton, Maggs, and Richa gave a centralized algorithm for finding the schedule. The original paper left open the question whether there exists a constructive distributed “on-line” algorithm with the same optimal performance. Last year, Rabani and Tardos presented a randomized local-control algorithm which with high probability delivers all packets in time O ( C + D · ( (log∗ N) ∗ N) ) + + (log N) ) . In this paper, we show a nearly optimal local control algorithm for this long-standing open problem. That is, we show a randomized local control algorithm which for any network topology delivers all the packets to their destinations in time O(C + D +log N) with high probability, where N is the size of the problem, and > 0 is arbitrary. Our result has implications to ATM (Asynchronous Transfer Mode) packet switching algorithms and other applications. ∗Bell Communications Research, MCC-1C365B, Morristown, NJ 07960-6438, USA. Email: rafail@bellcore.com †Computer Science Department, Technion — IIT, Haifa 32000, Israel. Part of this work was done while visiting Bell Communications Research. Work supported by grants from the Fund for the Promotion of Sponsored Research and from the Fund for the Promotion of Research at the Technion, and by a David and Ruth Moskowitz Academic Lecturship award. Email: rabani@cs.technion.ac.il

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

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