METANET: principles of an arbitrary topology LAN
IEEE/ACM Transactions on Networking (TON)
Concurrent Asynchronous Broadcast on the MetaNet
IEEE Transactions on Computers
Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Convergence Routing under Bursty Traffic: Instability and an AIMD Controller
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Convergence routing is a unique variant of deflection routing which ensures that packets (or cells) will converge to their destinations along a global sense of direction. In this work we show how a global sense of direction can be used in an arbitrary network for the design of a control algorithm which (a) ensures fair access in switch-based local area networks, (b) is efficient with respect to performance measures we have developed, and (c) is easily interfaced to the convergence routing mechanism. We present performance measures which assess the new access- and flow-control algorithm: (i) locality- only the sub-network containing conflicting traffic streams gets involved in the fairness regulation; (ii) scalability-the data-structure sizes used in the algorithm are a function of the switching node degree, and use constant space control signals of only a-bit (the ATM standard, for example, dedicates four bits in the header of each cell to generic flow-control); (iii) linear access-time measured by the "the maximal clique in the conflict-graph to which a node belongs", and a frequency which is inverse linear in this parameter (when the traffic pattern stabilizes).