Subject Name COMPUTER NETWORKS1 Subject Code 10 CS
Subject Name: COMPUTER NETWORKS-1 Subject Code: 10 CS 55 Prepared By: Shruthi N, Krishna sowjanya. k, santhiya Department: CSE
Engineered for Tomorrow Multiplexing • Multiplexing is the simultaneous transmission of multiple signals across a single data link. • In a multiplexed system, n lines share the bandwidth of one link. n signals (input) M U X Multiplexer 1 link, n channels D E M U X Demultiplexer n signals (output)
Engineered for Tomorrow Multiplexing • Multiplexing is the simultaneous transmission of multiple signals across a single data link. • In a multiplexed system, n lines share the bandwidth of one link • There are three basic multiplexing techniques: – frequency-division multiplexing. – wavelength-division multiplexing. – time-division multiplexing.
Engineered for Tomorrow Frequency Division Multiplexing (FDM) An analog multiplexing technique to combine signals • Medium BW > Channel BW • Each signal is modulated to a different carrier frequency • E. g. , broadcast radio • Channel allocated even if no data 4
Engineered for Tomorrow Conceptual View of FDM Channel 3 Channel 2 Channel 1 Time f 1 f 2 f 3 cy en equ Fr 5
Engineered for Tomorrow FDM: Multiplexing Process 6
Engineered for Tomorrow FDM: Demultiplexing Process 7
Engineered for Tomorrow Analog Hierarchy • Used by AT&T 240 k. Hz 60 voice channels group F D M 2. 52 MHz 600 voice channels supergroup … F D M master group 6 master groups F D M 10 supergropus 4 k. Hz 48 k. Hz 12 voice channels 5 groups 4 k. Hz … 12 voice channels 4 k. Hz 16. 984 MHz 3600 voice channels F D M Jumbo group 8
Engineered for Tomorrow Wavelength Division Multiplexing (WDM) An analog multiplexing technique to combine optical signals • WDM is a special case of FDM 1 1 2 WDM 1+ 2+ 3 WDM 3 3 1 1 1+ 2+ 3 2 2 Fiber-optic cable Multiplexer Demultiplexer 3 9
Engineered for Tomorrow Time Division Multiplexing (TDM) A digital multiplexing technique to combine data • Medium Data Rate > Signal Data Rate • Multiple digital signals interleaved in time A B C one unit T D M Frame C B A Time slot • Time slots – are preassigned to sources and fixed – are allocated even if no data – do not have to be evenly distributed among sources 10
Engineered for Tomorrow Conceptual View of TDM 1 1 Data flow 2 M U X 3 D E 2 M U X 3 3 2 1 Channel 2 Channel 3 Channel 1 Channel 2 Channel 3 Time cy Frequen 11
Engineered for Tomorrow TDM Frames • A frame consists of one complete cycle of time slots 12
Engineered for Tomorrow Interleaving • Multiplexing side: As the switch opens in front of a connection, that connection has the opportunity to send a unit onto the path. This process is called interleaving. • Demultiplexing side: as the switch opens in front of a connection, that connection has the opportunity to receive a unit from the path 13
Engineered for Tomorrow Data Rate Management • Not all input links maybe have the same data rate. • Some links maybe slower. There maybe several different input link speeds • There are three strategies that can be used to overcome the data rate mismatch: multilevel, multislot and pulse stuffing 6. 14 14
Engineered for Tomorrow Data rate matching • Multilevel: used when the data rate of the input links are multiples of each other. • Multislot: used when there is a GCD between the data rates. The higher bit rate channels are allocated more slots per frame, and the output frame rate is a multiple of each input link. • Pulse Stuffing: used when there is no GCD between the links. The slowest speed link will be brought up to the speed of the other links by bit insertion, this is called pulse stuffing. 6. 15
Engineered for Tomorrow Multi-Level Multiplexing 16
Engineered for Tomorrow Multiple-slot multiplexing 6. 17
Engineered for Tomorrow Pulse stuffing
Engineered for Tomorrow Synchronization • To ensure that the receiver correctly reads the incoming bits, i. e. , knows the incoming bit boundaries to interpret a “ 1” and a “ 0”, a known bit pattern is used between the frames. • The receiver looks for the anticipated bit and starts counting bits till the end of the frame. • Then it starts over again with the reception of another known bit. • These bits (or bit patterns) are called synchronization bit(s). • They are part of the overhead of transmission.
Engineered for Tomorrow Framing bits
Engineered for Tomorrow DS Services and T Lines • DS-0, DS-1, etc, are services – T lines are used to implement these services Service Line Rate (Mbps) Voice Channels DS-1 T-1 1. 544 24 DS-2 T-2 6. 312 96 DS-3 T-3 44. 736 672 DS-4 T-4 274. 176 4032 21
Engineered for Tomorrow T Lines and Analog Signals 22
Engineered for Tomorrow T-1 Frame Structure 23
Engineered for Tomorrow E Lines • European's version of T lines – Also used in Thailand E Line Rate (Mbps) Voice Channels E-1 2. 048 30 E-2 8. 448 120 E-3 34. 368 480 E-4 139. 264 1920 24
Engineered for Tomorrow Statistical Time-Division Multiplexing • In statistical time-division multiplexing, slots are dynamically allocated to improve bandwidth efficiency. Only when an input line has a slot's worth of data to send is it given a slot in the output frame. • In statistical multiplexing, the number of slots in each frame is less than the number of input lines. • The multiplexer checks each input line in roundrobin fashion; it allocates a slot for an input line if the line has data to send; otherwise, it skips the line and checks the next line.
Engineered for Tomorrow Synchronous and statistical TDM
Engineered for Tomorrow Spread Spectrum • Spread signal to use larger bandwidth – To prevent eavesdropping – To reduce effect from interference 27
Engineered for Tomorrow Frequency-Hopping SS • "FHSS" – Frequency-Hopping Spread Spectrum – Used in Bluetooth technology 28
FHSS Cycles Engineered for Tomorrow 29
Engineered for Tomorrow Direct-Sequence SS • "DSSS" – Direct-Sequence Spread Spectrum – Used in Wireless LANs 30
Engineered for Tomorrow DSSS and Interference Amplitude Narrow Band Signal Narrow Band Interference Spread Spectrum Signal Frequency 31
Engineered for Tomorrow DSSS Example 32
Engineered for Tomorrow Introduction to switching Switched networks • Long distance transmission between stations (called “end devices”) is typically done over a network of switching nodes. • Switching nodes do not concern with content of data. Their purpose is to provide a switching facility that will move the data from node to node until they reach their destination (the end device). • A collection of nodes and connections forms a communications network. • In a switched communications network, data entering the network from a station are routed to the destination by being switched from node to node
Engineered for Tomorrow A Switched network
Engineered for Tomorrow Taxonomy of switched networks
Engineered for Tomorrow Circuit switched Networks • Circuit switching: – There is a dedicated communication path between two stations (end-to-end) – The path is a connected sequence of links between network nodes. On each physical link, a logical channel is dedicated to the connection. • Communication via circuit switching has three phases: – Setup phase • Resource allocation (FDM or TDM) – Data transfer phase – Tear down phase • Deallocate the dedicated resources • The switches must know how to find the route to the destination and how to allocate bandwidth (channel) to establish a connection
Engineered for Tomorrow A circuit-switched network is made of a set of switches connected by physical links, in which each link is divided into n channels.
Engineered for Tomorrow Delay in a circuit switched network
Engineered for Tomorrow Datagram Networks • Each packet is treated independently of all others. • Packets in this approach are referred to a datagrams • Datagram switching is normally done at the network layer. • Datagram networks are also referred to as connectionless networks. • There are no setup or tear down phases.
Engineered for Tomorrow A datagram network with four switches (routers)
Engineered for Tomorrow Routing Table • In datagram networks, each switch has a routing table which is based on the destination address. • Routing tables are dynamic and are updated periodically. • The destination address and the corresponding forwarding output ports are recorded in the tables
Engineered for Tomorrow Routing table in a datagram network
Engineered for Tomorrow Destination address • Every packet in datagram network carries a header that contains destination address of the packet • When switch recieves packet, this destination address is examined, routing table is consulted to find path. Efficiency • Efficiency of datagram network is better than of circuit switche network as resources are allocated only when there are packets to be transferred. Delay • Delay is more in datagram network than in virtual circuit network
Engineered for Tomorrow Delay in a datagram network
Engineered for Tomorrow Virtual Circuit Networks • A virtual-circuit network is a cross between a circuitswitched network and a datagram network. • There are setup and teardown phases in addition to data transfer phase. • Resources can be allocated during setup phase or on demand • Data are packetized and each packet carries an address in the header. but address in header has local jurisdiction. • All packets follow the same path established during the connection • Virtual circuit network is implemented in the data link layer. • Two types of addressing are used: global and local
Engineered for Tomorrow Virtual-circuit network
Engineered for Tomorrow Virtual circuit Identifier • The identifier used for data tranfer is called virtual circuit identifier(VCI)
Engineered for Tomorrow Three phases Data Transfer phase • To transfer a frame from source to destination, all switches need to have a table entry for this virtual circuit • Fig shows a frame arriving at port 1 with a VCI of 14
Engineered for Tomorrow Source-to-destination data transfer in a virtual-circuit network 8. 49
Engineered for Tomorrow Setup phase • In setup phase, a switch creates an entry for a virtual circuit. Two steps are required – Setup request • A setup request is sent from the source to the destination as shown
Engineered for Tomorrow • Acknowledgement – A special fram, called acknowledgement frame, completes the entries in the switching tables.
Engineered for Tomorrow Delay in a virtual-circuit network
Thank You……
- Slides: 53