On buffer-economical store-and-forward deadlock prevention

Baruch Awerbuch; Shay Kutten; David Peleg

doi:10.1109/infcom.1991.147532

On buffer-economical store-and-forward deadlock prevention

Baruch Awerbuch, Shay Kutten, David Peleg

Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

Store-and-forward deadlock prevention in communication networks is addressed. The approach adopted is that of establishing buffer classes in order to prevent cyclic waiting chains. This type of solution usually requires many buffers. The main contribution of the current study is in showing that the number of required buffers can be reduced considerably by using a hierarchical organization of the network. A novel hierarchical scheme for arbitrary networks is proposed, that features a trade-off between the communication overhead and the buffer requirements of the routing. This trade-off can be shown to be close to optimal.

Original language	English
Title of host publication	Networking in the 90s
Publisher	Publ by IEEE
Pages	410-414
Number of pages	5
ISBN (Print)	0879426942, 9780879426941
DOIs	https://doi.org/10.1109/infcom.1991.147532
State	Published - 1991
Externally published	Yes
Event	Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91 - Bal Harbour, FL, USA Duration: 7 Apr 1991 → 11 Apr 1991

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	1
ISSN (Print)	0743-166X

Conference

Conference	Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91
City	Bal Harbour, FL, USA
Period	7/04/91 → 11/04/91

Access to Document

10.1109/infcom.1991.147532

Cite this

@inproceedings{66afb65eeca047fe9d70dec9a785e841,

title = "On buffer-economical store-and-forward deadlock prevention",

abstract = "Store-and-forward deadlock prevention in communication networks is addressed. The approach adopted is that of establishing buffer classes in order to prevent cyclic waiting chains. This type of solution usually requires many buffers. The main contribution of the current study is in showing that the number of required buffers can be reduced considerably by using a hierarchical organization of the network. A novel hierarchical scheme for arbitrary networks is proposed, that features a trade-off between the communication overhead and the buffer requirements of the routing. This trade-off can be shown to be close to optimal.",

author = "Baruch Awerbuch and Shay Kutten and David Peleg",

year = "1991",

doi = "10.1109/infcom.1991.147532",

language = "אנגלית",

isbn = "0879426942",

series = "Proceedings - IEEE INFOCOM",

publisher = "Publ by IEEE",

pages = "410--414",

booktitle = "Networking in the 90s",

note = "Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91 ; Conference date: 07-04-1991 Through 11-04-1991",

}

Awerbuch, B, Kutten, S & Peleg, D 1991, On buffer-economical store-and-forward deadlock prevention. in Networking in the 90s. Proceedings - IEEE INFOCOM, vol. 1, Publ by IEEE, pp. 410-414, Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91, Bal Harbour, FL, USA, 7/04/91. https://doi.org/10.1109/infcom.1991.147532

TY - GEN

T1 - On buffer-economical store-and-forward deadlock prevention

AU - Awerbuch, Baruch

AU - Kutten, Shay

AU - Peleg, David

PY - 1991

Y1 - 1991

N2 - Store-and-forward deadlock prevention in communication networks is addressed. The approach adopted is that of establishing buffer classes in order to prevent cyclic waiting chains. This type of solution usually requires many buffers. The main contribution of the current study is in showing that the number of required buffers can be reduced considerably by using a hierarchical organization of the network. A novel hierarchical scheme for arbitrary networks is proposed, that features a trade-off between the communication overhead and the buffer requirements of the routing. This trade-off can be shown to be close to optimal.

AB - Store-and-forward deadlock prevention in communication networks is addressed. The approach adopted is that of establishing buffer classes in order to prevent cyclic waiting chains. This type of solution usually requires many buffers. The main contribution of the current study is in showing that the number of required buffers can be reduced considerably by using a hierarchical organization of the network. A novel hierarchical scheme for arbitrary networks is proposed, that features a trade-off between the communication overhead and the buffer requirements of the routing. This trade-off can be shown to be close to optimal.

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

U2 - 10.1109/infcom.1991.147532

DO - 10.1109/infcom.1991.147532

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0025747327

SN - 0879426942

SN - 9780879426941

T3 - Proceedings - IEEE INFOCOM

SP - 410

EP - 414

BT - Networking in the 90s

PB - Publ by IEEE

T2 - Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91

Y2 - 7 April 1991 through 11 April 1991

ER -

On buffer-economical store-and-forward deadlock prevention

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this