ChaosLAN: Design and Implementation of a Gigabit LAN Using Chaotic Routing

In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the chaotic routing algorithm (a.k.a. Chaos) has been the most successful. Although the Chaos router was developed for multicomputer routing, the project has recently directed its attentiontowards theapplicationof Chaos technologyto LAN switching. The present task is to implement a gigabit LAN called ChaosLAN, based on a centralized switch (hub) and high speed serial links to workstations. The switch itself is a fully-populated two-dimensional torus network of Chaos routers. The host adapter is Digital’s PCI Pamette card. To evaluate the performance of ChaosLAN, we are supporting the Global Memory System (GMS), a type of distributed virtual memory also developed at UW. We also describe an application involving real-time haptic rendering used in a surgical simulator. Thisreport has also been publishedin theProc...

• Type: Conference
• Year: 1997
• Where: PCRCW
• Authors: Neil R. McKenzie, Kevin Bolding, Carl Ebeling, Lawrence Snyder
• Keywords: Distributed And Parallel Computing, Mitsubishi Electric Information, PCRCW 1997, Routing Algorithm, Technology Center America