Routing by controlled flooding in communication networks

Ofrit Lesser; Raphael Rom

Routing by controlled flooding in communication networks

Ofrit Lesser, Raphael Rom

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

5 Scopus citations

Abstract

A controlled flooding scheme that retains the desired properties of flooding yet limits the extent of message flooding through the network is proposed. This is done by assigning costs for link traversal and allowing a packet to expend only a limited total cost for network traversal. A performance criterion is proposed, and the problem of assigning costs to links so that optimal performance is achieved is considered. The optimal assignment problem is characterized for networks with both homogeneous and heterogeneous traffic patterns. The latter, being computationally complex, can efficiently be solved only by heuristic algorithms, one of which is outlined.

Original language	English
Pages (from-to)	910-917
Number of pages	8
Journal	Proceedings - IEEE INFOCOM
State	Published - 1 Dec 1990
Externally published	Yes
Event	Proceedings of IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies - San Francisco, CA, USA Duration: 3 Jun 1990 → 4 Jun 1990

ASJC Scopus subject areas

General Computer Science
Electrical and Electronic Engineering

Cite this

@article{20919d0592ff4ae38dcdab31e6ab4f9f,

title = "Routing by controlled flooding in communication networks",

abstract = "A controlled flooding scheme that retains the desired properties of flooding yet limits the extent of message flooding through the network is proposed. This is done by assigning costs for link traversal and allowing a packet to expend only a limited total cost for network traversal. A performance criterion is proposed, and the problem of assigning costs to links so that optimal performance is achieved is considered. The optimal assignment problem is characterized for networks with both homogeneous and heterogeneous traffic patterns. The latter, being computationally complex, can efficiently be solved only by heuristic algorithms, one of which is outlined.",

author = "Ofrit Lesser and Raphael Rom",

year = "1990",

month = dec,

day = "1",

language = "English",

pages = "910--917",

journal = "Proceedings - IEEE INFOCOM",

issn = "0743-166X",

publisher = "Institute of Electrical and Electronics Engineers",

note = "Proceedings of IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies ; Conference date: 03-06-1990 Through 04-06-1990",

}

TY - JOUR

T1 - Routing by controlled flooding in communication networks

AU - Lesser, Ofrit

AU - Rom, Raphael

PY - 1990/12/1

Y1 - 1990/12/1

N2 - A controlled flooding scheme that retains the desired properties of flooding yet limits the extent of message flooding through the network is proposed. This is done by assigning costs for link traversal and allowing a packet to expend only a limited total cost for network traversal. A performance criterion is proposed, and the problem of assigning costs to links so that optimal performance is achieved is considered. The optimal assignment problem is characterized for networks with both homogeneous and heterogeneous traffic patterns. The latter, being computationally complex, can efficiently be solved only by heuristic algorithms, one of which is outlined.

AB - A controlled flooding scheme that retains the desired properties of flooding yet limits the extent of message flooding through the network is proposed. This is done by assigning costs for link traversal and allowing a packet to expend only a limited total cost for network traversal. A performance criterion is proposed, and the problem of assigning costs to links so that optimal performance is achieved is considered. The optimal assignment problem is characterized for networks with both homogeneous and heterogeneous traffic patterns. The latter, being computationally complex, can efficiently be solved only by heuristic algorithms, one of which is outlined.

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

M3 - Conference article

AN - SCOPUS:0025539418

SN - 0743-166X

SP - 910

EP - 917

JO - Proceedings - IEEE INFOCOM

JF - Proceedings - IEEE INFOCOM

T2 - Proceedings of IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies

Y2 - 3 June 1990 through 4 June 1990

ER -

Routing by controlled flooding in communication networks

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this