Trade-offs between load and degree in virtual path layouts

Summary, in English

We study virtual path layouts in ATM networks. Packets are routed along virtual paths in the network by maintaining a routing field whose subfields determine intermediate destinations of the packet, i.e., the endpoints of virtual paths on its way to the final destination. Most of the research on virtual path layouts has focused on tradeoffs between load (i.e., the maximum number of virtual paths passing through a link) and the hop number of the layout (i.e., the maximum number of virtual paths needed to travel between any two nodes).



There is however another important limitation on construction of layouts, resulting from technological properties of switches situated at nodes. This bound is the degree of the layout (i.e., the maximum number of virtual paths with a common endpoint). In this paper we study relations between these three parameters of virtual path layouts, for the all-to-all problem. For any integer h, we show tradeoffs between load and degree of h-hop layouts in the ring and in the mesh by establishing upper and lower bounds on these parameters. Our bounds on the degree of an h-hop layout of given load are asymptotically tight and the bounds on the load of an h-hop layout of given degree are asymptotically tight for constant h.

• Författare: Anders Dessmark; Andrzej Lingas; Andrzej Pelc
• Avdelning/ar: Computer Science
• Publiceringsår: 2003
• Språk: Engelska
• Sidor: 485-496
• Publikation/Tidskrift/Serie: Parallel Processing Letters
• Volym: 13
• Issue: 3
• Länkar: http://dx.doi.org/10.1142/S0129626403001446
• Dokumenttyp: Artikel i tidskrift
• Förlag: World Scientific Publishing
• Ämne: Computer Science
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 1793-642X