You are on page 1of 25

Figure 3.

Network types Range Bandwidth (Mbps) Latency (ms) LAN 12 kms 101000 110 WAN worldwide 0.010600 100500 MAN 250 kms 1150 10 Wireless LAN 0.151.5 km 211 520 Wireless WAN worldwide 0.0102 100-500 Internet worldwide 0.0102 100500

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.2

Conceptual layering of protocol software


Message sent Layer n Layer 2 Layer 1 Sender Communication medium Recipient Message received

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.3

Encapsulation as it is applied in layered protocols


Application-layer message Presentation header Session header Transport header

Network header

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.4

Protocol layers in the ISO Open Systems Interconnection (OSI) protocol model
Message sent Layers Application Presentation Session Transport Network Data link Physical Sender Communication medium Recipient Message received

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.5
Layer Application

OSI protocol summary


Description Protocols that are designed to meet the communication requirements of specific applications, often defining the interface to a service. Protocols at this level transmit data in a network representation that is independent of the representations used in individual computers, which may differ. Encryption is also performed in this layer, if required. At this level reliability and adaptation are performed, such as detection of failures and automatic recovery. This is the lowest level at which messages (rather than packets) are handled. Messages are addressed to communication ports attached to processes, Protocols in this layer may be connection-oriented or connectionless. Transfers data packets between computers in a specific network. In a WAN or an internetwork this involves the generation of a route passing through routers. In a single LAN no routing is required. Responsible for transmission of packets between nodes that are directly connected by a physical link. In a WAN transmission is between pairs of routers or between routers and hosts. In a LAN it is between any pair of hosts. The circuits and hardware that drive the network. It transmits sequences of binary data by analogue signalling, using amplitude or frequency modulation of electrical signals (on cable circuits), light signals (on fibre optic circuits) or other electromagnetic signals (on radio and microwave circuits).
Pearson Education 2001

Examples HTTP, FTP, SMTP, CORBA IIOP Secure Sockets (SSL),CORBA Data Rep.

Presentation

Session Transport

TCP, UDP

Network

IP, ATM virtual circuits Ethernet MAC, ATM cell transfer, PPP Ethernet baseband signalling, ISDN
5

Data link

Physical

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Figure 3.6

Internetwork layers
Message Layers Application Internetwork protocols

Transport Internetwork Internetwork packets Network interface Network-specific packets Underlying network

Underlying network protocols

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.7

Routing in a wide area network

A Hosts or local networks 3 D

1 Links 6 E 4

B 2 C 5 Routers

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.8

Routing tables for the network in Figure 3.7 Routings from A To A B C D E Link local 1 1 3 1 Cost 0 1 2 1 2 Routings from B To A B C D E Link 1 local 2 1 4 Cost 1 0 1 2 1 Routings from C To A B C D E Link 2 2 local 5 5 Cost 2 1 0 2 1

Routings from D
To

Routings from E
To

A B C D E

Link 3 3 6 local 6

Cost 1 2 2 0 1

Link 4 4 5 6 local

Cost 2 1 1 1 0

A B C D E

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.9

Pseudo-code for RIP routing algorithm Send: Each t seconds or when Tl changes, send Tl on each non-faulty outgoing link. Receive: Whenever a routing table Tr is received on link n: for all rows Rr in Tr { if (Rr.link n) { Rr.cost = Rr.cost + 1; Rr.link = n; if (Rr.destination is not in Tl) add Rr to Tl; // add new destination to Tl else for all rows Rl in Tl { if (Rr.destination = Rl.destination and (Rr.cost < Rl.cost or Rl.link = n)) Rl = Rr; // Rr.cost < Rl.cost : remote node has better route // Rl.link = n : remote node is more authoritative } } }

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

Figure 3.10

Simplified view of the QMW Computer Science network


Campus 138.37.95.240/29 subnet router Staff subnet
138.37.88 138.37.95.241

router/ firewall

hammer

Student subnet
138.37.88.251 138.37.94.251 138.37.94

compute server
bruno 138.37.88.249

Eswitch

Eswitch

file server/ gateway


custard 138.37.94.246

dialup server
henry 138.37.88.230

printers

file server
hotpoint 138.37.88.162

other servers

web server
copper 138.37.88.248 138.37.94.247

hub

desktop computers 138.37.88.xx Campus router


138.37.95.248/29 subnet

138.37.88.247

hub

desktop computers 138.37.94.xx

sickle 138.37.95.249

router/ firewall

100 Mbps Ethernet 1000 Mbps Ethernet Eswitch: Ethernet switch


10

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

138.37.95.232/29 subnet

Figure 3.11

Tunnelling for IPv6 migration


IPv6 encapsulated in IPv4 packets IPv4 network A IPv6 IPv6 B

Encapsulators

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

11

Figure 3.12

TCP/IP layers
Layers Application Messages (UDP) or Streams (TCP) Transport UDP or TCP packets Internet IP datagrams Network interface Network-specific frames Underlying network Message

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

12

Figure 3.13

Encapsulation as it occurs when a message is transmitted via TCP over an Ethernet


Application message TCP header IP header Ethernet header
IP TCP port

Ethernet frame

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

13

Figure 3.14

The programmer's conceptual view of a TCP/IP Internet

Application TCP IP

Application UDP

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

14

Figure 3.15

Internet address structure, showing field sizes in bits


7 Class A: 0 Network ID 14 Class B: 1 0 Network ID 21 Class C: 1 1 0 Network ID 28 Class D (multicast): 1 1 1 0 Multicast address 27 Class E (reserved): 1 1 1 1 0 unused 24 Host ID 16 Host ID 8 Host ID

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

15

Figure 3.16

Decimal representation of Internet addresses


octet 1 Network ID Class A: Class B: Class C: 1 to 127 0 to 255 Network ID 128 to 191 0 to 255 192 to 223 224 to 239 240 to 255 Network ID 0 to 255 octet 2 octet 3 Host ID 0 to 255 Host ID 0 to 255 0 to 255 0 to 255 Host ID 1 to 254 1 to 254 1 to 254 128.0.0.0 to 191.255.255.255 192.0.0.0 to 223.255.255.255 224.0.0.0 to 239.255.255.255 240.0.0.0 to 255.255.255.255 0 to 255 1.0.0.0 to 127.255.255.255 Range of addresses

Class D (multicast): Class E (reserved):

Multicast address 0 to 255 0 to 255 0 to 255 0 to 255

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

16

Figure 3.17

IP packet layout
header IP address of source IP address of destination up to 64 kilobytes data

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

17

Figure 3.18

IPv6 header layout


Version (4 bits) Priority (4 bits) Payload length (16 bits) Flow label (24 bits) Next header (8 bits) Source address (128 bits) Hop limit (8 bits)

Destination address (128 bits)

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

18

Figure 3.19

The MobileIP routing mechanism


Sender Subsequent IP packets tunnelled to FA

Mobile host MH

Address of FA returned to sender First IP packet addressed to MH

Internet Home agent Foreign agent FA First IP packet tunnelled to FA

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

19

Figure 3.20

Firewall configurations
a) Filtering router Router/ filter Internet web/ftp server b) Filtering router and bastion Protected intranet

R/filter Bastion

Internet web/ftp server

c) Screened subnet for bastion

R/filter Bastion R/filter

Internet web/ftp server


Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3 Pearson Education 2001 20

Figure 3.21

IEEE 802 network standards IEEE No. 802.3 802.4 802.5 802.6 802.11 Title CSMA/CD Networks (Ethernet) Token Bus Networks Token Ring Networks Metropolitan Area Networks Wireless Local Area Networks Reference [IEEE 1985a] [IEEE 1985b] [IEEE 1985c] [IEEE 1994] [IEEE 1999]

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

21

Figure 3.22

Wireless LAN configuration


A Laptops radio obstruction Palmtop D Server E Wireless LAN Base station/ access point B C

LAN

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

22

Figure 3.23

ATM protocol layers


Message Layers Application

Higher-layer protocols ATM adaption layer ATM cells ATM layer ATM virtual channels Physical

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

23

Figure 3.24

ATM cell layout


Header: 5 bytes Virtual path id Virtual channel id Flags 53 bytes Data

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

24

Figure 3.25

Switching virtual paths in an ATM network

Host VPI = 2

VPI = 3

VP switch VPI = 4 VPI = 5

VP/VC switch

VPI in VPI out 2 3 4 5

VP switch Host Virtual channels

VPI : virtual path identifier Virtual path

Instructors Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3

Pearson Education 2001

25

You might also like