Chapter 7 : The Network Layer

Size: px
Start display at page:

Download "Chapter 7 : The Network Layer"

Transcription

1 Q. Network layer duties: Handling accounting for usage of network resources Devise and implement mechanisms of identifying each machine uniquely Implement connectionless or connection-oriented forwarding Multiplexing and de-multiplexing the transport layer and the data link layer jobs Following are the duties of network layer: a) Routing b) Accounting c) Receive Service from DLL d) Provide Service to Transport Layer e) Global Machine-Level Addressing f) Multiplexing and Demultiplexing Multiple Transport Layer Connections g) Multiplexing and Demultiplexing Multiple Data Link Layer Connections a) Routing Routing is to know about other routers where each of them is located which networks they are connected to Forwarding is finding out about one s own neighboring routers forward a specified packet to its nearest neighbor to make it reach to a given destination Routing table contains information about nearest router for given destination Routing algorithms decide placement of routers Virtual circuit is mechanism used for connection oriented forwarding Datagrams are units of data sent in connectionless forwarding Two different types of routing: Collection of networks organized by a single party is known as an autonomous system (AS). When packet needs to be routed within AS, internal routing methods are used. Internal routing strategy is called Link State Routing. Eg. OSPF (Open Shortest Path First). Older technology was Distance Vector Routing. Eg. RIP (Routing Information Protocol). When packet needs to be routed between different AS, we need external routing. Eg. BGP (Border Gateway Protocol OR External Gateway Protocol. Exterior routing is across AS BGP (Border Gateway Protocol) Interior routing is within AS Distance Vector (eg. RIP) Link state (eg. OSPF) AODV b) Accounting Network manages sessions, its accounting, keeps track of which user has sent how many packets. Payment is determined based on this accounting process. Accounting also helps in security, auditing and tracing process where IP falls short. Accounting helps in calculating how much bandwidth is used by which connection of ISP. Accounting is done by protocol named SNMP (Simple Network Management Protocol at Application Layer. Sub: FON, bhargavigoswami@gmail.com Page 1

2 c) Receive Service from Data Link Layer: Chapter 7 : The Network Layer When IP Packet is constructed at network layer, it contains the source address as S and receiver s address as R. The data link layer frame is constructed at each hop is different as depicted in Figure given above. Network layer decides who the next recipient of this packet should be and then pass it on to the data link layer. This structure is shown in next figure. Sub: FON, bhargavigoswami@gmail.com Page 2

3 d) Provide Service to Transport Layer: The network layer provides service to transport layer. The most important service is to accept packet to be sent to other end. The IP, upon receiving a packet, looks at a field called PROTOCOL to find out which transport layer protocol it is trying to send information about. If PROTOCOL = 6; Pass content to TCP If PROTOCOL = 17; Pass content to UDP e) Global Machine Level Addressing: Biggest requirement is to identify machine globally. Eg. addresses are unique. How to achieve it? Best solution is IPv6. But, not practiced that much. Other options: o Classful Addressing: Division is based on Size of Network. Class A ( Accommodate 2 million nodes, First 1 byte for network, 3 byte for host). Class B ( Accommodate nodes, First 2 byte for network, 2 byte for host) and Class C ( Accommodate 254 nodes, First 3 byte for network, 1 byte for host). o Dotted Decimal Notation: 32 bit long; i.e 4 bytes Purely binary format addressing Tough to remember. o Classless Addressing: IP Addresses are replaced by CIDR ( Classless Inter Domain Routing) by modern routers. Same 32 bit binary number is represented by byte boundary. Even here, machine has unique address. Here, slash notations are devised. Eg /24 means network address contains 24 bites. In this structure, packet is passed to the router nearest to the network. Such structure saves lot of routing table space. See the next figures as examples. o Aggregating Multiple Routing Entries: Normally R2 would have following 6 entries. Network ID Next hop address Interface (other fields) /16 R /16 R /16 R /24 R /24 R /24 R3 2 Sub: FON, bhargavigoswami@gmail.com Page 3

4 As a solution, following table would save much of the space without affecting routing. Network ID Next hop address Interface (other fields) 11.*/16 R */24 R3 2 o Unique Address Requirement: Problem: IP Address Conflict error may come if same address is used by multiple host. Solution: ISP can assign any unused address. Thus, sharing is possible but with condition that only one party is using that address at a given point of time. o NAT: Network Address Translation: Now, it is possible that one address is shared among a few nodes in the Internet using a technology called NAT (Network Address Translation. Idea: Give each node an IP address that is not known in the Internet. Sender address is always modified to valid address by router connecting to Internet. Eg. Two nodes and will send packets together through NAT box or NAT enabled Router with address Advantage: Organization with fewer Internet address can accommodate multiple users without taking Internet for each one of them. Almost all ISP today use NAT to cater to the needs of many broadband customers. Disadvantage: Still, NAT is a temporary solution. It cannot meet excessive requirement of IP address for Internet connectivity. o Real Solution: IPv6: IP next generation version 6. It is 128 bit address field. Better scheme for aggregation is available here. Two aggregation types supported: a) ISP-Wise and b) Location-wise. Internet is slowly moving towards all IPv6 case despite some interoperability issues. f) Multiplexing and Demultiplexing Multiple Transport Layer Connections: It is possible to have TCP and UPD both together serving multiple applications. DNS and VoIP use UDP. FTP, Telnet and SMTP uses TCP. TCP and UDP are running independently with the help of Network Layer. Network Layer do this job using Multiplexing and Demultiplexing. g) Multiplexing and Demultiplexing Data Link Layer Connections: Even Data link layer does this job to multiplex multiple network layer connections. Similarly, Transport layer does this for multiple Application data. Q. Connection-Oriented Forwarding using Virtual Circuits: Steps involved in CO forwarding: 1) Find out a complete path to the other end 2) Informs the routers along the path and gets their confirmation 3) The service may be degraded or another path is tried if some router is not willing 4) Once the intermediate routers confirm to the requirement, resource allocation is done. o (a) reserve resources o (b) set the priorities o (c) take a call on other services needed o (d) reserve an amount of bandwidth 5) Now every connection is given Identifier by each router. o Connection ID is provided Sub: FON, bhargavigoswami@gmail.com Page 4

5 o Independent of other routers o No provision for a central authority o The central authority needs to be consulted for every connection establishment process o If the central authority fails, no connection is possile o Assigning the connection number locally is simple and effective 6) After every router accepts connection, unique number is assigned and same is expected from receiver. Internet is not using Virtual Circuits currently, but, the method still exist and is known as MPLS (Multi Protocol Label Switching). Flow label in IPV6 frame format does this job on behalf of MPLS. Q. Connectionless Forwarding using Datagrams: Datagrams work on the concept of dropped and forgotten. It reaches the destination on its own, without no fixed path followed. Datagram based connectionless forwarding Advantages: Not wasteful, Autonomy and recovery supported, Better fault tolerance. Normal Path when no fault: A router out of order: A communication line out of order: Sub: FON, bhargavigoswami@gmail.com Page 5

6 Q. CO vs CL forwarding: Connection establishment: VC requires this phase, Datagram-based solutions do not Routing: Datagrams are checked and processed at every router while not in VC Speed of operation: more time to route datagrams Congestion control: Admission control vs routing around the congested path Addressing : Datagrams are designed to re-route Robustness : Datagrams are more robust when congestions are expected Quality of service: Connection-oriented service is better to provide QOS Avoiding congested path while routing: Suppose D is working: Sub: FON, bhargavigoswami@gmail.com Page 6

7 Now, D is not working: B s routing table before and after D stopped functioning: Destination Next node Interface A A 1 K A 1 I D Destination Next node Interface A A 1 K A 1 I C Q. Requirements of a good Routing Algorithms Packets continuously and forwards them to their destinations in minimum possible time. Impartial to all the nodes. Simple enough to be implemented Should not oscillate frequently to make packet forwarding erratic. Good path to receiver is recorded. Fault tolerance: Must continue functioning irrespective of nodes and links going up and down. Must not be bogged by increasing or decreasing number of nodes. Fast enough to reflect changes in network topology in real time. Speed is maintained. Other requirements: Dynamism and flexibility Performance Robustness Dynamism and Flexibility: Must adopt to user requirements. High level algorithms need policy based implementation. Policies: Routing thru Russia is not allowed from US Routers of specific company routes data to it customers only Only after payment, data is transmitted. Algo must be flexible enough to adapt to changes. Sub: FON, bhargavigoswami@gmail.com Page 7

8 Changes in policies is frequent. Eg. Link state algo update after every minute to keep other routers informed about dynamic changes. When number of nodes increases, routers follow hierarchical routing. It stores only local address and 1 group address representing other group member s addresses also. Performance: Algorithms are implemented as algorithms only? No. Then? It is implemented as formula also. Routers do not follow algo or formulas only, it has clever tricks to do parallel job in fastest possible way. Issues: Scale the size of network Network Grow in size, vary performance. Routers must catch up with increasing load on increasing nodes to the network. Quality of Service Maintenance of QoS is important factor. Data security standards must keep running despite of failures. Issues: Delay, fault tolerance, bandwidth variations, real time applications, Video On Demand, Video Conferencing, etc Performance: High Availability Solutions Modern routers have additional components to switch over when components breaks down. Multiple components are kept in routers just for improving fault tolerance. Routers are also equipped with spare routers which can take over when main routers fail for improving fault tolerance. This helps user do not suffer from performance degradation. Functions of Routers Lookup Switching Queuing Performance: Functions of Router Router maintains routing table having: Address Prefix Next router Interface One copy of routing port is kept at an input port. Based on routing table, output port is selected at router. Packet passes through switching logic, which results to switching right port. Taken care, no pending packets are kept at output port. Incoming packets are queued into output port. Once port is free, it starts travelling to higher layers. To improve performance, three operations are needed, Lookup, Switching and Queuing. Lookup: Each incoming packet carry 32bit IP address which is to be matched with entries in routing table. Routing table contains only prefixes like 11*, 1010*, 100*, 10*... 11* and all others represent only those addresses starting with 11. Any address matching with 11* or 1010* will be forwarded to interface 1. Y addresses are truncated by prefixes instead of having complete addresses? Reduce Routing Table Size Limit the entries to Routing Table If we have , which matches with both 10* and 1010*, then which one should be selected? Rule: Consider longest match. i.e 1010 is selected. Sub: FON, bhargavigoswami@gmail.com Page 8

9 See next figure to understand special customer who reserves his own router with ISP. This helps u send data to anyone connected to you. This is called host-specific entry. Goal: to see how fast it can lookup the entries and find out corresponding destination interface considering longest match. Functions of a router: Lookup Address prefix Next router Interface.. 11* R * R1 1 10* R2 2 Why addresses should be truncated by prefixes? Router should divide the addresses in as many groups as the number of interfaces available. Easy management of the entries Address prefixes help in routing: Switching: Switching diverts the packet to output port connected to that interface. If router has n input and m output ports, router needs m x n interconnections, which is not possible. Solution? Crossbar Switches to avoid interconnections. High end routers use more connections, more hardware, so more speedy. This design plays major role in routing efficiency. Router architecture: Sub: FON, bhargavigoswami@gmail.com Page 9

10 Queuing: Worst Case: when all the input ports are sending data to single output port. Solution: Output port must be able to work as 100 pkt/sec to handle total load efficiently. When output port is less capable then input load, there is bound to pkts which cannot be forwarded as and when they arrive. Solution: Output port has buffers which act as a queue for incoming packets. Incoming ports are stored at buffer until the port becomes free. Eg: ICMP (Internet Control & Message Protocol) SNMP (Simple Network Management Protocol). A good routing algo is one which can help manage all these operations together in most optimistic way. An ideal algorithm is one which does not have any of lookup, queuing and switching. Robustness: Robustness: A good algorithm keeps running despite the nodes or links going down or coming up. Must converge in presence of large network to steady state. Must not oscillate from one route to another. See fig next; One of these two path has to be selected. i.e A K and C J. One of these two paths must be selected as best route. Now, moving to optimum path one packet starts from K and goes to A. But while moving forward, A observed that D no longer exist. Design: Use both, path while balancing load. There is no algorithm that performs load balancing. Now, Packet traverse : K I J C J being selected as shortest path. But, network being dynamic, packet changes its path k I A K. If this happens continuously, poor packet will only move back and forth and never get out of its current network. This design uses both, Path and load balancing. However, load balancing is still an issue. Sub: FON, bhargavigoswami@gmail.com Page 10

11 Unstable algorithms are not welcomed by network keeping best path priority less than stability. If it oscillates wildly, packets might take much longer time and may be not reached to destination. Robustness also depends on algo s behaviour in link or node failure. Connectionless model of internet is so efficient for vulnerable networks that despite network or link failure, packet forwarding does take place. Connectionless is considered fairly efficient. Robustness can be increased by taking into account new or recovered nodes despite failure. Periodically update their status and broadcasting the same to other nodes also avoid oscillation issues. Q. Issues in router s performance: A router must scale up to the size of the network attached to it Quality of service Delay delay tolerance bandwidth, particularly for real-time applications Fault tolerance High availability Q. Comparison of Virtual-Circuit and Datagram Subnets Q. Distance Vector Routing Algorithm: So far we have studied Static Routing Algorithms. But practically dynamic Routing Algorithms are used. Following two are Dynamic Routing Algorithms: 1. Distance Vector Routing Algorithm. 2. Link State Routing Algorithm. Distance Vector Routing Algorithm: At each step within a router: Sub: FON, bhargavigoswami@gmail.com Page 11

12 Get routing tables from neighbours Compute distance to neighbours Compute new routing table 1. Router transmits its distance vector to each of its neighbors. 2. Each router receives and saves the most recently received distance vector from each of its neighbors. 3. A router recalculates its distance vector when: a. It receives a distance vector from a neighbor containing different information than before. b. It discovers that a link to a neighbor has gone down (i.e., a topology change). The DV calculation is based on minimizing the cost to each destination. The distance vector routing algorithm is sometimes called by other names, the distributed Bellman- Ford routing algorithm and the Ford-Fulkerson algorithm. The subnet for routing and J is the sender: Partial Routing table for J: Network Next router Interface E G 1 A I 2 B I 2 X I 2 V G 1 W G 1 Q C Sub: FON, bhargavigoswami@gmail.com Page 12

13 Constructing routing tables Estimated delay from I: Network Next router Delay A D 2 B D 2 K K 1 O O 1 X P 2 U P 2 V P Constructing routing tables Estimated delay from G Network Next router Delay E E 1 A J 4 B E 4 X L 4 F F 1 H M 2 M M Constructing routing tables Estimated delay from C Network Next router Delay E E 1 A J 4 B E 4 X L 4 F F 1 H M 2 M M Chapter 7 : The Network Layer Sub: FON, bhargavigoswami@gmail.com Page 13

14 Constructing routing tables, another Example Constructing routing tables, another Example Estimated delay from B Estimated delay from D Network Next router Delay Network Next router Delay A A 3 A A 5 D D 6 B B 6 K A 10 K A 12 H D 8 H H 2 J D 12 J H 6 G D 11 G G 5 Constructing routing tables: constructing routing table from two of the neighbor s inputs E s Routing table Network Next router Delay A B 8 B B 5 D D 4 K B 15 H D 6 G D 9 J D 10 Drawback: Count to Infinity Problem: Drawback of Distance Vector Routing: Count to Infinity Problem: It reacts rapidly to good news, But, leisurely to bad news. Sub: FON, bhargavigoswami@gmail.com Page 14

15 Updates value fast when neighbor is down, but not when neighbor is again up. How? Lie to neighbour about distance if routing via neighbour The core of the problem is that when A tells B that it has a path to D, B has no way of knowing whether it itself(b) is on the path? This is how problem is created. It does not take bandwidth into account. Take too long to converge changes in one node to all other nodes. Solution? Split Horizon Hack. Lets see what it is. Count to infinity problem: E s routing table when D goes down: Network Next router Delay A B 8 B B 5 D B 9 K B 15 H B 13 G B 16 J B 17 Count to Infinity Problem, Another example: Count to infinity: C s and B s routing tables before D is down Network Next router Delay A B 4 B B 2 D D 2 Network Next router Delay A A 2 C C 2 D C 4 A s routing table and C s modified routing table when D is down Sub: FON, bhargavigoswami@gmail.com Page 15

16 How C s routing table is further modified: Chapter 7 : The Network Layer Solution by lying: SPLIT HORIZON HACK Rule: If B ask A, distance from A to D, and if B lies in the path, A should reply to B that A has path to D equal to infinite. This would avoid trapping of B into the loop of infinity. The best remedy is not to enter into Count to Infinity problem. This is called Split Horizon Hack. B s routing table Network Next router Delay A A 2 C C 2 D C infinity Q. Link State Routing Algorithm: Each router must do the following: 1. Discover its neighbors, learn their network address. 2. Measure the delay or cost to each of its neighbors. 3. Construct a packet telling all it has just learned. 4. Send this packet to all other routers. 5. Compute the shortest path to every other router. A complete topology is developed. Then Dijkstra s Algorithm can be used to compute the shortest path. Following 5 steps are followed to implement it. 1. Learning about the Neighbors 2. Measuring Line Cost. 3. Building Link State Packets. 4. Distributing the Link State Packets. 5. Computing the New Routes. Step1: Learning about the Neighbours: Upon boot of router, o Send HELLO packet on each point-to-point line o Routers are supposed to send reply with a globally unique name Step 2: Measuring the Line Cost: Measure round-trip delay using ECHO Packet and wait for its reply Take load into account? Yes. Arguments both ways: when choice is given to router having same number of hops from S to D. o Yes! preference for unloaded line as shortest path. o No! where oscillations are possible. Better Solution? Distribute Load over multiple lines. A subnet in which the East and West parts are connected by two lines: Sub: FON, bhargavigoswami@gmail.com Page 16

17 Step 3: Building Link State Packets: Packet containing: o Identity of sender o Sequence number + age o For each neighbour: o name + distance When to build the link state packets? o Periodically o when significant events occur See next figure. Step 4: Distributing Link State Packets: Distributing link state packets Trickiest part of algorithm Arrival time for packets different How to keep consistent routing tables? Basic algorithm Flooding + Sequence number (in each packet) to limit duplicates. Manageable problems Wrap around of sequence numbers results to wrong data. Solution? Use 32 bit sequence number. Wrong sequence number used in case of : lost in case of crash Corrupted data transmitted. Solution? include the age of each packet after the sequence number and decrement it once per second. When the age hits zero, the information from that router is discarded. duplicates are discarded Old packets are thrown out Sub: FON, bhargavigoswami@gmail.com Page 17

18 Step 5: Computing new routes: With a full set of link state packets, a router can: Construct the entire subnet graph Run Dijkstra s algorithm to compute the shortest path to each destination Problems for large subnets Memory to store data Compute time for developing these tables. Usage: IS-IS protocol (Intermediate System, Intermediate System) Designed for DECnet(digital equipment corporation network protocol suite), adopted by ISO(international standardization organization), used still in internet. Supports multiple network layer protocols OSPF(Open Shortest Path First) protocol used in Internet : Common features: Self-stabilizing method of flooding link state updates Concept of a designated router on a LAN Method of computing and supporting path splitting and multiple metrics. Useful in Multi Protocol Environment. Collecting Information from other routers and estimating the AS(Autonomous System) topology Finding neighbours and delay Sequence number and Age fields Routing table construction Header Node Delay E 5 D 6 A 3 Link state packets from all neighbours: From B From A From K Node Delay Node Delay Node Delay E 5 B 3 A 7 D 6 D 5 H 8 A 3 K 7 Sub: FON, bhargavigoswami@gmail.com Page 18

19 From D From G From H From J Node Delay Node Delay Node Delay Node Delay B 6 D 5 K 8 G 3 A 5 J 3 D 2 H 4 H 2 J 4 G 5 The graph constructed from all the packets: E s routing table: Network Next router Delay A B 8 B B 5 D D 4 K B 15 H D 6 G D 9 J D 10 The issue when LAN is a part Sub: FON, bhargavigoswami@gmail.com Page 19

20 Solution: depict LAN as a node Q. Optimality Principle Optimality Principle: states that if router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route. Set of optimal routes from all sources to a given destination form a tree rooted at the destination. Such a tree is called a sink tree. See next figure. Note that a sink tree is not necessarily unique; other trees with the same path lengths may exist. Since a sink tree is indeed a tree, it does not contain any loops, so each packet will be delivered within a finite and bounded number of hops. Optimality principle and the sink tree provide a benchmark against which other routing algorithms can be measured. The goal of all routing algorithms is to discover and use the sink trees for all routers. Sub: FON, bhargavigoswami@gmail.com Page 20

21 Q. Differentiate between LINK STATE and DISTANCE VECTOR Routing Algorithm: Sq.No. Link State Distance Vector 1 link states algorithm is an algorithm using global information 2 each node talks with all other nodes, but tell them only the cost of it's directly comparison of some of their attribute 3 Message complexity: With link state, every node has to keep the information about the cost of each link within the network. the distance vector algorithm is iterative, asynchronous, and distributed each node talks to only its directly connected neighbors, but provides its neighbor with least cost estimates from itself to all the nodes. Message complexity: with distance vector algorithm, message is exchanged between two hosts which are directly connected to each other. 4 Every times, if any of the link cost is changed, all the nodes are updated. 5 Speed of convergence: can converge faster in comparison of later. The change of cost in the link which belongs to the least cost path for one of the nodes, the DV algorithm will update the new value. But if the change doesn't belong to the least cost part between 2 hosts, there will no updating. Speed of convergence: can converge slowly and have routing loops while the algorithm is converging. 6 Such probability is less. DV algorithm also suffers from the count to infinity problem. 7 Robustness: For LS, when a router is down, it can broadcast a wrong cost for the closest one. LS node is computing for its own forwarding table and other node do the calculation for themselves. Better than DV. Robustness: DV, the wrong least cost path can be passed to more than one or all of the node so the wrong calculation will be process in the entire net work. This problem of DV is much worse than LS algorithm. Sub: FON, bhargavigoswami@gmail.com Page 21

22 Q. Explain characteristics of MANET routing. It is characterized with following prominent characteristics. o No special-purpose routers o No fixed topology o Best path assumptions are done independently. o Power requirements may be the issue. If A B C, and A is communicating to C through B, if power scarcity is observed in B, B may not forward packets from A to C. o Security issues exist in MANETs. Example of MANET is AODV protocol. Q. Explain AODV Protocol in details. AODV: Ad-hoc On-demand Distance Vector Routing Algorithm used with MANETs. More reactive and not pro-active routing algorithm. Is a Distance Vector variant. When nodes want to send data, it runs route discovery process. For the figure given below, see how the route discovery is made represented step by step from a) to e) Sub: FON, bhargavigoswami@gmail.com Page 22

23 Sub: FON, Page 23

24 Sub: FON, Page 24

25 Two main operations performed by AODV are: o Route Discovery o Route Maintenance Route Discovery Operation: AODV: Format of a Route-Request packet Source ID Request ID Destination ID Source sequence no. Destination sequence no. Hop count Timeto-Live Source ID: Source Address Destination ID: Destination Address Request ID: The request made is identified with this. Source and Destination Sq. No: Sequence number of Source and Destinations Hope Count: Intermediate nodes between the sender and receiver. Time To Live: Indicates the age field for the frame. If the node goes down before frame reaches the destination, may result to addition of network load. To avoid this, TTL field discards the packet once it reaches its limit. Route Maintenance: Issue here is, how to find, when the node left the network while moving. Suppose B in previous figure gets disconnected and D comes to know about that, then D must inform these two nodes. i.e G and H. They are known as active neighbors for a given destination. So, G and H upon receipt, both of them repeat the process for their active neighbours. See the D s Table for Routing. Route Maintenance: D s Current routing table Destination Next hop Distance Active neighbours B B 1 G, H E E 1 H A A 1 G K A 2 G, E H H 1 A G G 1 B J H 2 E AODV does not use power as one of the parameters to route, however its variants use this parameter. Sub: FON, bhargavigoswami@gmail.com Page 25

26 Q. What is flooding? Flooding algorithm: every incoming packet is sent out on every outgoing line except the one it arrived on. Flooding obviously generates vast numbers of duplicate packets, in fact, an infinite number unless some measures are taken to damp the process. One such measure is to have a hop counter contained in the header of each packet, which is decremented at each hop, with the packet being discarded when the counter reaches zero. An alternative technique for damming the flood is to keep track of which packets have been flooded, to avoid sending them out a second time. A variation of flooding that is slightly more practical is selective flooding. In this algorithm the routers do not send every incoming packet out on every line, only on those lines that are going approximately in the right direction. Applications of flooding algorithm: 1. military applications 2. distributed database applications 3. wireless networks 4. as a metric against which other routing algorithms can be compared Flooding always chooses the shortest path because it chooses every possible path in parallel. Q. Explain Border Gateway Protocol (BGP) in detail. Is an exterior protocol. Helps routing between different autonomous systems (AS). Here we also need to keep an eye on policies of different AS for routing as it works across the borders. Routing Policies: o When a packet has US army as sender, should not forward it through a path that touches Afghanistan. o Packet destined for an intelligent agency in India should not be forwarded to a path that passes through Pakistan. o Let all packets pass through my AS, but not Microsoft. (Sender is from Sun or IBM) o A telephone company willing to forward packets of its own customers and not others. o A service provider willing to forward packets of whoever pays for the services rendered. Categorization of AS: o First: Only 1 Connection to rest of network (like leaf node). In next figure C and F are first type. o Second: Non Leaf nodes in the network, not willing to provide service of forwarding packets to other nodes. In next figure, G and H. o Third: Non Leaf Nodes in the network that is willing to provide service of forwarding packets to other nodes. In next figure, D, A, B, E. Sub: FON, bhargavigoswami@gmail.com Page 26

27 Stub Network: There are nodes that contain single link to the network. This node cannot be used for traffic transit. Such a network is known as Stub Network. It s a customer s AS which is connected to Internet via single communication line to ISP. The biggest difference between BGP and DV protocols is the storage of routing information. Storage of BGP is much more than DV. Path Vector Routing: You might have two internet connections from Airtel and Reliance, so are connected to both, but you will not prefer to relay traffic between these two AS. BGP, instead of getting information about only next hop from all the information, it gets complete information of the entire path to B. This process is called path vector routing. No count to infinity: When router finds a path containing same node twice, it understands that the route contains loop and avoids that path. So no chance of count to infinity in BGP. Complexity: BGP is far more complex protocol than any other protocol. There are levels as well as hierarchy. Sometimes they have more than one connection to a single destination to enable load balancing and/ or fault tolerance. Impact of Business Relationship: Business relationships are based on contracts and when contracts are terminated or revised, the connections are removed or connection weights are revised. Why Not Link State Routing Algorithm here? o Sending information to 40,000 from single AS is a big task, can t be done by LS. o Requires extremely high bandwidth, can t be handled by LS. o Storing information will also consume lot of memory, which is not done by LS. BGP Operations: o Step 1: Router Discovery, Path and all the alternative path discovery. o Step 2: Computation of Shortest Route. Every AS is given unique ID. Eg. AT&T has 7018 and Reliance has See next figure, AS-4 has two different paths to AS-11 ( and ) and both of them contend for the best path. This is first stage in BGP process. Second stage includes comparison between two alternatives available. Following factors are consider for stage 2, i.e computing best alternative among all the path available. Load Preference: Eg. Heavily loaded path like the link though R&D department are avoided. Avoiding false alarms: Some route announcements seem suspicious or a mistake. Check the willingness to be intermediate nodes. If they are not willing to forward, avoid such intermediate nodes. Hot Potato: Suppose, the path takes longer but spends less time in AS, while another path is shorter but spends more time in AS. Second path is preferred as AS doesn t want to go through heavy traffic. Eg. See next figure. If we want to go from H to X, we can go with M-L-Q-P-X but we prefer going though M-L-G-E-C-K-X. Means, here, everybody is avoiding heavy traffic lines (hot potato in hands). That s why it is called Hot Potato. Sub: FON, bhargavigoswami@gmail.com Page 27

28 Sub: FON, Page 28

29 Interior Routing: When F sends data for X which traverse through as AS shown in next figure, the path looks like including four nodes, F-G-AS2-X, considering AS2 as a single node. It is not so. AS2 actually is a collection of routes and path from G to P also needs to be found out. For that part, interior protocols are used. Thus, entire routing process contains both, exterior as well as interior routing when a path passes through multiple Ass. After path selection, packet is forwarded. Currently only BGP is used as an exterior gateway protocol and there is no other contender. BGP is based on trust model, as an AS believes that other neighbors are sending. Malicious or careless route propagation can lead to serious consequences. Q. Write a note on Network Layer Switching. What is Multi-protocol Label Switching (MPLS)? Generally the steps followed by Router on receiving a packets are: o 1. Extract packet from frame. o 2. Look for destination address from extracted header part o 3. Determine the network it belongs to o 4. Finds out the neighbor nearest to that network o 5. Passes that packet to that neighboring router. Even though routers apply lots of smart tricks to avoid delays including working on different parts of the programs in parallel, it takes time. Solution? Use tagging where routers task is reduced. When connection is established, router knows bandwidth, delay tolerance, requirements of flow. Each packet of that flow is tagged. And this is how; packets are directly forwarded without any overhead over routers. Remember, do not misinterpret with Virtual Circuits. MPLS: Multi Protocol Labeled Switching MPLS is a mechanism of forwarding packets based on labels rather than IP address. It is basically a switching mechanism deployed over IP, where each packet is labeled. Advantages: o The original IP Header does not need to change. o Routing tables contain labels only which is simpler and faster to look up. Sub: FON, bhargavigoswami@gmail.com Page 29

30 o Tags are much easier to manage than the large number of IP address. o Different connections can be identified by their tags. o Network Layer IP becomes immaterial. (IP Header) o Router functions become independent of network layer protocol o It is possible to have multiple labels pasted on a packet, one over the other. This is important when hierarchy of networks is needed. o Forwarding process becomes faster as smaller labels are easier to index. o MPLS is usually designed to label the packets on the basis of not only Layer-3 (IP) but also Layer-4 (TCP or UDP) and sometimes Layer-5 (SMTP, FTP, HTTP) protocols. See the following example of hierarchical networking with ISP1, ISP-2, ISP-3 and ISP4. Packet at node Before entering the network D I P Q L M W After leaving the network Tags added to the packet Packet Packet, ISP-1 Tag Packet, ISP-1 Tag, ISP-2 Tag Packet, ISP-1 Tag, ISP-2 Tag Packet, ISP-1 Tag, ISP-3 Tag Packet, ISP-1 Tag, ISP-3 Tag, ISP-4 Tag Packet, ISP-1 Tag, ISP-3 Tag, ISP-4 Tag Packet, ISP-1 Tag Packet MPLS Enabled Routers: An MPLS enabled router understands the existence of MPLS tags and can route them accordingly. Let s see the frame format for the same. MPLS Frame Format: The MPLS header is attached above IP so, it doesn t alter content of IP header, nor depends on IP header content. MPLS header sits below PPP. So, MPLS is used with Ethernet. MPLS header is of 4 bytes, 32 bit long with largest part of Label field, 20 bits. 20 bits can have 2 to the power 20 (2 20 ) unique labels can be assigned. QOS field indicates quality of service needed by a specific packet. TTL stands for Time to Live. Sender initializes it which is decremented at every router it reaches. S field holds 1 when only one tag is used. And if tags are more than one, S field has 0. Sub: FON, bhargavigoswami@gmail.com Page 30

31 Only disadvantage is : Complex mechanism of MPLS router label assignment procedure. Q. Congestion: Means Traffic Jam. Incoming Pkt > Outgoing Pkt Result: Buffer frames at router If even more pkts, router is unable to handle, so, start DROPPING pkts. This is known as Congestion. Reason, Busty unpredictable traffic, slow processing router. Result, bottleneck links, buffers overrun, difficult to control the process, outgoing lines cannot hold the load over network, so fail to deliver. Congestion feeds itself, means, one router when gets congested, neighbouring routers will be congested soon. Y? being sharing the load of congested router. Also, retransmission is induced by pkt drops, inducing more congestion. Solution? Congestion Control Mechanism. Congestion Control: Explicit control Admission control Prevention of congested routes Implicit control RED Jitter Control Congestion Control: Methods deployed to combat congestion and reduce the effect of congestion are know as congestion control. Strategies: Detection Flexible, less control over network, less stability Based on feedback mechanism, ACK, Chock Packets Datagram Connectionless Wait for congestion to happen and then solve it Preventions need good design and control, more stability Virtual Circuits Sub: FON, bhargavigoswami@gmail.com Page 31

32 Connection Oriented Prevention measures are taken before congestion occurs. Feedback: Explicit or Implicit Explicit Feedback ECN: Explicit Congestion Notification field in TCP and IP header indicating congestion. Turned on indicating Possibility of Congestion ICMP: Internet Control Message Protocol Implicit Feedback Older TCP implementation had no field to indicate congestion. Retransmission, RTT and Dropping events indicate congestion. TCP is ideal case of adaptive congestion control. Network layer implement congestion control, bcoz, has hop to hop control. Transport layer does flow control, get direct feedback from receiver the data rate. But controlling of congestion is done better by network layer only. Network layer help recovering from congestion as it does routing and forwarding. IP does small congestion control. IP just sends packets and forgets. However, TCP monitor the communication and checks for delays and retransmission. UDP doesn t implement congestion control. Congestion Control Algorithms: Admission Control Prevention of Congested Routes Global Synchronization RED, Random Early Detection Jitter Control Admission Control: Prevention Type Algorithm: a) Sender request with bandwidth requirement and CPU time needed b) All other routers agree looking at current load c) If requirement can t be fulfilled, request is dropped by routers. Observed in Telephone networks Connection building takes time, but once connected, quality is maintained. It restricts user from connecting to network, so not used by internet. Internet uses Admission control for real time traffic. Applied at Application Layer in internet. Eg, CAC: Call Admission Control, used by VoIP traffic, prevents oversubscription, used with SIP. SIP: Session Initiation Protocol. Prevention of Congested Routers: Before establishing connection, selection of path determines the congested lines and avoid them during selection. No new connection establishment over the congested node. Better Solution than admission control Algorithm: Connection establishment reserves resources Once connection is established, sender send bandwidth, cpu time and store requirements Load balancing is checked and path is chosen Only drawback, adds overhead. Multiplexing can accommodate 3x calls. Sub: FON, bhargavigoswami@gmail.com Page 32

33 Used for VoIP and real time services RSVP: Resource Reservation Vector IGMP: Internet Group Management Protocol See next fig. Ignoring congested areas: Chapter 7 : The Network Layer Global Synchronization and Random Early Detection: If inflow continues, outgoing queue size increases beyond capacity and new packets need to be dropped. Drop has dramatic effect on TCP s performance. When 1 st drop is encountered, TCP reduces its speed to half of current speed. Eg: Suppose router before drop, was working at 2k x 10 = 20k. After drop, it becomes 0.5 x 10 = 5k. Means, ¼ th original speed remains. This is overkill. If no overkill for some time, speed increases gradually again. User experiences in TCP, sudden increased speed and sudden slumps due to congestion and drops. This is known as global synchronization. Problem? Yes. Solution? RED Random Early Detection(RED): Became Standard for TCP. It is the idea of discarding packets before all the buffer space is really exhausted. A popular algorithm for doing this is called RED (Random Early Detection) (Floyd and Jacobson, 1993). Response to lost packets is the source to slow down. Lost packets are mostly due to buffer overruns rather than transmission errors. The idea is that there is time for action to be taken before it is too late. To determine when to start discarding? For this, routers maintain a running average of their queue lengths. When the average queue length on some line exceeds a threshold, the line is said to be congested and action is taken. How should the router tell the source about the problem? One way is to send it a choke packet. Sub: FON, bhargavigoswami@gmail.com Page 33

34 Other option? Just discard the selected packet and don t report even. Source will eventually notice lack of Ack and takes action. Thus, slowing down instead of trying harder. Jitter Control: Rule: Pkt must not fall behind its predecessor, it should not jump ahead of its successor. Eg: in Video conferencing, its imp that different pkts are not delayed differently, otherwise picture quality deteriorates. Jitter: Variation in inter-packet intervals is known as Jitter and Jitter control is must for each multimedia application. Not much imp for Normal Data but, is must for Multimedia applications. Jitter Control: Two methods Service Type: IP field service type tells us the type of data, i.e real time or non real time data. Routers can t differentiate this difference of data types. Differentiated Service: Implemented in IP. Sets a number based on urgency of data delivery. But, all users think their data is urgent. So Differentiated Service Indicator decides type of service needed by packet. Jitter Control gives high priority to real time traffic then normal data. Queue position of such real time traffic is always ahead of normal data. Sub: FON, bhargavigoswami@gmail.com Page 34

35 University Questions List: 1. Discuss Link state Routing algorithm.[7] 2. Explain Count-to-Infinity problem in distance vector routing.[3] 3. Discuss optimality principal for routing algorithms at network layer.[3] 4. What is congestion? How is congestion controlled in virtual circuit network?[4] 5. Explain jitter control with reference to congestion control.[3] 6. Define: (i) Shortest path (ii) Flooding. 7. Differentiate between routing process and forwarding process.[2] 8. Differentiate between flow control and congestion control.[2] 9. Explain the working of hop by hop choke packet method for congestion control[2] 10. Explain the working of Dijkstra s shortest path algorithm with example.[4] 11. Admission control[2] 12. Compare how VC and Datagram subnets react to congestion[3] 13. Why Age field is required in LS?[2] 14. How RED prohibits global synchronization problem?[2] 15. Give example of the case where two different requirements routing algorithm cannot work well with each other.[2] 16. Show how DV and LS routing algorithms react to changes in the network like node or communication line going down or coming up.[3] 17. How AODV differs from DV?[2] 18. Why Hop by Hop Chock Packets algorithm provide faster relief to congested node than normal Chock Packets method?[2] 19. Give one difference which makes routing in Ad Hoc networks more difficult than conventional network.[2] Sub: FON, bhargavigoswami@gmail.com Page 35

CHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL

CHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL CHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL Dr. Bhargavi Goswami, Associate Professor head, Department of Computer Science, Garden City College Bangalore. PACKET SWITCHED NETWORKS Transfer blocks

More information

Chapter 22 Network Layer: Delivery, Forwarding, and Routing 22.1

Chapter 22 Network Layer: Delivery, Forwarding, and Routing 22.1 Chapter 22 Network Layer: Delivery, Forwarding, and Routing 22.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 22-3 UNICAST ROUTING PROTOCOLS 22.2 A routing

More information

II. Principles of Computer Communications Network and Transport Layer

II. Principles of Computer Communications Network and Transport Layer II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part

More information

Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.

Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr. Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.

More information

Routing, Routing Algorithms & Protocols

Routing, Routing Algorithms & Protocols Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a

More information

ICMP, ARP, RARP, IGMP

ICMP, ARP, RARP, IGMP Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols

More information

Telecommunication Protocols Laboratory Course. Lecture 3

Telecommunication Protocols Laboratory Course. Lecture 3 Telecommunication Protocols Laboratory Course Lecture 3 Course map Last time: we discussed protocols of the Medium Access Control (MAC) sub-layer Deal with broadcast channels and their (multi-party) protocols

More information

EEC-484/584 Computer Networks

EEC-484/584 Computer Networks EEC-484/584 Computer Networks Lecture 13 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of lecture 12 Routing Congestion

More information

Networking: Network layer

Networking: Network layer control Networking: Network layer Comp Sci 3600 Security Outline control 1 2 control 3 4 5 Network layer control Outline control 1 2 control 3 4 5 Network layer purpose: control Role of the network layer

More information

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost

More information

CSCE 463/612 Networks and Distributed Processing Spring 2018

CSCE 463/612 Networks and Distributed Processing Spring 2018 CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter

More information

Network Layer: Routing

Network Layer: Routing Network Layer: Routing The Problem A B R 1 R 2 R 4 R 3 Goal: for each destination, compute next hop 1 Lecture 9 2 Basic Assumptions Trivial solution: Flooding Dynamic environment: links and routers unreliable:

More information

ETSF05/ETSF10 Internet Protocols. Routing on the Internet

ETSF05/ETSF10 Internet Protocols. Routing on the Internet ETSF05/ETSF10 Internet Protocols Routing on the Internet Circuit switched routing ETSF05/ETSF10 - Internet Protocols 2 Routing in Packet Switching Networks Key design issue for (packet) switched networks

More information

1 Connectionless Routing

1 Connectionless Routing UCSD DEPARTMENT OF COMPUTER SCIENCE CS123a Computer Networking, IP Addressing and Neighbor Routing In these we quickly give an overview of IP addressing and Neighbor Routing. Routing consists of: IP addressing

More information

Chapter 5. The Network Layer. Network Layer Design Isues. Store-and-Forward Packet Switching 10/7/2010. Implementation of Connectionless Service

Chapter 5. The Network Layer. Network Layer Design Isues. Store-and-Forward Packet Switching 10/7/2010. Implementation of Connectionless Service Network Layer Design Isues Chapter 5 The Network Layer Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented

More information

Chapter 5. The Network Layer

Chapter 5. The Network Layer Chapter 5 The Network Layer 1 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented

More information

Chapter 5. The Network Layer. CEN Chapter 5 1

Chapter 5. The Network Layer. CEN Chapter 5 1 Chapter 5 The Network Layer CEN 445 - Chapter 5 1 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation

More information

ECE 333: Introduction to Communication Networks Fall 2001

ECE 333: Introduction to Communication Networks Fall 2001 ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed

More information

Chapter 24 Congestion Control and Quality of Service 24.1

Chapter 24 Congestion Control and Quality of Service 24.1 Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control

More information

What is the difference between unicast and multicast? (P# 114)

What is the difference between unicast and multicast? (P# 114) 1 FINAL TERM FALL2011 (eagle_eye) CS610 current final term subjective all solved data by eagle_eye MY paper of CS610 COPUTER NETWORKS There were 30 MCQs Question no. 31 (Marks2) Find the class in 00000001.001011.1001.111

More information

Routing. 4. Mar INF-3190: Switching and Routing

Routing. 4. Mar INF-3190: Switching and Routing Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines

More information

Chapter 6. The Network Layer

Chapter 6. The Network Layer Chapter 6 The Network Layer 1 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented

More information

CS 138: Communication I. CS 138 V 1 Copyright 2012 Thomas W. Doeppner. All rights reserved.

CS 138: Communication I. CS 138 V 1 Copyright 2012 Thomas W. Doeppner. All rights reserved. CS 138: Communication I CS 138 V 1 Copyright 2012 Thomas W. Doeppner. All rights reserved. Topics Network Metrics Layering Reliability Congestion Control Routing CS 138 V 2 Copyright 2012 Thomas W. Doeppner.

More information

ECE 435 Network Engineering Lecture 11

ECE 435 Network Engineering Lecture 11 ECE 435 Network Engineering Lecture 11 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 11 October 2018 Midterm on Tues Announcements 1 HW#4 Review maine.edu created? What is a

More information

Unit 3: Dynamic Routing

Unit 3: Dynamic Routing Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about

More information

ECE 435 Network Engineering Lecture 11

ECE 435 Network Engineering Lecture 11 ECE 435 Network Engineering Lecture 11 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 5 October 2017 Announcements Back from Memsys. Related things: fast memories for network

More information

Lecture 12. Introduction to IP Routing. Why introduction? Routing

Lecture 12. Introduction to IP Routing. Why introduction? Routing Lecture. Introduction to IP Routing Why introduction? Routing: very complex issue need in-depth study entire books on routing our scope: give a flavour of basic routing structure and messaging give an

More information

Routing Algorithms. CS158a Chris Pollett Apr 4, 2007.

Routing Algorithms. CS158a Chris Pollett Apr 4, 2007. Routing Algorithms CS158a Chris Pollett Apr 4, 2007. Outline Routing Algorithms Adaptive/non-adaptive algorithms The Optimality Principle Shortest Path Routing Flooding Distance Vector Routing Routing

More information

THE INTERNET PROTOCOL INTERFACES

THE INTERNET PROTOCOL INTERFACES THE INTERNET PROTOCOL The Internet Protocol Stefan D. Bruda Winter 2018 A (connectionless) network protocol Designed for use in interconnected systems of packet-switched computer communication networks

More information

ETSF05/ETSF10 Internet Protocols Routing on the Internet

ETSF05/ETSF10 Internet Protocols Routing on the Internet ETSF05/ETSF10 Internet Protocols Routing on the Internet 2014, (ETSF05 Part 2), Lecture 1.1 Jens Andersson Circuit switched routing 2014 11 05 ETSF05/ETSF10 Internet Protocols 2 Packet switched Routing

More information

Information Network Systems The network layer. Stephan Sigg

Information Network Systems The network layer. Stephan Sigg Information Network Systems The network layer Stephan Sigg Tokyo, November 1, 2012 Error-detection and correction Decoding of Reed-Muller codes Assume a second order (16, 11) code for m = 4. The r-th order

More information

The Internet Protocol

The Internet Protocol The Internet Protocol Stefan D. Bruda Winter 2018 THE INTERNET PROTOCOL A (connectionless) network layer protocol Designed for use in interconnected systems of packet-switched computer communication networks

More information

Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30

Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30 Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30 R1. Let s review some of the terminology used in this textbook. Recall that

More information

Basic Idea. Routing. Example. Routing by the Network

Basic Idea. Routing. Example. Routing by the Network Basic Idea Routing Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:

More information

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet Chapter 2 - Part 1 The TCP/IP Protocol: The Language of the Internet Protocols A protocol is a language or set of rules that two or more computers use to communicate 2 Protocol Analogy: Phone Call Parties

More information

Chapter 6. The Network Layer

Chapter 6. The Network Layer Chapter 6 The Network Layer 1 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented

More information

Routing by the Network

Routing by the Network Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:

More information

Routing Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of

Routing Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of Routing Protocols MITA DUTTA The routers in an internet are responsible for receiving and forwarding IP datagrams through the interconnected set of sub-networks from source to destination. Routing protocols

More information

IP - 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 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 information

Chapter 4 Network Layer. Network Layer 4-1

Chapter 4 Network Layer. Network Layer 4-1 Chapter 4 Network Layer Network Layer 4- Chapter 4: Network Layer 4. Introduction 4. Virtual circuit and datagram networks 4. What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing

More information

Routing. Advanced Computer Networks: Routing 1

Routing. Advanced Computer Networks: Routing 1 Routing Advanced Computer Networks: Routing 1 Gateway To internet or wide area network Metropolitan Area Network (MAN) s s Organization Servers Backbone R S R R Departmental Server s R S R s S R s s s

More information

EEC-684/584 Computer Networks

EEC-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 information

Network Layer Chapter 5

Network Layer Chapter 5 Design Issues Routing Algorithms Congestion Control Quality of Service Internetworking Network Layer Chapter 5 Network Layer of the Internet Revised: August 2011 and February 2018 The Network Layer Responsible

More information

(Refer Slide Time: 01:08 to 01:25min)

(Refer Slide Time: 01:08 to 01:25min) COMPUTER NETWORKS Prof. Sujoy Ghosh Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture-27 RIP- Distance Vector Routing We have seen basic routing. Now we will

More information

Network Protocols - Revision

Network Protocols - Revision Network Protocols - Revision Luke Anderson luke@lukeanderson.com.au 18 th May 2018 University Of Sydney Overview 1. The Layers 1.1 OSI Model 1.2 Layer 1: Physical 1.3 Layer 2: Data Link MAC Addresses 1.4

More information

Examination 2D1392 Protocols and Principles of the Internet 2G1305 Internetworking 2G1507 Kommunikationssystem, fk SOLUTIONS

Examination 2D1392 Protocols and Principles of the Internet 2G1305 Internetworking 2G1507 Kommunikationssystem, fk SOLUTIONS Examination 2D1392 Protocols and Principles of the Internet 2G1305 Internetworking 2G1507 Kommunikationssystem, fk Date: January 17 th 2006 at 14:00 18:00 SOLUTIONS 1. General (5p) a) Draw the layered

More information

Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting

Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting Outline Routing Fundamentals of Computer Networks Guevara Noubir Introduction Broadcasting and Multicasting Shortest Path Unicast Routing Link Weights and Stability F2003, CSG150 Fundamentals of Computer

More information

Lecture 4 - Network Layer. Transport Layer. Outline. Introduction. Notes. Notes. Notes. Notes. Networks and Security. Jacob Aae Mikkelsen

Lecture 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 information

Integrated Services. Integrated Services. RSVP Resource reservation Protocol. Expedited Forwarding. Assured Forwarding.

Integrated Services. Integrated Services. RSVP Resource reservation Protocol. Expedited Forwarding. Assured Forwarding. Integrated Services An architecture for streaming multimedia Aimed at both unicast and multicast applications An example of unicast: a single user streaming a video clip from a news site An example of

More information

Routing. Jens A Andersson Communication Systems

Routing. Jens A Andersson Communication Systems Routing Jens A Andersson Communication Systems R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 R5 10 Router A router is a type of internetworking device that passes data

More information

CSC 4900 Computer Networks: Routing Protocols

CSC 4900 Computer Networks: Routing Protocols CSC 4900 Computer Networks: Routing Protocols Professor Henry Carter Fall 2017 Last Time Link State (LS) versus Distance Vector (DV) algorithms: What are some of the differences? What is an AS? Why do

More information

CCNA Exploration Network Fundamentals. Chapter 06 Addressing the Network IPv4

CCNA 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 information

IP - The Internet Protocol

IP - The Internet Protocol IP - The Internet Protocol 1 Orientation IP s current version is Version 4 (IPv4). It is specified in RFC 891. TCP UDP Transport Layer ICMP IP IGMP Network Layer ARP Network Access Link Layer Media 2 IP:

More information

5.2 Routing Algorithms

5.2 Routing Algorithms CEN445 Network Protocols and Algorithms Chapter 5 Network Layer 5. Routing Algorithms Dr. Mostafa Hassan Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud

More information

===================================================================== Exercises =====================================================================

===================================================================== Exercises ===================================================================== ===================================================================== Exercises ===================================================================== 1 Chapter 1 1) Design and describe an application-level

More information

CS 43: Computer Networks. 24: Internet Routing November 19, 2018

CS 43: Computer Networks. 24: Internet Routing November 19, 2018 CS 43: Computer Networks 24: Internet Routing November 19, 2018 Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small

More information

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni 3/4/04 EN44 Network Protocols and lgorithms hapter Routing lgorithms Dr. Ridha Ouni Department of omputer Engineering ollege of omputer and Information Sciences King Saud University References Some slides

More information

Chapter 7: Routing Dynamically. Routing & Switching

Chapter 7: Routing Dynamically. Routing & Switching Chapter 7: Routing Dynamically Routing & Switching The Evolution of Dynamic Routing Protocols Dynamic routing protocols used in networks since the late 1980s Newer versions support the communication based

More information

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016 9/9/6 S 7 Networking and the Internet Fall 06 Shortest-Path Problem Given: network topology with link costs c(x,y): link cost from node x to node y Infinity if x and y are not direct neighbors ompute:

More information

Where we are in the Course

Where we are in the Course Network Layer Where we are in the Course Moving on up to the Network Layer! Application Transport Network Link Physical CSE 461 University of Washington 2 Network Layer How to connect different link layer

More information

CSCD 330 Network Programming Spring 2018

CSCD 330 Network Programming Spring 2018 CSCD 330 Network Programming Spring 018 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 017 1 Network

More information

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms Announcements CS 5565 Network Architecture and Protocols Lecture 20 Godmar Back Project 2B due in 2 parts: Apr 29 and May 6 Extra Credit Opportunities: Expand simulator (and your implementation) to introduce

More information

Routing in packet-switching networks

Routing in packet-switching networks Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call

More information

CSCD 330 Network Programming Spring 2017

CSCD 330 Network Programming Spring 2017 CSCD 330 Network Programming Spring 017 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-007

More information

ITEC310 Computer Networks II

ITEC310 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 information

Chapter 4: Network Layer, partb

Chapter 4: Network Layer, partb Chapter 4: Network Layer, partb The slides are adaptations of the slides available by the main textbook authors, Kurose&Ross Network Layer 4-1 Interplay between routing, forwarding routing algorithm local

More information

Inter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley

Inter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Inter-AS routing Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Some materials copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved Chapter 4:

More information

BLM6196 COMPUTER NETWORKS AND COMMUNICATION PROTOCOLS

BLM6196 COMPUTER NETWORKS AND COMMUNICATION PROTOCOLS BLM696 COMPUTER NETWORKS AND COMMUNICATION PROTOCOLS Prof. Dr. Hasan Hüseyin BALIK (7 th Week) 7. Routing 7.Outline Routing in Packet-Switching Networks Examples: Routing in ARPANET Internet Routing Protocols

More information

Administrivia CSC458 Lecture 4 Bridging LANs and IP. Last Time. This Time -- Switching (a.k.a. Bridging)

Administrivia CSC458 Lecture 4 Bridging LANs and IP. Last Time. This Time -- Switching (a.k.a. Bridging) Administrivia CSC458 Lecture 4 Bridging LANs and IP Homework: # 1 due today # 2 out today and due in two weeks Readings: Chapters 3 and 4 Project: # 2 due next week Tutorial today: Joe Lim on project 2

More information

Chapter 09 Network Protocols

Chapter 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 information

CS 5114 Network Programming Languages Control Plane. Nate Foster Cornell University Spring 2013

CS 5114 Network Programming Languages Control Plane. Nate Foster Cornell University Spring 2013 CS 5 Network Programming Languages Control Plane http://www.flickr.com/photos/rofi/0979/ Nate Foster Cornell University Spring 0 Based on lecture notes by Jennifer Rexford and Michael Freedman Announcements

More information

interface Question 1. a) Applications nslookup/dig Web Application DNS SMTP HTTP layer SIP Transport layer OSPF ICMP IP Network layer

interface Question 1. a) Applications  nslookup/dig Web Application DNS SMTP HTTP layer SIP Transport layer OSPF ICMP IP Network layer TDTS06 Computer networks, August 23, 2008 Sketched answers to the written examination, provided by Juha Takkinen, IDA, juhta@ida.liu.se. ( Sketched means that you, in addition to the below answers, need

More information

What Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control

What Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control Chapter 12 Congestion in Data Networks Effect of Congestion Control Ideal Performance Practical Performance Congestion Control Mechanisms Backpressure Choke Packet Implicit Congestion Signaling Explicit

More information

Routing Unicast routing protocols

Routing Unicast routing protocols Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type

More information

CS4450. Computer Networks: Architecture and Protocols. Lecture 13 THE Internet Protocol. Spring 2018 Rachit Agarwal

CS4450. Computer Networks: Architecture and Protocols. Lecture 13 THE Internet Protocol. Spring 2018 Rachit Agarwal CS4450 Computer Networks: Architecture and Protocols Lecture 13 THE Internet Protocol Spring 2018 Rachit Agarwal 2 Reflection The events in last few days have left me sad! Such events must be condemned

More information

Outline EEC-682/782 Computer Networks I. Midterm 1 Statistics. Midterm 1 Statistics. High 99, Low 34, Average 66

Outline EEC-682/782 Computer Networks I. Midterm 1 Statistics. Midterm 1 Statistics. High 99, Low 34, Average 66 Outline EEC-682/782 Computer Networks I Lecture 12 Wenbing Zhao w.zhao1@csuohio.edu http://academic.csuohio.edu/zhao_w/teaching/eec682.htm (Lecture nodes are based on materials supplied by Dr. Louise Moser

More information

Computer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS

Computer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,

More information

Prof. Shervin Shirmohammadi SITE, University of Ottawa. Internet Protocol (IP) Lecture 2: Prof. Shervin Shirmohammadi CEG

Prof. Shervin Shirmohammadi SITE, University of Ottawa. Internet Protocol (IP) Lecture 2: Prof. Shervin Shirmohammadi CEG Lecture 2: Internet Protocol (IP) Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4185 2-1 Network Layer Provides the upper layers with independence from the data

More information

Internetworking. different kinds of network technologies that can be interconnected by routers and other networking devices to create an internetwork

Internetworking. different kinds of network technologies that can be interconnected by routers and other networking devices to create an internetwork UNIT - II Internetworking An internetwork is a collection of individual networks, connected by intermediate networking devices, that functions as a single large network. different kinds of network technologies

More information

Routing Basics. What is Routing? Routing Components. Path Determination CHAPTER

Routing Basics. What is Routing? Routing Components. Path Determination CHAPTER CHAPTER 5 Routing Basics This chapter introduces the underlying concepts widely used in routing protocols Topics summarized here include routing protocol components and algorithms In addition, the role

More information

Guide to Networking Essentials, 6 th Edition. Chapter 5: Network Protocols

Guide to Networking Essentials, 6 th Edition. Chapter 5: Network Protocols Guide to Networking Essentials, 6 th Edition Chapter 5: Network Protocols Objectives Describe the purpose of a network protocol, the layers in the TCP/IP architecture, and the protocols in each TCP/IP

More information

Lecture (08, 09) Routing in Switched Networks

Lecture (08, 09) Routing in Switched Networks Agenda Lecture (08, 09) Routing in Switched Networks Dr. Ahmed ElShafee Routing protocols Fixed Flooding Random Adaptive ARPANET Routing Strategies ١ Dr. Ahmed ElShafee, ACU Fall 2011, Networks I ٢ Dr.

More information

What Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues

What Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues 168 430 Computer Networks Chapter 13 Congestion in Data Networks What Is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet handling capacity

More information

Data Communication & Networks G Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer

Data Communication & Networks G Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer Data Communication & Networks G22.2262-001 Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer Dr. Jean-Claude Franchitti New York University Computer Science

More information

The Interconnection Structure of. The Internet. EECC694 - Shaaban

The 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 information

Lecture 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 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 information

Lecture 19: Network Layer Routing in the Internet

Lecture 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 information

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class Computer Network Homework#3 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes

More information

CMSC 332 Computer Networks Network Layer

CMSC 332 Computer Networks Network Layer CMSC 332 Computer Networks Network Layer Professor Szajda CMSC 332: Computer Networks Where in the Stack... CMSC 332: Computer Network 2 Where in the Stack... Application CMSC 332: Computer Network 2 Where

More information

William Stallings Data and Computer Communications. Chapter 10 Packet Switching

William Stallings Data and Computer Communications. Chapter 10 Packet Switching William Stallings Data and Computer Communications Chapter 10 Packet Switching Principles Circuit switching designed for voice Resources dedicated to a particular call Much of the time a data connection

More information

CS118 Discussion Week 7. Taqi

CS118 Discussion Week 7. Taqi CS118 Discussion Week 7 Taqi Outline Hints for project 2 Lecture review: routing About Course Project 2 Please implement byte-stream reliable data transfer Cwnd is in unit of bytes, not packets How to

More information

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet Chapter 5: outline 5.1 introduction 5.5 The SDN control 5.2 routing protocols plane link state 5.6 ICMP: The Internet distance vector Control Message 5.3 intra-as routing in Protocol the Internet t 5.7

More information

Outline. Addressing on the network layer ICMP IPv6 Addressing on the link layer Virtual circuits

Outline. Addressing on the network layer ICMP IPv6 Addressing on the link layer Virtual circuits Lecture 2 Outline Addressing on the network layer ICMP IPv6 Addressing on the link layer Virtual circuits TCP/IP protocol suite Good name for our book! User application, e.g., http with Mozilla Communication

More information

Outline. Internet. Router. Network Model. Internet Protocol (IP) Design Principles

Outline. Internet. Router. Network Model. Internet Protocol (IP) Design Principles Outline Internet model Design principles Internet Protocol (IP) Transmission Control Protocol (TCP) Tze Sing Eugene Ng Department of Computer Science Carnegie Mellon University Tze Sing Eugene Ng eugeneng@cs.cmu.edu

More information

TCP/IP THE TCP/IP ARCHITECTURE

TCP/IP THE TCP/IP ARCHITECTURE TCP/IP-1 The Internet Protocol (IP) enables communications across a vast and heterogeneous collection of networks that are based on different technologies. Any host computer that is connected to the Internet

More information

Introduction to Internetworking

Introduction to Internetworking Introduction to Internetworking Stefano Vissicchio UCL Computer Science COMP0023 Internetworking Goal: Connect many networks together into one Internet. Any computer can send to any other computer on any

More information

Congestion in Data Networks. Congestion in Data Networks

Congestion in Data Networks. Congestion in Data Networks Congestion in Data Networks CS420/520 Axel Krings 1 Congestion in Data Networks What is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet

More information

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms Overview Chapter 13 TRANSPORT Motivation Simple analysis Various TCP mechanisms Distributed Computing Group Mobile Computing Winter 2005 / 2006 Distributed Computing Group MOBILE COMPUTING R. Wattenhofer

More information

Course Routing Classification Properties Routing Protocols 1/39

Course Routing Classification Properties Routing Protocols 1/39 Course 8 3. Routing Classification Properties Routing Protocols 1/39 Routing Algorithms Types Static versus dynamic Single-path versus multipath Flat versus hierarchical Host-intelligent versus router-intelligent

More information

THE INTERNET PROTOCOL/1

THE INTERNET PROTOCOL/1 THE INTERNET PROTOCOL a (connectionless) network layer protocol designed for use in interconnected systems of packet-switched computer communication networks (store-and-forward paradigm) provides for transmitting

More information