Sharp approximate models of deflection routing in mesh networks

Albert G. Greenberg, Jonathan Goodman

Research output: Contribution to journalArticle

Abstract

Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. In this paper we focus on deflection routing in the Manhattan street network (a two-dimensional directed mesh), though our analytic approach should apply to any regular network. We present two approximate performance models that give sharp estimates of the steady state throughout and the average packet delay for packets admitted to the network. The results of extensive simulation experiments are reported, which corroborate the models' predictions. The results show that deflection routing is very effective. Two measures of the merit of a network for deflection routing are its diameter and its deflection index. Networks are presented whose diameter and deflection index are near the optimal values.

Original languageEnglish (US)
Pages (from-to)210-223
Number of pages14
JournalIEEE Transactions on Communications
Volume41
Issue number1
DOIs
StatePublished - Jan 1993

Fingerprint

Telecommunication networks
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Sharp approximate models of deflection routing in mesh networks. / Greenberg, Albert G.; Goodman, Jonathan.

In: IEEE Transactions on Communications, Vol. 41, No. 1, 01.1993, p. 210-223.

Research output: Contribution to journalArticle

Greenberg, Albert G. ; Goodman, Jonathan. / Sharp approximate models of deflection routing in mesh networks. In: IEEE Transactions on Communications. 1993 ; Vol. 41, No. 1. pp. 210-223.
@article{2996e66ef5a44bb2b020298f316f0725,
title = "Sharp approximate models of deflection routing in mesh networks",
abstract = "Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. In this paper we focus on deflection routing in the Manhattan street network (a two-dimensional directed mesh), though our analytic approach should apply to any regular network. We present two approximate performance models that give sharp estimates of the steady state throughout and the average packet delay for packets admitted to the network. The results of extensive simulation experiments are reported, which corroborate the models' predictions. The results show that deflection routing is very effective. Two measures of the merit of a network for deflection routing are its diameter and its deflection index. Networks are presented whose diameter and deflection index are near the optimal values.",
author = "Greenberg, {Albert G.} and Jonathan Goodman",
year = "1993",
month = "1",
doi = "10.1109/26.212380",
language = "English (US)",
volume = "41",
pages = "210--223",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Sharp approximate models of deflection routing in mesh networks

AU - Greenberg, Albert G.

AU - Goodman, Jonathan

PY - 1993/1

Y1 - 1993/1

N2 - Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. In this paper we focus on deflection routing in the Manhattan street network (a two-dimensional directed mesh), though our analytic approach should apply to any regular network. We present two approximate performance models that give sharp estimates of the steady state throughout and the average packet delay for packets admitted to the network. The results of extensive simulation experiments are reported, which corroborate the models' predictions. The results show that deflection routing is very effective. Two measures of the merit of a network for deflection routing are its diameter and its deflection index. Networks are presented whose diameter and deflection index are near the optimal values.

AB - Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. In this paper we focus on deflection routing in the Manhattan street network (a two-dimensional directed mesh), though our analytic approach should apply to any regular network. We present two approximate performance models that give sharp estimates of the steady state throughout and the average packet delay for packets admitted to the network. The results of extensive simulation experiments are reported, which corroborate the models' predictions. The results show that deflection routing is very effective. Two measures of the merit of a network for deflection routing are its diameter and its deflection index. Networks are presented whose diameter and deflection index are near the optimal values.

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

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

U2 - 10.1109/26.212380

DO - 10.1109/26.212380

M3 - Article

VL - 41

SP - 210

EP - 223

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 1

ER -