1. Slides for Chapter 3: Networking and Internetworking From Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edition 4, © Pearson Education 2005

2. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Networking Issues (1) z Performance: yLatency (time between send and start to receive) yData transfer rate (bits per second) yTransmission time = latency + length / transfer rate ySystem bandwidth, throughput: total volume of traffic in a given amount of time yUsing different channels concurrently can make bandwidth > data transfer rate ytraffic load can make bandwidth < data transfer rate ynetwork speed < memory speed (about 1000 times) ynetwork speed > disk speed (high-speed network file servers can beat local disks)

3. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Networking Issues (2) z scalability z reliability y corruption is rare ymechanisms in higher-layers to recover errors yerrors are usually timing failures, the receiver doesn't have resources to handle the messages z security yfirewall on gateways (entry point to org's intranet) yencryption is usually in higher-layers zmobility--communication is more challenging: locating, routing,... zquality of service--real-time services zmulticasting--one-to-many communication

4. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Types of Networks (1) zLocal Area Networks (LAN) yfloor/building-wide ysingle communication medium yno routing, broadcast ysegments connected by switches or hubs yhigh bandwidth, low latency yEthernet - 10Mbps, 100Mbps, 1Gbps yno latency guarantees (what could be the consequences?) yPersonal area networks (PAN) [ad-hoc networks]: blue tooth, infra-red for PDAs, cell phones, …

5. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Types of Networks (2) zMetropolitan Area Networks (MAN) ycity-wide, up to 50 km yDigital Subscriber Line (DSL):.25 - 8 Mbps, 5.5km from switch yCable modem: 1.5 Mbps, longer range than DSL

6. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Types of Networks (3) zWide Area Networks (WAN) yworld-wide yDifferent organizations yLarge distances yrouted, latency.1 -.5 seconds y1-10 Mbps (upto 600 Mbps)

7. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Types of Networks (4) zWireless local area networks (WLAN) yIEEE 802.11 (WiFi) y10-100 Mbps, 1.5km x 802.11 (1997): upto 2 Mbps, 2.4 GHz x 802.11a (1999): upto 54 Mbps, 5 GHz, 60 feet x 802.11b (1999): upto 11 Mbps, 2.4 GHz, 300 feet [most popular] x 802.11g (2003): upto 54 Mbps, 2.4 GHz [backward compatible with 802.11b, becoming more popular] zWireless metropolitan area networks (WMAN) yIEEE 802.16 (WiMax) y1.5-20 Mbps, 5-50km

8. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Types of Networks (5) zWireless wide area networks (WWAN) yworldwide yGSM (Global System for Mobile communications) y9.6 – 33 kbps y3G (“third generation”): 128-384 kbps to 2Mbps

9. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Types of Networks (6) zInternetworks yconnecting different kinds of networks yrouters, gateways

10. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network performance ExampleRangeBandwidth (Mbps) Latency (ms) Wired: LANEthernet1-2 km10-10001-10 MANATM250 km1-15010 WANIP routingworldwide.01-600100-500 InternetworkInternetworldwide0.5-600100-500 Wireless: WPANBluetooth (802.15.1)10 - 30m0.5-25-20 WLANWiFi (IEEE 802.11)0.15-1.5 km2-545-20 WMANWiMAX (802.16)550 km1.5-205-20 WWAN GSM, 3G phone netsworldwide0.01-2100-500

11. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (1) zPacket transmission ymessage: logical unit of informatio ypacket: transmission unit yrestricted length: sufficient buffer storage, reduce hogging

12. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (2) zData Streaming yaudio/video yNeed 120 Mbps (1.5 Mbps compressed) yplay time: the time when a frame need to be displayed yfor example, 24 frames per second, frame 48 must be display after two seconds yIP protocol provides no guaranteesIPv6 (new) includes features for real-time streams, stream data are treated separately yResource Reservation Protocol (RSVP), Real-time Transport Protocol (RTP)

13. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (3) zSwitching schemes (transmission between aribitrary nodes) yBroadcast: ethernet, token ring, wireless yCircuit switching: wires are connected yPacket switching: xstore-and-forward xdifferent routes x“store-and-forward” needs to buffer the entire packet before forwarding yFrame relay xSmall packets xLooks only at the first few bits xDon’t buffer/store the entire frame

14. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (4) zProtocols yKey components xSequence of messages xFormat of messages

15. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (5) zProtocol layers, why? Layer n Layer 2 Layer 1 Message sent Message received Communication medium SenderRecipient

16. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (6) zEncapsulation in layered protocols

17. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (7) zISO Open Systems Interconnection (OSI) model

18. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (8) yInternet layers xApplication = application + presentation xTransport = transport + session

19. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (9) zPacket assembly yheader and data ymaximum transfer unit (MTU): 1500 for Ethernet y64K for IP (8K is common because of node storage) zports: destination abstraction (application/service protocol) zaddressing: transport address = network address + port yWell-known ports (below 1023) yRegistered ports (1024 - 49151) yPrivate (up to 65535)

20. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (10) zPacket delivery (at the network layer) y Datagram packet xone-shot, no initial set up xdifferent routes, out of order xEthernet, IP y Virtual circuit packet xinitial set up for resources xvirtual circuit # for addressing xATM zSimilar but different pairs of protocols at the transport layer (connection-oriented and connectionless)

21. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (11) zRouting yLAN? yRouting Algorithm xdecide which out-going link to forward the packet for circuit switching, the route is determined during the circuit setup time for packet switching, each packet is routed independently xupdate state of the out-going links yRouting Table x fields: link, cost (e.g. hop count) x a record for each destination

22. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (12) zRouter example Hosts Links or local networks A DE B C 1 2 5 4 3 6 Routers

23. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (13): Routing tables Routings from DRoutings from E ToLinkCostToLinkCost A B C D E 3 3 6 local 6 1 2 2 0 1 A B C D E 4 4 5 6 2 1 1 1 0 Routings from ARoutings from BRoutings from C ToLinkCostToLinkCostToLinkCost A B C D E local 1 1 3 1 0 1 2 1 2 A B C D E 1 2 1 4 1 0 1 2 1 A B C D E 2 2 5 5 2 1 0 2 1

24. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (14) zRouter information protocol (RIP) y"Bellman-Ford distance vector" algorithm ySender: send table summary periodically (30s) or changes to neighbors yReceiver: update the table on new destinations, lower cost routes, changes in cost xdoes the remote table has a better route? xremote note is more authoritative (has more up-to-date info)? xwhen a link is faulty, set cost to infinity yRIP-1 (RFC 1058) yMore recent algorithms xmore information, not just neighbors xlink-state algorithms, each node responsible for finding the optimum routes

25. Instructor’s Guide for Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 4 © Pearson Education 2005 Network principles (15): Pseudocode for RIP routing algorithm zTl is the table local table; Tr is the received remote table 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 }