1 Omega Network The omega network is another example of a banyan multistage interconnection network that can be used as a switch fabric The omega differs.

Slides:



Advertisements
Similar presentations
ATM Switch Architectures
Advertisements

Combinational Circuit Yan Gu 2 nd Presentation for CS 6260.
Characteristics of Multichannel Switch * Multichannel Switching The switch has the ability to group channels arbitrarily and support super-rate switching.
Routing Permutation in the Baseline Network and in the Omega Network Student : Tzu-hung Chen 陳子鴻 Advisor : Chiuyuan Chen Department of Applied Mathematics.
NC 論2 (No.2) 1 Indirect (dynamic) Networks Communication between any two nodes has to be carried through some switches. Classified into: –Crossbar network.
1 Delta Network The delta network is one example of a multistage interconnection network that can be used as a switch fabric The delta network is an example.
Spring 2002CS 4611 Router Construction Outline Switched Fabrics IP Routers Tag Switching.
1 Performance Results The following are some graphical performance results out of the literature for different ATM switch designs and configurations For.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 High Speed Router Design Shivkumar Kalyanaraman Rensselaer Polytechnic Institute
Chapter 10 Switching Fabrics. Outline Physical Interconnection Physical box with backplane Individual blades plug into backplane slots Each blade contains.
Bitonic and Merging sorting networks Efficient Parallel Algorithms COMP308.
Spring 2004 EE4272 The Need of Spanning Tree Algorithm.
1 ATM Switching: An Overview Carey Williamson Department of Computer Science University of Calgary.
Interconnection Networks. Applications of Interconnection Nets Interconnection networks are used everywhere! ◦ Supercomputers – connecting the processors.
8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Dynamic Networks CS 213, LECTURE 15 L.N. Bhuyan CS258 S99.
ATM SWITCHING. SWITCHING A Switch is a network element that transfer packet from Input port to output port. A Switch is a network element that transfer.
ATM switching Ram Dantu. Introduction Important characteristics –switching speed –potential to lose cells Must minimize –queuing and switching delay Line.
TO p. 1 Spring 2006 EE 5304/EETS 7304 Internet Protocols Tom Oh Dept of Electrical Engineering Lecture 9 Routers, switches.
1 Copyright © Monash University ATM Switch Design Philip Branch Centre for Telecommunications and Information Engineering (CTIE) Monash University
1 Dynamic Interconnection Networks Miodrag Bolic.
8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Packet Switches.
Switches and indirect networks Computer Architecture AMANO, Hideharu Textbook pp. 92~13 0.
Survey of Performance Analysis on Banyan Networks Written By Nathan D. Truhan Kent State University.
Comparison Networks Sorting Sorting binary values
CSS432: Switching and Bridging 1 Switching and Bridging Textbook Ch3.1 and 3.4 Professor: Munehiro Fukuda.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture.
Delivery, Forwarding, and Routing of IP Packets
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #14 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.
Case Study: The Abacus Switch CS Goals and Considerations Handles cell relay (fixed-size packets) Can be modified to handle variable-sized packets.
Birds Eye View of Interconnection Networks
Final Chapter Packet-Switching and Circuit Switching 7.3. Statistical Multiplexing and Packet Switching: Datagrams and Virtual Circuits 4. 4 Time Division.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
Lecture 4 Sorting Networks. Comparator comparator.
21-Dec-154/598N: Computer Networks Cell Switching (ATM) Connection-oriented packet-switched network Used in both WAN and LAN settings Signaling (connection.
1 Kyung Hee University Chapter 6 Delivery Forwarding, and Routing of IP Packets.
Ch 8. Switching. Switch  Devices that interconnected with each other  Connecting all nodes (like mesh network) is not cost-effective  Some topology.
Comparison Networks Sorting Sorting binary values Sorting arbitrary numbers Implementing symmetric functions.
Data Communications, Kwangwoon University
Based on An Engineering Approach to Computer Networking/ Keshav
MASCON: A Single IC Solution to ATM Multi-Channel Switching With Embedded Multicasting Ali Mohammad Zareh Bidoki April 2002.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 10.
1 A quick tutorial on IP Router design Optics and Routing Seminar October 10 th, 2000 Nick McKeown
1 Buffering Strategies in ATM Switches Carey Williamson Department of Computer Science University of Calgary.
Spring 2000CS 4611 Router Construction Outline Switched Fabrics IP Routers Extensible (Active) Routers.
CS 4594 Broadband Switching Elements and Fabrics.
Structure of a switch We use switches in circuit-switched and packet- switched networks. In this section, we discuss the structures of the switches used.
Chapter 3 Part 3 Switching and Bridging
Lecture 4 Sorting Networks
Interconnection structures
Auburn University COMP8330/7330/7336 Advanced Parallel and Distributed Computing Interconnection Networks (Part 2) Dr.
Dynamic connection system
Lecture 23: Interconnection Networks
URL: Chapter 8 Switching Tel: (03) Ext: URL:
Refer example 2.4on page 64 ACA(Kai Hwang) And refer another ppt attached for static scheduling example.
Chapter 3 Part 3 Switching and Bridging
Packet Switching (basics)
Multiprocessors Interconnection Networks
Indirect Networks or Dynamic Networks
Comparison Networks Sorting Sorting binary values
Router Construction Outline Switched Fabrics IP Routers
High Performance Computing & Bioinformatics Part 2 Dr. Imad Mahgoub
Bitonic and Merging sorting networks
Delta Network The delta network is one example of a multistage interconnection network that can be used as a switch fabric The delta network is an example.
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Chapter 3 Part 3 Switching and Bridging
Birds Eye View of Interconnection Networks
Routing Flooding, Link-State EE122 Section 4.
Presentation transcript:

1 Omega Network The omega network is another example of a banyan multistage interconnection network that can be used as a switch fabric The omega differs from the delta network in the pattern of interconnections between the stages The omega MIN uses the “perfect shuffle”

2 Perfect Shuffle The interconnections between stages are defined by the logical “rotate left” of the bits used in the port ids Example: > > > 000 Example: > > > 001 Example: > > > 011 Example: > > > 111

3 8 x 8 OMEGA NETWORK

4 Self Routing Omega network has self-routing property The path for a cell to take to reach its destination can be determined directly from its routing tag (i.e., destination port id) Stage k of the MIN looks at bit k of the tag If bit k is 0, then send cell out upper port If bit k is 1, then send cell out lower port Works for every possible input port (really!)

Example of Self Routing Cell destined for output port 4 (= 100 ) 2

Example of Self Routing Cell destined for output port 4 (= 100 ) 2 4

Example of Self Routing Cell destined for output port 4 (= 100 ) 2 4

12 Path Contention The omega network has the problems as the delta network with output port contention and path contention Again, the result in a bufferless switch fabric is cell loss (one cell wins, one loses) Path contention and output port contention can seriously degrade the achievable throughput of the switch

Path Contention 5

Path Contention 5

Path Contention 5

Path Contention 5

Path Contention

Path Contention 5

Path Contention 5

Path Contention 5

Performance Degradation

Performance Degradation

Performance Degradation

Performance Degradation

Performance Degradation

Performance Degradation 3

Performance Degradation 6 3 0

Performance Degradation 3 0 6

Performance Degradation 3 0 6

30 A Solution: Batcher Sorter One solution to the contention problem is to sort the cells into monotonically increasing order based on desired destination port Done using a bitonic sorter called a Batcher Places the M cells into gap-free increasing sequence on the first M input ports Eliminates duplicate destinations

31 Batcher-Banyan Example

32 Batcher-Banyan Example

33 Batcher-Banyan Example

34 Batcher-Banyan Example

35 Batcher-Banyan Example

36 Batcher-Banyan Example

37 Batcher-Banyan Example