Efficient many-to-many real-time communication using an intelligent Ethernet switch

This paper presents a solution for efficient many-to-many communication over switched Ethernet. The performance of using an ordinary switch and an intelligent switch is compared, and the results of the analysis based on 100 Mbit/s fast Ethernet show that an intelligent switch used to handle many-to-many communication can give better performance (shorter latency and higher utilization) than an ordinary switch. We also extend the network to serve many-to-many traffic with real-time demands by adding a thin software layer to the intelligent Ethernet switch and the end-nodes. Earliest deadline first (EDF) scheduling is used.

[1]  Yuanyuan Yang,et al.  Pipelined All-to-All Broadcast in All-Port Meshes and Tori , 2001, IEEE Trans. Computers.

[2]  Hee Yong Youn,et al.  On the scalability of many-to-many reliable multicast sessions , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[3]  K. Konstantinides.  VLIW Architecture For Media Processing , 1998, IEEE Signal Processing Magazine.

[4]  Gyungho Lee,et al.  The Effectiveness of Combining in Shared Memory Parallel Computer in the Presence of "Hot Spots" , 1986, ICPP.

[5]  Magnus Jonsson.  Fiber-Optic Interconnection Networks for Signal Processing Applications , 1999, IPPS/SPDP Workshops.

[6]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[7]  Keqin Li,et al.  Fault tolerant all-to-all broadcast in general interconnection networks , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).

[8]  Yoram Ofek,et al.  Adaptive real-time group multicast , 1997, Proceedings of INFOCOM '97.

[9]  Magnus Jonsson,et al.  Fibre-ribbon ring network with inherent support for earliest deadline first message scheduling , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[10]  Sanjay Ranka,et al.  Many-to-many personalized communication with bounded traffic , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[11]  Magnus Jonsson,et al.  Deadline first scheduling in switched real-time Ethernet - deadline partitioning issues and software implementation experiments , 2002 .

[12]  Magnus Jonsson,et al.  Switched real-time ethernet with earliest deadline first scheduling protocols and traffic handling , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[13]  Ora E. Percus,et al.  Performance Differences Among Combining Switch Architectures , 1992, ICPP.

[14]  K. Teitelbaum,et al.  Crossbar tree networks for embedded signal processing applications , 1998, Proceedings. Fifth International Conference on Massively Parallel Processing (Cat. No.98EX182).

[15]  Louise E. Moser,et al.  A reliable many-to-many multicast protocol for group communication over ATM networks , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[16]  Allan Borodin,et al.  Deterministic Many-to-Many Hot Potato Routing , 1997, IEEE Trans. Parallel Distributed Syst..