Lecture 6. TCP/IP Network Layer (4)
|
|
- Charles Harrison
- 5 years ago
- Views:
Transcription
1 Lecture 6 TCP/IP Network Layer (4)
2 Outline (Network Layer) Principles behind network layer services: Virtual circuit and datagram networks Routing algorithms Link State Distance Vector Hierarchical Routing Tables What s inside a router Internet Protocol Datagram format IPv4 addressing CIDR IPv6 Routing in the Internet RIP OSPF BGP Broadcast and multicast routing Miscellaneous protocols and programs ICMP, PING, TRACERT
3 Different Types of Routing Unicast: the destination address specifies a single host (interface). Broadcast: a host wants to send a frame to every other host at the same time on the network. Multicast: the frame should be delivered to a set of hosts that belong to a (multicast) group at the same time.
4 Broadcast Routing Algorithms Flooding: every incoming packet is sent out on every outgoing line except the one it arrived on. It generates too many (duplicate) packets. Consumes too much bandwidth. Special mechanism is used to stop flooding (e.g. hop count, or list of packet seen per source) Spanning tree (or Sink tree): each router needs to know which of its lines belong to a spanning tree. It copies an incoming packet onto all the spanning tree lines except the one it arrived on. Efficient use of bandwidth. Each router must have knowledge of some spanning tree.
5 Broadcast Routing Algorithms Reverse Path Forwarding: if the broadcast packet arrived to the router on the line that is normally used by the router for sending packets to the broadcast source, then the router forwards copies of the packet onto all lines except the one it arrived on. If the broadcast packet arrived to the router on a line other than the preferred one for reaching the source, the packet is discarded as a duplicate.
6 Reverse Path Forwarding: Example A Subnet Sink Tree Reverse Path Forwarding Preferred paths from I to all other nodes fall along the sink tree. On first hop I sends packets to F, H, J and N On second hop 8 packets, 5 along preferred line On third hop 6 packets, 3 along preferred lines After five hops none of the packets is along preferred line, so the algorithm terminates.
7 Broadcast Routing: IP Addresses Limited Broadcast : the limited broadcasting address is This can be use as the destination address of an IP datagram during the host configuration process, when the host might not know its subnet mask or even its IP address. Net-directed Broadcast : the net-directed broadcast address has a host ID of all one bits. class A net-directed broadcasting is netid , where netid is the class A network ID. Subnet-directed Broadcast : the subnet-directed broadcast address has a host ID of all one bits but a specific subnet ID. A router receives a datagram destined for , this is a subnet-directed broadcast if the class B network has a subnet mask of , but it is not a broadcast if the mask is All-subnet-directed Broadcast : an all-subnets-directed broadcast address both the subnet ID and the host ID are all one bits. The destination s subnet mask is , the class B IP address is an all-subnets-directed broadcast. But if the network is not subnetted, then it is net-directed broadcast
8 Multicast Routing the sending of a packet from one sender to multiple receivers with a single transmit operation. One possibility is for the sender to use a separate unicast transport connection to each of the receivers. An application level data unit is duplicated at the sender and transmitted over each of the individual connections. This approach implements a one-sender-to-many-receivers multicast abstraction using an underlying unicast network layer. Alternative is to provide explicit multicast support at the network layer. A single datagram is transmitted from the sending host. This datagram (or a copy of this datagram) is then replicated at a network router whenever it must be forwarded on multiple outgoing links in order to reach the receivers.
9 Multicast Routing Implementation of mutlicast-aware network layer faces two problems that are much more complicated than in the case of unicast (or broadcast) how to identify the receivers of a multicast datagram how to address a datagram sent to these receivers. in the TCP/IP, a multicast datagram is addressed using address indirection, i.e. a single "identifier" is used for the group of receivers, and a copy of the datagram is delivered to all of the multicast receivers associated with that group. the single "identifier" that represents a group of receivers is a Class D multicast address, and the group is referred to as a multicast group.
10 Multicast Group Address A multicast group address, is a class D IP address, i.e. the combination of the high-order 4 bits of 1110 and the multicast group ID. These are in the range of through four hosts (shown in red) are associated with the multicast group address of and will receive all datagrams addressed to that multicast address Some well known multicast group addresses (called permanent host groups): means all system on this subnet (group) means all routers on this subnets (group) is for NTP ( the Network Time Protocol ) is for RIP-2.
11 Multicast Group Abstractly, the concept of multicast group is very simple, nevertheless several issues to be considered: How does a group get started and how does it terminate? How is the group address chosen? How are new hosts added to the group (either as senders or receivers)? Can anyone join a group (and send to, or receive from, that group) or is group membership restricted? Do group members know the identities of the other group members? How do the network routers interoperate with each other to deliver a multicast datagram to all group members? To answer all these questions a protocol has been defined, which is known as Internet Group Management Protocol (IGMP)
12 Internet Group Management Protocol (IGMP) The Internet Group Management Protocol (IGMP) is used between IP hosts and their immediate neighbor multicast agents (routers) to support the creation of multicast groups, the addition and deletion of members of a group, and the periodic confirmation of group membership. IGMP messages are transmitted in IP datagrams, has a fixed-size (8 bytes) message, with no optional data. IGMP messages are specified in the IP datagram with a protocol value of 2 in the IP header. IP datagram IP Header IGMP Message 20 bytes 8 bytes
13 IGMP Message Format (v2) Type: specifies IGMP message type Type Sent by Purpose Membership query:general Router used to learn which groups have members on an attached network Membership query:specific Router used to learn if a particular group has any members on an attached NT Membership report Host report host wants to join or is joined to given multicast group Leave group host report leaving given multicast group Max Response Time: The Max Response Time field is used only in Membership Query messages. It specifies the maximum allowed time before sending a responding report in units of 1/10 second. In all other messages, it is set to zero by the sender and ignored by receivers. Checksum: computing the checksum. Group Address: In a Membership Query message, this field is set to zero when sending a General Query, and set to the group address being queried when sending a Group-Specific Query. In a Membership Report or Leave Group message, this field holds the IP multicast group address of the group being reported or left.
14 Multicast Routing Algorithm IGMP interaction is limited to a host and its attached router only Another protocol (algorithm) is needed to coordinate the multicast routers (including the attached routers) throughout the Internet. This is accomplished by the network layer multicast routing algorithms how the packets should be routed amongst routers in order to insure that each router receives the multicast group traffic that it needs. E A C F D B Multicast hosts, their attached routers, and other routers
15 Multicast Routing: Problem Statement Goal: find a tree (or trees) connecting routers having local multicast group members tree: not all paths between routers used source-based: different tree from each sender to receivers shortest path trees reverse path forwarding shared-tree: same tree used by all group members minimal cost tree (Steiner) center-based trees Source-based trees we first look at basic approaches, then specific protocols adopting these approaches, e.g. PIM, DVMRP Shared tree
16 Shortest Path Tree multicast forwarding tree: tree of shortest path routes from a source to all receivers Dijkstra s algorithm S: source R1 1 R R4 5 R5 LEGEND router with attached group member router with no attached group member R3 R6 6 R7 i link used for forwarding, i indicates order link added by algorithm
17 Reverse Path Forwarding Already discussed Improvement forwarding tree contains subtrees with no multicast group members no need to forward datagrams down subtree prune messages sent upstream by router with no downstream group members S: source R1 R2 R3 R6 R5 R4 R7 LEGEND router with attached group member P router with no attached group member datagram will be forwarded datagram will not be forwarded prune message links with multicast forwarding R3 S: source R2 R1 R4 P R5 P R6 R7
18 Shared-Tree: Steiner Tree Steiner Tree: minimum cost tree connecting all routers with attached group members problem is NP-complete excellent heuristics exists not used in practice: computational complexity information about entire network needed monolithic: rerun whenever a router needs to join/leave
19 Center-based trees single delivery tree shared by all one router identified as center of tree to join: edge router sends unicast join-message addressed to center router join-message processed by intermediate routers and forwarded towards center join-message either hits existing tree branch for this center, or arrives at center path taken by join-message becomes new branch of tree for this router
20 Center-based trees: an example Suppose R6 chosen as center: LEGEND R1 3 R4 router with attached group member R3 R2 1 R6 2 R7 R5 1 router with no attached group member path order in which join messages generated
21 Tunneling only a small fraction of the Internet routers are multicast capable. Q: How to connect islands of multicast routers in a sea of unicast routers? physical topology logical topology multicast datagram encapsulated inside normal (nonmulticast-addressed) datagram normal IP datagram sent thru tunnel via regular IP unicast to receiving multicast router receiving multicast router unencapsulates to get multicast datagram
22 Internet Multicasting Routing DVMRP PIM
23 DVMRP DVMRP: distance vector multicast routing protocol source-based tree, applies reverse path forwarding, pruning and grafting, RPF tree based on DVMRP s own routing tables constructed by communicating DVMRP routers (distance vector algorithm) no assumptions about underlying unicast initial datagram to multicast group flooded everywhere via RPF routers not wanting group: send upstream prune messages
24 DVMRP soft state: DVMRP router periodically (1 min.) forgets the branches pruned: multicast data again flows down unpruned branch downstream router: reprune or else continue to receive data routers can quickly regraft to tree following IGMP join at leaf odds and ends commonly implemented in commercial routers Mbone routing done using DVMRP
25 PIM: Protocol Independent Multicast not dependent on any specific underlying unicast routing algorithm (works with all) two different multicast distribution scenarios : Dense: Multicast group members are densely located, i.e. many or most of the routers in the area need to be involved in routing multicast datagrams. bandwidth more plentiful Sparse: the number of routers with attached group members is small with respect to the total number of routers; group members widely dispersed bandwidth not plentiful
26 PIM- Dense Mode flood-and-prune RPF, similar to DVMRP group membership by routers assumed until routers explicitly prune data-driven construction on multicast tree (e.g., RPF) underlying unicast protocol provides RPF info for incoming datagram less complicated (less efficient) downstream flood than DVMRP reduces reliance on underlying routing algorithm has protocol mechanism for router to detect it is a leafnode router
27 PIM - Sparse Mode center-based approach router sends join message to rendezvous point (RP) i.e. center intermediate routers update state and forward join after joining via RP, router can switch to source-specific tree increased performance: less concentration, shorter paths sender(s): unicast data to RP, which distributes down RP-rooted tree RP can send stop message if no attached receivers no one is listening! R3 R2 R1 join join all data multicast from rendezvous point R6 join R4 R5 R7 rendezvous point
28 Outline (Network Layer) Principles behind network layer services: Virtual circuit and datagram networks Routing algorithms Link State Distance Vector Hierarchical Routing Tables What s inside a router Internet Protocol Datagram format IPv4 addressing CIDR IPv6 Routing in the Internet RIP OSPF BGP Broadcast and multicast routing Miscellaneous protocols and programs ICMP, PING, TRACERT
29 ICMP: Internet Control Message Protocol used by hosts, routers, gateways to communicate network-level information ICMP messages carried in IP datagrams Two categories: Error reporting: unreachable host, network, port, protocol, fragment needed by DF bit set Time exceeded (TTL) etc. Query/response Echo request/reply Timestamp request/reply Address mask request/reply
30 ICMP Message Format Type: There are different values for the type field, which identify the particular ICMP message. Code: Qualifies the ICMP message. Some types of ICMP messages then use different values of the code field to further specify the condition. Checksum: checksum that covers the ICMP message. Data: variable length. Contains the data specific to the message type indicated by the type and code fields.
31 ICMP Message Types
32 ICMP Error Message To prevent broadcast storm, an ICMP error message is never generated in response to An ICMP error message. A datagram destined to an IP broadcast address or an IP multicast address (a class D address). A datagram sent as a link-layer broadcast. A fragment other than the first. A datagram whose source address does not define a single host.
33 ICMP Address Mask Request and Reply The ICMP address mask request is intended for a diskless system to obtain its subnet mask at bootstrap time. The requesting system broadcasts its ICMP request. Format: The identifier and sequence number fields in the ICMP message can be set to anything the sender chooses, and these values are returned in the reply. Subnet mask: the subnet mask of the requesting host (set to 0 in request). ICMP ECHO Request and ECHO Reply messages have same format as the above one. Only difference is the name and size of the last field, which is Data, that carries implementation specific data.
34 ICMP Timestamp Request and Reply The ICMP timestamp request allows a system to query another for the current time. The recommended value to be returned is the number of milliseconds since midnight, Coordinated Universal Time (UTC). The drawback is that only the time since midnight is returned the caller must know the date form some other means. Format: The requestor fills in the originate timestamp and sends the request. The replying system fills in the receive timestamp when it receives the request, and the transmit timestamp when it sends the reply.
35 ICMP Unreachable Message The ICMP unreachable error message is sent by a router when it receives an IP datagram that it cannot deliver or forward: Format: Unused (or last 16 bits, Next Hops MTU): Last 16 bits are used when the code is set to 4 (The datagram is too big. Packet fragmentation is required but the DF bit in the IP header is set). MTU of that next-hop network is specified in the low-order 16 bits. IP header + the first 8 bytes of the original datagram's data: This data is used by the host to match the message to the appropriate process. If a higher level protocol uses port numbers, they are assumed to be in the first 64 data bits of the original datagram's data. (ICMP time exceeded message has same format)
36 ICMPv6 Internet Control Message Protocol Version 6 (ICMPv6) or ICMP for IPv6 is a new version of ICMP. ICMPv6 packet format is similar to ICMP packet format. ICMPv6 combines functions previously subdivided among different protocols, such as ICMP, IGMP and ARP. It introduces some simplifications by eliminating obsolete types of messages no longer in use. Type Meaning Type Meaning 1 Destination Unreachable 130 Group Membership Query 2 Packet Too Big 131 Group Membership Report 3 Time Exceeded 132 Group Membership Reduction 4 Parameter Problem 133 Router Solicitation 128 Echo Request 134 Router Advertisement 129 Echo Reply 135 Neighbor Solicitation
37 Ping Program Ping program is used to test whether another host is reachable. The program sends an ICMP echo request message to a host, expecting an ICMP echo reply to be return. Ping also measures the round-trip time to the host, giving us some indication of how far away that host is. Most TCP/IP implementations contains ping program. identifier field in the ICMP massage is set to the process ID of the sending process. The sequence number starts at 0 and is increased every time a new echo request is sent.
38 Ping Program - Example C:\Documents and Settings\Administrator>ping Pinging with 32 bytes of data: Reply from : bytes=32 time=1ms TTL=128 Reply from : bytes=32 time<1ms TTL=128 Reply from : bytes=32 time<1ms TTL=128 Reply from : bytes=32 time<1ms TTL=128 Ping statistics for : Packets: Sent = 4, Received = 4, Lost = 0 (0% loss), Approximate round trip times in milli-seconds: Minimum = 0ms, Maximum = 1ms, Average = 0ms
39 Ping Program with IP Record Route Option Most versions of ping provide the -r option that enables the record route (RR) feature, i.e. every router that handles the datagram adds its IP address to a list in the options field. When the datagram reaches the final destination, the list of IP addresses is copied into the outgoing ICMP echo reply, and all the routers on the return path also add their IP addresses to the list. The big problem is the limited room in the IP header for the list of IP addresses. General format of the option field: Code: a 1-byte field specifying the type of IP option. For RR its value is 7. Len: the total number of bytes of the RR option (i.e. 39 bytes). Prt: the pointer field. It points into the 39-byte option of where to store the next IP address. Its minimum value is 4, which is the pointer to the first IP address. It becomes 8,12..
40 Ping Program with -r Option - Example C:\>ping -r 9 Pinging premium9.geo.yahoo7.akadns.net [ ] with 32 bytes of data: Reply from : bytes=32 time=2176ms TTL=51 Route: > > > > > > > > Reply from : bytes=32 time=2250ms TTL=50 Route: > > > > > > > > Request timed out Ping statistics for : Packets: Sent = 4, Received = 3, Lost = 1 (25% loss), Approximate round trip times in milli-seconds: Minimum = 2139ms, Maximum = 2250ms, Average = 2188ms
41 Ping Program with IP Time Stamp Option The IP timestamp option is similar to the record route option, i.e. each router records its current time also. General Format: Code: a 1-byte field specifying the type of IP option. For timestamp its value is 0x44. Len: the total number of bytes of the timestamp Prt: the pointer field. Normal values 5, 9, 13 OF (4 bits): overflow field is incremented by a router if there is no room to add time stamp. FL (4 bits): flag field drives the time stamp option.
42 Ping Program with IP Time Stamp Option - Example C:\Documents and Settings\Administrator>ping -s 4 Pinging [ ] with 32 bytes of data: Reply from : bytes=32 time<1ms TTL=63 Timestamp: : > : > : > : Reply from : bytes=32 time<1ms TTL=63 Timestamp: : > : > : > : Reply from : bytes=32 time<1ms TTL=63 Timestamp: : > : > : > : Reply from : bytes=32 time<1ms TTL=63 Timestamp: : > : > : > : Ping statistics for : Packets: Sent = 4, Received = 4, Lost = 0 (0% loss), Approximate round trip times in milli-seconds: Minimum = 0ms, Maximum = 0ms, Average = 0ms
43 Traceroute Program Traceroute program enables to see the route that IP datagrams follow from one host to another host (source to destination). Why don t use Ping program with IP record route option: not all router support the record route option the room (9 IP addresses in the IP header) allocated for options in the IP header isn t large enough today to handle most routes
44 Traceroute Program Operation Traceroute principles: use TTL field: a router gets a IP datagram whose TTL is either 0 or 1 => not forward it and throws away AND send back to the originating host an ICMP time exceeded use UDP: assign an unlikely value (>30000) to the port number AND even if the datagram REALLY reached the destination, it also caused a ICMP port unreachable operations: Set TTL=1, send the IP datagram and then gets a ICMP from the FIRST router Set TTL=2, and then gets the address of the second router And so on for TTL=N, but if the error is port unreachable then we know reached the destination
45 Traceroute Program - Example C:\>tracert Tracing route to [ ] over a maximum of 30 hops: TTL 1 <1 ms <1 ms <1 ms ms 3 ms 3 ms * 54 ms 5 ms ms 4 ms 50 ms * 1875 ms * ms 1809 ms 1868 ms ge sngtp-cr1.ix.singtel.com [ ] ms 1816 ms 1829 ms ge sngtp-ar6.ix.singtel.com [ ] ms 1988 ms * so lonlx-cr2.ix.singtel.com [ ] ms 2060 ms * ms 2138 ms 2078 ms ms * 2125 ms so lond-sbr1.ja.net [ ] ms * 2135 ms LMN-LMN1.site.ja.net [ ] 13 * * * Request timed out ms 2190 ms 2172 ms ms 2113 ms 2104 ms * * * Request timed out ms 2148 ms * ms 2136 ms 2135 ms www-vip.city.ac.uk [ ] Trace complete. RTT Round Trip Time For each TTL value 3 Datagrams are sent No Response Received
46 Traceroute with IP Source Routing Option Source routing: the sender specifies the route: Strict: the sender specifies the exact path that the IP datagram must follow. If a router encounters a next hop in the source route that isn t on a directly connected network, an ICMP source route failed error is returned. Loose: the sender specifies a list of IP address that the datagram must traverse, but the datagram can also pass through other routers between any two addresses in the list Option format in the IP header The code is 0x83 for loose source routing and 0x89 for strict source routing. The len, ptr and other fields have same semantic as in RR option in ping program. Most implementation of Traceroute program supports only loose source routing.
47 Notice Mid term 1 exam marks are available at,
48 Reading Material Chapter 4 text3 (Kurose) Chapter 5 text2 (Tanenbaum) Chapter 12, 13, 6, 7, 8, 9 text1 (Stevens) For ICMPv6 : RFC 4443, at
DATA COMMUNICATOIN NETWORKING
DATA COMMUNICATOIN NETWORKING Instructor: Ouldooz Baghban Karimi Course Book & Slides: Computer Networking, A Top-Down Approach By: Kurose, Ross Introduction Course Overview Basics of Computer Networks
More informationBroadcast Routing. Multicast. Flooding. In-network duplication. deliver packets from source to all other nodes source duplication is inefficient:
Broadcast Routing Multicast deliver packets from source to all other nodes source duplication is inefficient: duplicate duplicate creation/transmission duplicate source duplication in-network duplication
More informationExercises to Communication Systems
Exercises to Communication Systems IP Multicast Dr.-Ing. Falko Dressler Kai-Steffen Hielscher Department of Computer Science 7 University of Erlangen Group Communication Multiple partners communicate in
More informationNetwork Layer II. Getting IP addresses. DHCP client-server scenario. DHCP client-server scenario. C compiler. You writing assignment 2
Network Layer II Still chapter 4 in the textbook C compiler You writing assignment 2 Getting IP addresses ARP is the simplest way, which we will barely discuss (now) It s a mapping between Ethernet MAC
More informationInternet Control Message Protocol (ICMP)
Internet Control Message Protocol (ICMP) 1 Overview The IP (Internet Protocol) relies on several other protocols to perform necessary control and routing functions: Control functions (ICMP) Multicast signaling
More informationReview. Some slides are in courtesy of J. Kurose and K. Ross
Review The Internet (IP) Protocol Datagram format IP fragmentation ICMP: Internet Control Message Protocol NAT: Network Address Translation Routing in the Internet Intra-AS routing: RIP and OSPF Inter-AS
More informationICMP (Internet Control Message Protocol)
Today s Lecture ICMP (Internet Control Message Protocol) Internet Protocols CSC / C 573 I. ICMP Overview II. ICMP rror Reporting III. ICMP Query / Response Messages IV. ICMP Message Processing Fall, 2005
More informationMulticast Communications. Slide Set were original prepared by Dr. Tatsuya Susa
Multicast Communications Slide Set were original prepared by Dr. Tatsuya Susa Outline 1. Advantages of multicast 2. Multicast addressing 3. Multicast Routing Protocols 4. Multicast in the Internet 5. IGMP
More informationMulticast Communications
Multicast Communications Multicast communications refers to one-to-many or many-tomany communications. Unicast Broadcast Multicast Dragkedja IP Multicasting refers to the implementation of multicast communication
More informationCSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer V Dmitri Loguinov Texas A&M University April 17, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross Chapter 4:
More informationComputer Networks. Wenzhong Li. Nanjing University
Computer Networks Wenzhong Li Nanjing University 1 Chapter 4. Internetworking The Internet Protocol IP Address ARP and DHCP ICMP IPv6 Mobile IP Internet Routing BGP and OSPF IP Multicasting Multiprotocol
More informationWhat is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals
What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting
More informationTopic: Multicast routing
Topic: Multicast routing What you will learn Broadcast routing algorithms Multicasting IGMP Multicast routing algorithms Multicast routing in the Internet Multicasting 1/21 Unicasting One source node and
More informationMulticast. Midterm. EECS 122: Lecture 16. University of California Berkeley. Exam was not meant to be easy
Multicast EECS : Lecture 6 Department of Electrical Engineering and Computer Sciences University of California Berkeley Midterm Exam was not meant to e easy Mean: 5 Median: 5 Std Dev: 8 Performance quite
More informationIP - The Internet Protocol. Based on the slides of Dr. Jorg Liebeherr, University of Virginia
IP - The Internet Protocol Based on the slides of Dr. Jorg Liebeherr, University of Virginia Orientation IP (Internet Protocol) is a Network Layer Protocol. IP: The waist of the hourglass IP is the waist
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Dr. Nils
More informationITEC310 Computer Networks II
ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able
More informationList of groups known at each router. Router gets those using IGMP. And where they are in use Where members are located. Enhancement to OSPF
Multicast OSPF OSPF Open Shortest Path First Link State Protocol Use Dijkstra s algorithm (SPF) Calculate shortest path from the router to every possible destination Areas Limit the information volume
More informationLehrstuhl für Informatik 4 Kommunikation und verteilte Systeme. Auxiliary Protocols
Auxiliary Protocols IP serves only for sending packets with well-known addresses. Some questions however remain open, which are handled by auxiliary protocols: Address Resolution Protocol (ARP) Reverse
More informationInternet Multicast Routing
Internet Multicast Routing. group addressing class D IP addresses 1110 Multicast Group ID. link layer multicast 28 bits. two protocol functions group management IGMP route establishment DVMRP, MOSPF, CBT,
More informationLecture 3. The Network Layer (cont d) Network Layer 1-1
Lecture 3 The Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router? Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets
More informationIP Multicast Technology Overview
IP multicast is a bandwidth-conserving technology that reduces traffic by delivering a single stream of information simultaneously to potentially thousands of businesses and homes. Applications that take
More informationWhy multicast? The concept of multicast Multicast groups Multicast addressing Multicast routing protocols MBONE Multicast applications Conclusions
Tuomo Karhapää tuomo.karhapaa@otaverkko.fi Otaverkko Oy Why multicast? The concept of multicast Multicast groups Multicast addressing Multicast routing protocols MBONE Multicast applications Conclusions
More informationChapter 19 Network Layer: Logical Addressing
Chapter 19 Network Layer: Logical Addressing 19.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 19.2 19-1 IPv4 ADDRESSES An IPv4 address is a 32-bit address
More informationDate: June 4 th a t 1 4:00 1 7:00
Kommunika tionssyste m FK, Examina tion G 5 0 7 Date: June 4 th 0 0 3 a t 4:00 7:00 KTH/IMIT/LCN No help material is allowed. You may answer questions in English or Swedish. Please answer each question
More informationIP Multicast. What is multicast?
IP Multicast 1 What is multicast? IP(v4) allows a host to send packets to a single host (unicast), or to all hosts (broadcast). Multicast allows a host to send packets to a subset of all host called a
More informationNetwork Layer (4): ICMP
1 Network Layer (4): ICMP Required reading: Kurose 4.4.3, 4.4.4 CSE 4213, Fall 2006 Instructor: N. Vlajic 2 1. Introduction 2. Network Service Models 3. Architecture 4. Network Layer Protocols in the Internet
More informationICS 351: Today's plan. routing protocol comparison encapsulation network dynamics multicasting in general IP multicasting IGMP PIM
ICS 351: Today's plan routing protocol comparison encapsulation network dynamics multicasting in general IP multicasting IGMP PIM what routing is not: Ethernet switching does not use IP addresses in any
More informationLast time. Network layer. Introduction. Virtual circuit vs. datagram details. IP: the Internet Protocol. forwarding vs. routing
Last time Network layer Introduction forwarding vs. routing Virtual circuit vs. datagram details connection setup, teardown VC# switching forwarding tables, longest prefix matching IP: the Internet Protocol
More informationEEC-684/584 Computer Networks
EEC-684/584 Computer Networks Lecture 14 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Internetworking
More informationLecture 8. Network Layer (cont d) Network Layer 1-1
Lecture 8 Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets Network
More informationChapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP
Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP 4.5 routing algorithms link state
More informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 12 Internet Routing: Multicast Today: Multicast routing Multicast service model Host interface Host-router interactions (IGMP) Multicast Routing Limiters
More informationCS 356: Computer Network Architectures. Lecture 10: IP Fragmentation, ARP, and ICMP. Xiaowei Yang
CS 356: Computer Network Architectures Lecture 10: IP Fragmentation, ARP, and ICMP Xiaowei Yang xwy@cs.duke.edu Overview Homework 2-dimension parity IP fragmentation ARP ICMP Fragmentation and Reassembly
More informationChapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP
Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link
More informationMulticast service model Host interface Host-router interactions (IGMP) Multicast Routing Distance Vector Link State. Shared tree.
CSE 123A Computer Networks Fall 2009 Lecture 10 Internet Routing: Multicast Today: Multicast routing Multicast service model Host interface Host-router interactions (IGMP) Multicast Routing Distance Vector
More informationAdvanced Network Training Multicast
Division of Brocade Advanced Network Training Multicast Larry Mathews Systems Engineer lmathews@brocade.com Training Objectives Session will concentrate on Multicast with emphasis on Protocol Independent
More informationTSIN02 - Internetworking
Lecture 2: The Internet Protocol Literature: Forouzan: ch 4-9 and ch 27 2004 Image Coding Group, Linköpings Universitet Outline About the network layer Tasks Addressing Routing Protocols 2 Tasks of the
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for
More informationAdvanced Networking. Multicast
Advanced Networking Multicast Renato Lo Cigno Renato.LoCigno@dit.unitn.it Homepage: disi.unitn.it/locigno/index.php/teaching-duties/advanced-networking Multicasting Addresses that refer to group of hosts
More informationETSF10 Internet Protocols Routing on the Internet
ETSF10 Internet Protocols Routing on the Internet 2013, Part 2, Lecture 1.2 Jens Andersson (Kaan Bür) Routing on the Internet Unicast routing protocols (part 2) [ed.5 ch.20.3] Multicast routing, IGMP [ed.5
More informationDepartment of Computer Science and Engineering. COSC 4213: Computer Networks II (Fall 2005) Instructor: N. Vlajic Date: November 3, 2005
Department of Computer Science and Engineering COSC 4213: Computer Networks II (Fall 2005) Instructor: N. Vlajic Date: November 3, 2005 Midterm Examination Instructions: Examination time: 75 min. Print
More informationThe Interconnection Structure of. The Internet. EECC694 - Shaaban
The Internet Evolved from the ARPANET (the Advanced Research Projects Agency Network), a project funded by The U.S. Department of Defense (DOD) in 1969. ARPANET's purpose was to provide the U.S. Defense
More informationIP Multicast Routing Protocols
IP Multicast Routing Protocols Term Paper By : Priyank Porwal (97255) Course : Advanced Computer Networks (CS625) Instructor : Dr. Dheeraj Sanghi Department of CSE, IIT Kanpur. April, 2000. Table of Contents
More informationIP Multicast Technology Overview
IP multicast is a bandwidth-conserving technology that reduces traffic by delivering a single stream of information simultaneously to potentially thousands of businesses and homes. Applications that take
More informationMulticast EECS 122: Lecture 16
Multicast EECS 1: Lecture 16 Department of Electrical Engineering and Computer Sciences University of California Berkeley Broadcasting to Groups Many applications are not one-one Broadcast Group collaboration
More informationIP Multicast: Does It Really Work? Wayne M. Pecena, CPBE, CBNE
IP Multicast: Does It Really Work? Wayne M. Pecena, CPBE, CBNE Texas A&M Information Technology Educational Broadcast Services - KAMU v2 Agenda Introduction IP Networking Review The Multicast Group Multicast
More informationCommunication Networks ( ) / Fall 2013 The Blavatnik School of Computer Science, Tel-Aviv University. Allon Wagner
Communication Networks (0368-3030) / Fall 2013 The Blavatnik School of Computer Science, Tel-Aviv University Allon Wagner Kurose & Ross, Chapter 4 (5 th ed.) Many slides adapted from: J. Kurose & K. Ross
More information(ICMP), RFC
Internet et Control o Message Protocol (ICMP), RFC 792 http://icourse.cuc.edu.cn/networkprogramming/ linwei@cuc.edu.cn Nov. 2009 Overview The IP (Internet Protocol) relies on several other protocols to
More informationIP Protocols. ALTTC/Oct
IP Protocols Internet or IP technology over the years has emerged as the most prominent data communication technology. TCP/IP protocol has become de-facto data comm standard throughout the world. It can
More informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2017 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński Network Layer The majority of slides presented in
More informationCCNA Exploration Network Fundamentals. Chapter 06 Addressing the Network IPv4
CCNA Exploration Network Fundamentals Chapter 06 Addressing the Network IPv4 Updated: 20/05/2008 1 6.0.1 Introduction Addressing is a key function of Network layer protocols that enables data communication
More informationNetwork Layer. The Network Layer. Contents Connection-Oriented and Connectionless Service. Recall:
Network Layer The Network Layer Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control 1 2 Contents 4.1.1 Connection-Oriented and Connectionless
More informationNetwork Layer. Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control
The Network Layer 1 Network Layer Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control 2 Contents Connection-Oriented (virtual circuit)
More informationThe Internet network layer
The Internet network layer host, router network layer functions: transport layer: TCP, UDP network layer routing protocols path selection RIP, OSPF, BGP forwarding table link layer physical layer IP protocol
More informationTopics for This Week
Topics for This Week Routing Protocols in the Internet OSPF, BGP More on IP Fragmentation and Reassembly ICMP Readings Sections 5.6.4-5.6.5 1 Hierarchical Routing aggregate routers into regions, autonomous
More informationMulticast routing protocols
Multicast routing protocols IGMP IP Group Management Protocol PIM Protocol Independent Multicast MOSPF Multicast OSPF DVMRP DV Multicast Routing Protocol E7310-Multicast-2/Comnet 1 Multicast in local area
More informationComputer Networks. Routing
Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding
More informationInternet Control Message Protocol (ICMP)
Chapter 9 Internet Control Message Protocol (ICMP) مترجم : دکتر محمد حسین یغمایی 1 TCP/IP Protocol Suite CONTENTS TYPES OF MESSAGES MESSAGE FORMAT ERROR REPORTING QUERY CHECKSUM ICMP PACKAGE مترجم : دکتر
More informationCPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer
1 CPSC 826 Intering The Network Layer: Routing & Addressing Outline The Network Layer Michele Weigle Department of Computer Science Clemson University mweigle@cs.clemson.edu November 10, 2004 Network layer
More informationLecture 4 - Network Layer. Transport Layer. Outline. Introduction. Notes. Notes. Notes. Notes. Networks and Security. Jacob Aae Mikkelsen
Lecture 4 - Network Layer Networks and Security Jacob Aae Mikkelsen IMADA September 23, 2013 September 23, 2013 1 / 67 Transport Layer Goals understand principles behind network layer services: network
More informationNetwork layer: Overview. Network layer functions IP Routing and forwarding NAT ARP IPv6 Routing
Network layer: Overview Network layer functions IP Routing and forwarding NAT ARP IPv6 Routing 1 Network Layer Functions Transport packet from sending to receiving hosts Network layer protocols in every
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 13
CMPE 50/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 3 Lab3 online Due March 4 th. Introduction -2 IP addresses: how to get one? Q: how does network
More informationChapter 09 Network Protocols
Chapter 09 Network Protocols Copyright 2011, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Outline Protocol: Set of defined rules to allow communication between entities Open Systems
More informationNetwork layer: Overview. Network Layer Functions
Network layer: Overview Network layer functions IP Routing and forwarding NAT ARP IPv6 Routing 1 Network Layer Functions Transport packet from sending to receiving hosts Network layer protocols in every
More informationBroadcast and Multicast Routing
Broadcast and Multicast Routing Daniel Zappala CS 460 Computer Networking Brigham Young University Group Communication 2/34 How can the Internet provide efficient group communication? send the same copy
More informationRouter Architecture Overview
Chapter 4: r Introduction (forwarding and routing) r Review of queueing theory r Router design and operation r IP: Internet Protocol m IPv4 (datagram format, addressing, ICMP, NAT) m Ipv6 r Generalized
More informationHierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
More informationChapter 4 roadmap. CS555, Spring /14/2005. WMU-CS, Dr. Gupta 1. Multicast Routing: Problem Statement. Approaches for building mcast trees
Chapter 4 roadmap 4. Introduction and Network Service Models 4.2 VC and Datagram Networks 4.3 What s Inside a Router 4.4 The Internet (IP) Protocol 4.5 Routing Algorithms 4.6 Routing in the Internet 4.7
More informationIP Multicast. Falko Dressler Regionales Rechenzentrum Grundzüge der Datenkommunikation IP Multicast
Falko Dressler Regionales Rechenzentrum falko.dressler@rrze.uni-erlangen.de 1 Agenda Basics Principles of IP multicast, addressing, TTL Internet Group Management Protocol (IGMP) IGMPv1, v2, v3 Layer-2
More informationChapter 4 Network Layer
Chapter 4 Network Layer CPSC 335 Data Communication Systems Readings: 4.4.3, 4.4.4, 4.5, 4.5.1 David Nguyen Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
More informationComputer Networking Introduction
Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.13 Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram
More informationMulticast Technology White Paper
Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission
More informationComputer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery
Computer Networks ICS 651 IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery Routing Information Protocol DV modified with split horizon and poisoned reverse distance
More informationECE4110 Internetwork Programming. Introduction and Overview
ECE4110 Internetwork Programming Introduction and Overview 1 EXAMPLE GENERAL NETWORK ALGORITHM Listen to wire Are signals detected Detect a preamble Yes Read Destination Address No data carrying or noise?
More informationLecture 19: Network Layer Routing in the Internet
Lecture 19: Network Layer Routing in the Internet COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F
More informationChapter 4: Network Layer
Chapter 4: Introduction (forwarding and routing) Review of queueing theory Routing algorithms Link state, Distance Vector Router design and operation IP: Internet Protocol IPv4 (datagram format, addressing,
More informationExample questions for the Final Exam, part A
ETSF10, ETSF05 Ht 2010 Example questions for the Final Exam, part A 1. In AdHoc routing there are two main strategies, reactive and proactive routing. Describe in a small number of words the concept of
More informationExercises to Communication Systems
Exercises to Communication Systems IP Multicast Additional Slides Dr.-Ing. Falko Dressler Department of Computer Science 7 University of Erlangen ÜKS, WS 05/06 1 IP Multicast Introduction Internet Group
More informationIPv6 and Multicast. Outline. IPv6 Multicast. S Computer Networks - Spring 2005
IPv6 and Multicast 188lecture5.ppt Pasi Lassila 1 Outline IPv6 Multicast 2 IPv6 overview Motivation Internet growth (address space depletion and routing information eplosion) CIDR has helped but eventually
More informationCMPT 371: Data Communications and Networking. Chapter 4: Network Layer
School of Computing Science Simon Fraser University CMPT 371: Data Communications and Networking Chapter 4: Network Layer Network Layer 4-1 Chapter 4: Network Layer Chapter goals: understand principles
More informationLecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 4 The Network Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Network layer functions Transport packet from sending to receiving hosts Network layer protocols in every
More informationChapter 4 Network Layer
Chapter 4 Network Layer Prof. Yuh-Shyan Chen Department of Computer Science and Information Engineering National Taipei University May 2007 Computer Networking: A Top Down Approach Featuring the Internet,
More informationInternet Control Message Protocol (ICMP), RFC 792. Prof. Lin Weiguo Copyleft 2009~2017, School of Computing, CUC
Internet Control Message Protocol (ICMP), RFC 79 Prof Lin Weiguo Copyleft 009~07, School of Computing, CUC Oct 07 Overview } The IP (Internet Protocol) relies on several other protocols to perform necessary
More informationChapter 4: Network Layer. Chapter 4: Network Layer
Chapter 4: Network Layer Chapter goals: understand principles behind network layer services: network layer service models forwarding versus routing how a router works routing (path selection) dealing with
More informationChapter 4 Network Layer
Sungkyunkwan University Chapter 4 Network Layer Prepared by H. Choo 2018-Fall Computer Networks Copyright 2000-2014 2000-2018 Networking Laboratory 1/52 Presentation Outline 4.1 Introduction 4.2 Network-Layer
More informationInternet Protocol. Outline Introduction to Internet Protocol Header and address formats ICMP Tools CS 640 1
Internet Protocol Outline Introduction to Internet Protocol Header and address formats ICMP Tools CS 640 1 Internet Protocol Runs on all hosts in the Internet and enables packets to be routed between systems
More informationChapter 4 Network Layer. Chapter 4: Network Layer. Chapter 4: Network Layer. Chapter goals: understand principles behind network layer services:
Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
More informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 009. Chapter 4: Network Layer Chapter goals: understand principles behind layer
More informationMulticast overview. Introduction to multicast. Information transmission techniques. Unicast
Contents Multicast overview 1 Introduction to multicast 1 Information transmission techniques 1 Multicast features 3 Common notations in multicast 4 Multicast advantages and applications 4 Multicast models
More informationCS610 Computer Network Final Term Papers Solved MCQs with reference by Virtualians Social Network
CS610 Computer Network Final Term Papers Solved MCQs with reference by Virtualians Social Network Question No: 1( M a r k s: 1 ) A ---------- Relies on the hardware manufacturer to assign a unique physical
More informationChapter 4 Network Layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach 4 th edition. Jim Kurose, Keith Ross Addison-Wesley, July 2007. All material copyright 1996-2007 J.F Kurose and K.W. Ross, All Rights Reserved
More informationVorlesung Kommunikationsnetze
Picture 15 13 Vorlesung Kommunikationsnetze Prof. Dr. H. P. Großmann mit B. Wiegel sowie A. Schmeiser und M. Rabel Sommersemester 2009 Institut für Organisation und Management von Informationssystemen
More informationETSF10 Internet Protocols Routing on the Internet
ETSF10 Internet Protocols Routing on the Internet 2012, Part 2, Lecture 1.2 Kaan Bür, Jens Andersson Routing on the Internet Unicast routing protocols (part 2) [ed.4 ch.22.4] [ed.5 ch.20.3] Forwarding
More informationChapter 4 Network Layer
Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
More informationCS 457 Lecture 11 More IP Networking. Fall 2011
CS 457 Lecture 11 More IP Networking Fall 2011 IP datagram format IP protocol version number header length (bytes) type of data max number remaining hops (decremented at each router) upper layer protocol
More informationDa t e: August 2 0 th a t 9: :00 SOLUTIONS
Interne t working, Examina tion 2G1 3 0 5 Da t e: August 2 0 th 2 0 0 3 a t 9: 0 0 1 3:00 SOLUTIONS 1. General (5p) a) Place each of the following protocols in the correct TCP/IP layer (Application, Transport,
More informationCOMPUTER NETWORKS CHAP 4 : NETWORK LAYER
COMPUTER NETWORKS CHAP 4 : NETWORK LAYER 0160 08 h 12 h 29 Sep 2011 Chapter 4: 4-2 Chapter goals: understand principles behind network layer services: network layer service models forwarding versus routing
More informationYour Name: Your student ID number:
CSC 573 / ECE 573 Internet Protocols October 11, 2005 MID-TERM EXAM Your Name: Your student ID number: Instructions Allowed o A single 8 ½ x11 (front and back) study sheet, containing any info you wish
More informationICMP (Internet Control Message Protocol)
ABSTRACT : ICMP stands for internet control message protocol it is a vital protocol of network layer among the seven layers of OSI(open system interconnection). Here we deal with the several situations
More information