Transforming general networks into feed-forward by using turn-prohibition

Authors:
Juan Echagüe;Jesús Villadangos;Vicent Cholvi;Manuel Prieto
Affiliations:
Universitat Jaume I, Campus del Riu sec, 12071 Castellón, Spain;Universidad Pública de Navarra, Campus de Arrosadıa, 31006 Pamplona, Spain;Universitat Jaume I, Campus del Riu sec, 12071 Castellón, Spain;Universidad Pública de Navarra, Campus de Arrosadıa, 31006 Pamplona, Spain
Venue:
Computer Communications
Year:
2008

Citing 13
Cited 0

A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks

IEEE Transactions on Parallel and Distributed Systems
A quantitative comparison of graph-based models for Internet topology

IEEE/ACM Transactions on Networking (TON)
Nondeterministic Algorithms

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Performance of Computer Communication Systems: A Model-Based Approach

Performance of Computer Communication Systems: A Model-Based Approach
Application of network calculus to general topologies using turn-prohibition

IEEE/ACM Transactions on Networking (TON)
Prevention of deadlocks and livelocks in lossless backpressured packet networks

IEEE/ACM Transactions on Networking (TON)
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
A calculus for network delay. I. Network elements in isolation

IEEE Transactions on Information Theory
Modeling Internet topology

IEEE Communications Magazine
Autonet: a high-speed, self-configuring local area network using point-to-point links

IEEE Journal on Selected Areas in Communications
Problems in large LANs

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding tables. It is also needed to prevent the occurrence of deadlocks caused by certain routing protocols. Furthermore, most of the techniques used to work with communication networks can only be applied if the network topology is free of cycles. We present a distributed protocol which, applied to any network topology, provides a cycle-free topology. Our approach is based on the prohibition of only certain turns in the network. In contrast to previous proposals, our protocol is fully distributed, and thus does not require nodes to have knowledge of the global network topology. Furthermore, it allows multiple nodes to initiate the protocol in an independent manner. This feature can be used to cope with new nodes entering the system, as well as with nodes leaving it (voluntarily or due to a failure). We provide a detailed description of our proposal, formal proof of correctness, and an analysis of its performance.