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

Schroeder, Michael; Birrell, Andrew; Burrows, Michael T.; Murray, H.; Needham, Roger M.; Rodeheffer, Thomas L.; Satterthwaite, E.H.; Thacker, Charles P.

doi:10.1109/49.105178

Cited by 505 publications

(337 citation statements)

References 18 publications

(8 reference statements)

Supporting

Mentioning

336

Contrasting

Unclassified

Order By: Relevance

“…Instead of fully prohibiting use of links, a more efÞcient approach is to prohibit use of turns. With the up/down routing algorithm [23], a spanning tree is Þrst constructed, and nodes are ordered according to the level at which they are located on the tree (the level of a node is deÞned at its distance from the root). Nodes at the same level are ordered arbitrarily.…”

Section: B Up/down Routingmentioning

confidence: 99%

See 1 more Smart Citation

Application of network calculus to general topologies using turn-prohibition

Starobinski

Karpovsky

Zakrevski

2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Network calculus is known to apply in general only to feed-forward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we address the problem of using network calculus in networks of arbitrary topology. For this purpose, we introduce a novel graph-theoretic algorithm, called turn-prohibition (TP), that breaks all the cycles in a network and, thus, prevents any interdependence between flows. We prove that the TP-algorithm prohibits the use of at most 1/3 of the total number turns in a network, for any network topology. Using analysis and simulation, we show that the TP-algorithm significantly outperforms other approaches for breaking cycles, such as the spanning tree and up/down routing algorithms, in terms of network utilization and delay bounds. Our simulation results also show that the network utilization achieved with the TP-algorithm is within a factor of two of the maximum theoretical network utilization, for networks of up to 50 nodes of degree four. Thus, in many practical cases, the restriction of network calculus to feed-forward routing networks may not represent a too significant limitation.

show abstract

Section: B Up/down Routingmentioning

confidence: 99%

“…In particular, the up/down routing scheme, developed in the context of a local area network called Autonet, uses a similar concept [23]. However, this scheme does not systematically attempt at minimizing the amount of prohibited turns in the network and its performance is much less predictable.…”

Section: Introductionmentioning

confidence: 99%

Application of network calculus to general topologies using turn-prohibition

Starobinski

Karpovsky

Zakrevski

2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…We now describe the up-down routing [16] used in our multiple multicast algorithm. The up-down routing mechanism first uses a breadth-first search to build a spanning tree T for the switch connection graph G = (V , E).…”

Section: Routing Mechanismmentioning

confidence: 99%

“…This makes routing on such systems quite complicated. In the past few years, several routing algorithms have been proposed in the literature for irregular networks [1,11,15,16]. These routing algorithms are quite complex and thus make implementation of contention-free multicast operations very difficult.…”

Section: Introductionmentioning

confidence: 99%

An optimal scheduling algorithm for an agent-based multicast strategy on irregular networks

Liu

Lin

et al. 2007

J Supercomput

View full text Add to dashboard Cite

This paper describes an agent-based approach for scheduling multiple multicast on wormhole switch-based networks with irregular topologies. Multicast/broadcast is an important communication pattern, with applications in collective communication operations such as barrier synchronization and global combining. Our approach assigns an agent to each subtree of switches such that the agents can exchange information efficiently and independently. The entire multicast problem is then recursively solved with each agent sending message to those switches that it is responsible for. In this way, communication is localized by the assignment of agents to subtrees. This idea can be easily generalized to multiple multicast since the order of message passing among agents can be interleaved for different multicasts. The key to the performance of this agent-based approach is the message-passing scheduling between agents and the destination processors. We propose an optimal scheduling algorithm, called ForwardInSwitch to solve this problem. We conduct extensive experiments to demonstrate the efficiency of our approach by comparing our results with SPCCO, a highly efficient multicast algorithm reported in literature. We found that SPCCO suffers link contention when the number of simultaneous multiple multicast becomes large. On the other hand, our agent-based approach achieves better performance in large cases.

show abstract

“…Up*/down* [7] is one of the best known routing algorithms for irregular networks. It is based on an assignment of direction labels ("up" or "down") to links.…”

Section: Introductionmentioning

confidence: 99%

Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing

Flich

López

Malumbres

et al. 2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In previous papers we proposed the ITB mechanism to improve the performance of up*/down* routing in irregular networks with source routing. With this mechanism, both minimal routing and a better use of network links are guaranteed, resulting on an overall network performance improvement. In this paper, we show that the ITB mechanism can be used with any source routing scheme in the COW environment. In particular, we apply ITBs to DFS and routing algorithms, which provide better routes than up*/down* routing. Results show that ITB strongly improves DFS and Smart throughput (by 63% and 23%, respectively, for 64-switch networks).

show abstract

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

Cited by 505 publications

References 18 publications

Application of network calculus to general topologies using turn-prohibition

Application of network calculus to general topologies using turn-prohibition

An optimal scheduling algorithm for an agent-based multicast strategy on irregular networks

Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing

Contact Info

Product

Resources

About