# Mạng và viễn thông P18

Chia sẻ: Hug Go Go | Ngày: | Loại File: PDF | Số trang:27

0
50
lượt xem
3

## Mạng và viễn thông P18

Mô tả tài liệu

Packet Switching Packet switching emerged in the 1970s as an efficient means of data conveyance. It overcame the inability of circuit-switched (telephone) networks to provide efficiently for variable bandwidth connections for bursty-type usage as required between computers, terminals and storagedevices.

Chủ đề:

Bình luận(0)

Lưu

## Nội dung Text: Mạng và viễn thông P18

1. Networks and Telecommunications: Design and Operation, Second Edition. Martin P. Clark Copyright © 1991, 1997 John Wiley & Sons Ltd ISBNs: 0-471-97346-7 (Hardback); 0-470-84158-3 (Electronic) PART 3 MODERN DATA NETWORKS
2. Networks and Telecommunications: Design and Operation, Second Edition. Martin P. Clark Copyright © 1991, 1997 John Wiley & Sons Ltd ISBNs: 0-471-97346-7 (Hardback); 0-470-84158-3 (Electronic) Packet Switching Packet switching emerged in the 1970s as an efficient means of data conveyance. It overcame the inability of circuit-switched (telephone) networks to provide efficiently for variable bandwidth connections for bursty-type usage as required between computers, terminals and storagedevices. In this chapter we discuss the basics of packet switching and ITU-T’s X.25 recommendation, nowadays the worldwide technical standard interface to packet-switched networks. We then also go on todiscuss the IBM company’s SNA (systems network architecture), a proprietary form of packet switching, important because of its dominant role in IBM computer networks. 18.1 PACKET SWITCHING BASICS Packet switching is so-called because the user’s overall message is broken up into a number of smaller packets, each of which is sent separately. We illustrated the concept in Figure 1.10 of Chapter 1. Each packet of data is labelled to identify its intended destination, and protocol control information (PCZ) is added, as we saw in Chapter 9, before it is sent. The receiving end re-assembles the packets in their proper order, with the aid of sequencenumbers and the other PC1 fields. Each packet is carried across the network in a store-and-forward fashion, taking the most efficient route available at the time. Packet switching is a form of statistical multiplexing, as we discovered in Chapter 9. Figure 18.1 illustrates how a link within a packet switching network is used to carry the jumbled-up packets of various different messages and the use of the information carried in the packet header to sort arriving packets at the destination end into the separate logical channels, virtual circuits ( VCs) or virtual calls (VCs). Transmissioncapacity between pairs of nodesinapacket-switchednetwork is generally not split up into rigidly separate physical channels, each of a fixed bandwidth. Instead,theentireavailablebandwidth between two nodalpoints (switches) inthe network is bundled together as a single high bitrate pipe, and all packets to be sent between the two endpointsof the link share the same pipe (Figure 18.1). In this way, the entire bandwidth (i.e. full bitspeed)can be used momentarily by any of the logical channels sharing the connection. This means that individual packets are transported more quickly and bursts of transmission can be accommodated. 341
3. 342 PACKET SWITCHING mm n U packet may switch Figure 18.1 The statistical multiplexing principle of packet switching A problem arises when more than one or all logical channels try to send packets at once. This is accommodated by buffers at sending and receiving ends of the connection as shown in Figure 18.2. These delay some of the simultaneous packets for an instant until the line becomes free. By use of buffers as shown in Figure 18.2, it is possible to run thetransmission link at very close to100% utilization.This is achieved by sharingthecapacity between a number of end devices (each with a logical channel). The statistical average of the total bitrate of all the logical channels must be slightly lower than the line bitrate so that all packetsmay be carried,butatany individualpoint in timethe buffers may be accumulating packets or emptying their contents to the line. Packet switching is able to carry logical channels of almost any average bitrate. Thus a 128 kbit/s trunk between two packet switches might carry 6 logical channels of mixed and varying bitrates 5.6 kbit/s, 11.4 kbit/s, 12.3 kbit/s,22.1 kbit/s, 28.7 kbit/s, 43.0 kbit/s and still have capacity to spare. This compares with the two channels which a telephone network would be able to carry using the same trunk capacity. (The excess capacity of the telephone channels simply has to be wasted, and the other four channels cannot be carried.) packet switch buffer Figure 18.2 The use of a buffer to accommodate simultaneous sending of packets by different logical channels
4. TRANSMISSION DELAY IN PACKET-SWITCHED NETWORKS 343 18.2 TRANSMISSION DELAY IN PACKET-SWITCHED NETWORKS When using the trunksin a packet-switched networkat very close to full utilization, very large buffers are required for each of the logical channels,to smooth out the bursts from individual channels into a smooth output for carriage by the line. (This is rather like having a very large water reservoir,collecting water during showersof rain, and varying in water depth, butalways capableof outputting a constant volume of water for munic- ipal use (Figure 18.3). The water reservoir is analagous to the data buffers, the showers of rain to the bursts of data information, and the constant output to the information carried by the line.) We can make sure that the packets accumulated in the buffer are despatched on a jirst-in-jirst out (FIFO) basis to fairly share out the queueing delays which result, but it is critical to ensure that the queueing delay does not become unacceptably long. The chance of a very long delay is much greater when close to 100% utilization of the line is expected. (Imagine waiting in line for a bus, all of the seats of which had to be full before it pulled away; either the bus doesn’t come very often, or there is a very long queue to ensure that all the seats can be filled). A certainamount of queueing delaycaused by buffering is not noticeable to computer users (a $second is a very long queueing delay in packet switching network terms). Even if a typed character did not appear on the computer screen until a f second afterhittingthekeyboard,the user is unlikely to notice. A variation inthedelay (sometimes a$ second, and sometimes no delay) is also unimportant. (The fact that some characters appear on the screen more quickly than the f second maximum delay will not be noticed.) On the other hand, once the average delay becomes much longer, then computer work may become frustrating, so that much longer queueing delays are unacceptable. There is an entirestatistical science used to estimatequeueingdelays. Themost important formulais the Erlang call-waiting formula, which we willdiscuss in Chapter 30. In simple terms, however, the unacceptability of long queueing delays means that the
6. ROUTING IN PACKET-SWITCHEDNETWORKS 345 m L U U) 2
7. 346 PACKET SWITCHING during periodsof sudden surge in demand resulting from simultaneous packet bursts by many logical channels sharing the same path. The second type of routing, datagram routing, allows for more dynamic routing of individual packets (Figure 18.5), and thus has the potential for better overall networkefficiency. The technique, however, requires more sophisticated equipment, and powerful switch processors capable of determining routes for individual packets. Packet switching gives good end-to-end reliability, with well-designed switches and networks it is possible to bypass network failures (even during the progress of a call). Packet switching is also efficient in its use of network links andresources, sharing them between a number of calls, thereby increasing their utilization. 18.4 ITU-T RECOMMENDATION X.25 Most packet-switched networks use the protocol standards set by ITU-T’s recommen- dation X.25. Thissets out the mannerin which adata terminal equipment ( D T E )should interact with a data circuit terminating equipment ( D C E ) , forming the interface to a packet-switched network. The relationship is shown in Figure 18.6. The X.25 recommendation defines theprotocolsbetween DTE (e.g. personal computer computer or terminal controller (e.g. IBM 3174)) and DCE (i.e. the connection point to a wide area network, W A N )corresponding to OS1 layers 1, 2 and 3 (Figure 18.7) which we learned about in Chapter 9). The physical connection may either be X.21 (digital leaseline) or X.21 bis (V.24/V.28 modem in conjunction with an analogue leaseline: Chapter 9). Alternatively, the X.31 recommendation (Chapter 10) specifies how the physical connection (DTE/DCE) may be achieved via an ISDN (integrated digital services network). Finally, recommenda- tion X.32 specifies the use of a dial-up connection for apacket mode connection via the telephone or ISDN network to an X.25 packet exchange. The X.25 recommendation itself defines theOS1 Iayer 2 and layer 3 protocols. These are called the link access procedures (LAPB and L A P ) and thepacket level interface. The link access procedureassures the correct carriage data across the of link connecting DTE DTE DCE DCE DTE I I I I l *X25 --U I c X 2 5 - W Packet switched network Figure 18.6 The X.25 interface to packet switched networks