lect-03 - 2006, 2007, M. T. Harandi Lecture 3-1 Computer...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2006, 2007, M. T. Harandi Lecture 3-1 Computer Science 425 Distributed Systems Lecture 3 NETWORKING 2006, 2007, M. T. Harandi Lecture 3-2 Types of Networks Range Bandwidth Latency Local Area 1 - 2 km 10-1000 Mbps 1-10 ms Network (LAN) Wide Area worldwide 0.01- 600 100 - 500 Network (WAN) Metro Area 2 - 50 1 - 150 10 Network (MAN) Wireless LAN 0.15 - 1.5 2 11 5 - 20 Wireless WAN worldwide 0.01 - 2 100 - 500 Internetwork worldwide 0.01 - 2 100 - 500 2006, 2007, M. T. Harandi Lecture 3-3 Networking Issues for DS Performance Scalability Reliability Security Mobility Quality of service Multicasting 2006, 2007, M. T. Harandi Lecture 3-4 Latency ( Lt ) Propagation delay: the time it takes for the first bit of amessage to reach the destination. Processing delay: the time it takes for the OS to process/send/ receive the message. Queueing delay: the time it takes a message to be queued either at end hosts or intermediate nodes waiting for transmission. Data transfer rate ( Tr ) Bandwidth: the total amount of information that can be transmitted over a given time. Performance Factors packet delay = Lt + packet size / Tr, 2006, 2007, M. T. Harandi Lecture 3-5 Networking Principles Switching Schemes Broadcast Circuit Switching : a physical circuit is established from the caller to the callee before communication takes place. Packet Switching (a.k.a. store-and-forward): packets that arrive at a node are first stored at the node and then forwarded toward their destinations. Frame Relay : Similar to store-and-forward, but intermediate nodes route frames based on their first few bits. Frames as a whole are not stored at nodes but pass through the nodes as short streams of bits. 2006, 2007, M. T. Harandi Lecture 3-6 OSI 7-Layer Protocol Model Protocol Specifies the sequence of messages to be exchanged Specifies the format of data in messages Application Presentation Session Transport Network Data link Physical Message Sent Message Received Communication Channel OSI Layered Protocol Model 2006, 2007, M. T. Harandi 2006, 2007, M....
View Full Document

Page1 / 23

lect-03 - 2006, 2007, M. T. Harandi Lecture 3-1 Computer...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online