Routing by controlled flooding in communication networks

Ofrit Lesser, Raphael Rom

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations


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 languageEnglish
Pages (from-to)910-917
Number of pages8
JournalProceedings - IEEE INFOCOM
StatePublished - 1 Dec 1990
Externally publishedYes
EventProceedings of IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies - San Francisco, CA, USA
Duration: 3 Jun 19904 Jun 1990

ASJC Scopus subject areas

  • General Computer Science
  • Electrical and Electronic Engineering


Dive into the research topics of 'Routing by controlled flooding in communication networks'. Together they form a unique fingerprint.

Cite this