Adapting to a Reliable Network Path

Baruch Awerbuch; Yishay Mansour

doi:10.1145/872035.872090

Adapting to a Reliable Network Path

Baruch Awerbuch^*, Yishay Mansour

^*Corresponding author for this work

School of Computer Science

Johns Hopkins University

Research output: Contribution to conference › Paper › peer-review

13 Scopus citations

Abstract

We consider the model of unreliable network links, where at each time unit a link might be either up or down, We consider two related problems. The first, establishing end to end communication between two given nodes, where the performance measure is the average number of times the chosen path was disconnected. The second, is to build a spanning tree rooted at a given source node, where the performance measure is the average number of nodes that are the disconnected from the source. For both problems we design competitive algorithms.

Original language	English
Pages	360-367
Number of pages	8
DOIs	https://doi.org/10.1145/872035.872090
State	Published - 2003
Event	Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States Duration: 13 Jul 2003 → 16 Jul 2003

Conference

Conference	Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
Country/Territory	United States
City	Boston, MA
Period	13/07/03 → 16/07/03

Access to Document

10.1145/872035.872090

Cite this

@conference{28338515e0a149739153c53e0d87783c,

title = "Adapting to a Reliable Network Path",

abstract = "We consider the model of unreliable network links, where at each time unit a link might be either up or down, We consider two related problems. The first, establishing end to end communication between two given nodes, where the performance measure is the average number of times the chosen path was disconnected. The second, is to build a spanning tree rooted at a given source node, where the performance measure is the average number of nodes that are the disconnected from the source. For both problems we design competitive algorithms.",

author = "Baruch Awerbuch and Yishay Mansour",

year = "2003",

doi = "10.1145/872035.872090",

language = "אנגלית",

pages = "360--367",

note = "Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 ; Conference date: 13-07-2003 Through 16-07-2003",

}

TY - CONF

T1 - Adapting to a Reliable Network Path

AU - Awerbuch, Baruch

AU - Mansour, Yishay

PY - 2003

Y1 - 2003

N2 - We consider the model of unreliable network links, where at each time unit a link might be either up or down, We consider two related problems. The first, establishing end to end communication between two given nodes, where the performance measure is the average number of times the chosen path was disconnected. The second, is to build a spanning tree rooted at a given source node, where the performance measure is the average number of nodes that are the disconnected from the source. For both problems we design competitive algorithms.

AB - We consider the model of unreliable network links, where at each time unit a link might be either up or down, We consider two related problems. The first, establishing end to end communication between two given nodes, where the performance measure is the average number of times the chosen path was disconnected. The second, is to build a spanning tree rooted at a given source node, where the performance measure is the average number of nodes that are the disconnected from the source. For both problems we design competitive algorithms.

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

U2 - 10.1145/872035.872090

DO - 10.1145/872035.872090

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:1142268836

SP - 360

EP - 367

T2 - Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003

Y2 - 13 July 2003 through 16 July 2003

ER -

Adapting to a Reliable Network Path

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this