A bounded-hop-count deflection scheme for Manhattan-street networks

  • Authors:
  • Włodek Dobosiewicz;Paweł Gburzynski

  • Affiliations:
  • Monmouth University, Department of Computer Science, NJ;University of Alberta, Department of Computing Science, Edmonton, AB, Canada

  • Venue:
  • INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a deflection method suitable for Manhattan-street networks (MSN), which, without dropping packets, limits the number of hops travelled by a packet on its way from source to destination. The proposed routing scheme is intended for bidirectional networks-with four incoming and four outgoing links per switch. In terms of average performance measures, our method performs not worse than the best local routing schemes, when the offered load is light or moderate. Unlike other deflection schemes proposed for MSN, our method is inherently asynchronous. This simplifies the switch design and eliminates some problems with the original synchronous approach, like the need to account for slight discrepancies in transmission rates of different switches.