BZUPAGES.COM Presentation On SWITCHING TECHNIQUE Presented To; Sir Taimoor Presented By; Beenish Jahangir 07_04 Uzma Noreen 07_08 Tayyaba Jahangir 07_33.

Slides:



Advertisements
Similar presentations
CSE 413: Computer Networks
Advertisements

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
Switching Technology presented by Hussain Ahmad BA-Abdullah. Fawaz abdullah AL-Amri. prof : Adel Ali.
1 IK1500 Communication Systems IK1330 Lecture 3: Networking Anders Västberg
1 Agenda TMA2 Feedback TMA3 T821 Bock 2. 2 Packet Switching.
Jaringan Komputer Lanjut Packet Switching Network.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
What is Flow Control ? Flow Control determines how a network resources, such as channel bandwidth, buffer capacity and control state are allocated to packet.
Module 3.4: Switching Circuit Switching Packet Switching K. Salah.
1 Lecture 12: Interconnection Networks Topics: dimension/arity, routing, deadlock, flow control.
William Stallings Data and Computer Communications 7th Edition
1 Lecture 24: Interconnection Networks Topics: topologies, routing, deadlocks, flow control Final exam reminders:  Plan well – attempt every question.
1 Lecture 24: Interconnection Networks Topics: topologies, routing, deadlocks, flow control.
1 Computer Networks Switching Technologies. 2 Switched Network Long distance transmission typically done over a network of switched nodes End devices.
Communication concepts (Continued) Week 2 Lecture 2.
Switching, routing, and flow control in interconnection networks.
Computer Networks MCA Sem-III Baljeet Kaur
Switching Techniques Student: Blidaru Catalina Elena.
Data Communications and Networking
29-Aug-154/598N: Computer Networks Switching and Forwarding Outline –Store-and-Forward Switches.
1 The Turn Model for Adaptive Routing. 2 Summary Introduction to Direct Networks. Deadlocks in Wormhole Routing. System Model. Partially Adaptive Routing.
Communication Networks
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.
Review of Networking Concepts Part 1: Switching Networks
Chapter 2 – X.25, Frame Relay & ATM. Switched Network Stations are not connected together necessarily by a single link Stations are typically far apart.
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
EITnotes.com For more notes and topics visit:
Computer Architecture Distributed Memory MIMD Architectures Ola Flygt Växjö University
ECE 466 Switching Networks. ECE 466 A communication network provides a scalable solution to connect a large number of end systems Communication Networks.
Circuit & Packet Switching. ► Two ways of achieving the same goal. ► The transfer of data across networks. ► Both methods have advantages and disadvantages.
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Switching Techniques Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
 Circuit Switching  Packet Switching  Message Switching WCB/McGraw-Hill  The McGraw-Hill Companies, Inc., 1998.
Data and Computer Communications Circuit Switching and Packet Switching.
William Stallings Data and Computer Communications 7 th Edition Chapter 1 Data Communications and Networks Overview.
Computer Networks with Internet Technology William Stallings
MESSAGE ROUTING SCHEMES IN A HYPERCUBE MACHINE
1 Lecture 15: Interconnection Routing Topics: deadlock, flow control.
Lecture # 03 Switching Course Instructor: Engr. Sana Ziafat.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 CH. 8: SWITCHING & DATAGRAM NETWORKS 7.1.
WAN Transmission Media
1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.
Switching. Circuit switching Message switching Packet Switching – Datagrams – Virtual circuit – source routing Cell Switching – Cells, – Segmentation.
Computer Networks Chapter 8 – Circuit Switching versus Packet Switching.
Computer Communication & Networks Lecture # 03 Circuit Switching, Packet Switching Nadeem Majeed Choudhary
Network Layer Lecture Network Layer Design Issues.
Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.
1. Layered Architecture of Communication Networks: Circuit Switching & Packet Switching.
1 Lecture 22: Interconnection Networks Topics: Routing, deadlock, flow control, virtual channels.
Data and Computer Communications Chapter 7 Circuit Switching and Packet Switching.
SWITCHING. Switching is process to forward packets coming in from one port to a port leading towards the destination. When data comes on a port it is.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Muhammad Waseem Iqbal Lecture # 20 Data Communication.
The network-on-chip protocol
Packet Switching Datagram Approach Virtual Circuit Approach
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Computer Networks MCA Sem-III Baljeet Kaur
Communication Networks NETW 501
Switching, routing, and flow control in interconnection networks
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Data Communication Networks
Switching Techniques.
Circuit Switching Packet Switching Message Switching
Lecture: Interconnection Networks
Multiprocessors and Multi-computers
Switching.
Presentation transcript:

BZUPAGES.COM Presentation On SWITCHING TECHNIQUE Presented To; Sir Taimoor Presented By; Beenish Jahangir 07_04 Uzma Noreen 07_08 Tayyaba Jahangir 07_33 Nimra Irshad 06_27

BZUPAGES.COM Switching Techniques In most multicomputer systems, a message enters the network from a source node and is switched or routed towards its destination through a series of intermediate nodes. Four types of switching techniques are usually used for this purpose: circuit switching packet switching virtual cut-through switching wormhole switching.

BZUPAGES.COM Circuit Switching In circuit switching, a dedicated path is established between the source and the destination before data transfer initiates. Once the data transfer is initiated the message is never blocked. As the channels creating the path are reserved exclusively, buffering of data is not required. On the other hand, establishing the path requires significant overhead: during the data-transmission phase, all channels are reserved for the entire duration of message transfer. Circuit switching thus degrades performance and is no longer used in commercial multicomputer systems.

BZUPAGES.COM Circuit Switching Source first establishes a connection (circuit) to the destination. Each router or switch along the way may reserve some bandwidth for the data flow.

BZUPAGES.COM Source sends the data over the circuit. No need to include the destination address with the data since the routers know the path The connection is torn down. Example: telephone network. CONT…

BZUPAGES.COM Circuit Switching Advantages, relative to packet switching: Implies guaranteed bandwidth, predictable performance Simple switch design: only remembers connection information, no longest-prefix destination address look up

BZUPAGES.COM Disadvantages: Inefficient for bursty traffic (wastes bandwidth) Delay associated with establishing a circuit Can we get the advantages without (all) the disadvantages?

BZUPAGES.COM Packet Switching In packet switching, a message is divided into packets that are independently routed towards its destination. The destination address is encoded in the header of each packet. The entire packet is stored at every intermediate node and then forwarded to the next node in its path. The main advantage of packet switching is that the channel resource is occupied only when a packet is actually transferred.

BZUPAGES.COM Packet Switching cont... Each packet contains the routing information and alternative paths can be selected upon encountering network congestion or faulty nodes. The major drawback of packet switching Since the packet is stored entirely at each intermediate node, the time to transmit a packet from source to destination is directly proportional to the number of hops in the path. At each intermediate node, we need buffer space to hold at least one packet.

BZUPAGES.COM Packet Switching Source sends information as self-contained packets that have an address. Source may have to break up single message into multiple

BZUPAGES.COM Each packet travel independently to the destination host. Routers and switches use the address in the packet to determine how to forward the packets Destination recreates the message. Analogy: a letter in surface mail.

BZUPAGES.COM Virtual Circuits Versus Packet Switching Circuit switching: Uses short connection identifiers to forward packets Switches know about the connections so they can more easily implement features such as quality of service Virtual circuits form basis for traffic engineering: VC identifies long-lived stream of data that can be scheduled

BZUPAGES.COM Packet switching: Use full destination addresses for forwarding packets Can send data right away: no need to establish a connection first Switches are stateless: easier to recover from failures Adding QoS is hard traffic engineering is hard: too many packets!

BZUPAGES.COM Virtual Cut Through In order to reduce the time to store the packets at each node, Kermani and Kleinrock introduced a technique called virtual cut-through In this, while routing toward its destination, a message is stored at an intermediate node only if the next channel required is occupied by another packet. Now, the distance between the source and destination has little effect on communication latency.

BZUPAGES.COM cont... In an extreme case, when a message encounters blocking at all the intermediate nodes, the virtual cut- through technique reduces to packet switching. The disadvantage of the virtual cut-through technique Implementation cost: each node must provide sufficient buffer space for all the messages passing through it, and because multiple messages may be blocked at any node, a very large buffer space is required at each node. This implementation constraint limits the use of virtual cut-through technique.

BZUPAGES.COM Wormhole Switching Wormhole switching is a variant of the virtual cut-through technique that avoids the need for large buffer spaces. In wormhole switching, a packet is transmitted between the nodes in units of flits, the smallest units of a message on which flow control can be performed. The header flit(s) of a message contains all the necessary routing information and all the other flits contain the data elements. The flits of the message are transmitted through the network in a pipelined fashion.

BZUPAGES.COM cont... Since only the header flit(s) has the routing information, all the trailing flits follow the header flit(s) contiguously. Flits of two different messages cannot be interleaved at any intermediate node. Successive flits in a packet are pipelined asynchronously in hardware using a handshaking protocol. When the header flit is blocked, then all the trailing flits occupy the buffers at the intermediate nodes.

BZUPAGES.COM Message format and routing in Wormhole Switching Packets DDDDDDDDDDH Flits D: Data Flit H: Header Flit (a) D DD H DD (b) Wormhole Switching Messages

BZUPAGES.COM Advantages of Wormhole Switching The main advantage of wormhole switching derives from the pipelined message flow since transmission latency is insensitive to the distance between the source and destination. Moreover, since the message moves flit by flit across the network, each node needs to store only one flit. Some implementations, however, require storage of multiple flits at each node to improve routing performance. The reduction of buffer requirements at each node has a major effect on the cost and size of multicomputer systems.

BZUPAGES.COM Disadvantages of Wormhole Switching The main disadvantage of wormhole switching comes from the fact that only the header flit has the routing information. If the header flit cannot advance in the network due to resource contention, all the trailing flits are also blocked along the path and these blocked messages can block other messages. This chained blocking can also lead to deadlock where messages wait for each other in a cycle and hence no message can advance any further.

BZUPAGES.COM Questions ?