DOCSLIB.ORG

Routing: Network Layer Part II Logical View of a Router

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Routing: Network Layer Part II Logical View of a Router Routing & Forwarding: Routing: Network Layer Part II Logical View of a Router • Routing Algorithms: 5 – Link state vs. Distance Vector B 3 C • Routing in the Internet 2 5 A 2 – Intra-AS vs. Inter-AS routing 3 1 F 1 2 – Intra-AS: RIP and OSPF D E 1 – Inter-AS: BGP and Policy Routing •MPLS Readings: Textbook: Chapter 4: Sections 4.2-4.3, 4.5-4.6 Csci 232 – Computer Networks Routing and Network Layer Part II 1 Csci 232 – Computer Networks Routing and Network Layer Part II 2 IP Forwarding Process IP Forwarding Table 1. Remove a packet 2. Check for sanity, 4. Place packet on from an input decrement TTL correct output queue field queue Destination Next Hop Interface Net A Router 1 INT 7 Net B Direct INT 4 Forwarding Process NCH3Net C, Host 3 R2Router 2 INT 3 Net C Router 1 INT 7 3. Match packet’s If queues If queues destination to get full, just get full, just a table entry drop packets! drop packets! A destination is usually The next hop is either a a network. May also be directly connected network A physical interface IP Forwarding Table a host, or a “gateway or a router on a directly of last resort” (default) Router connected network Csci 232 – Computer Networks 3 Csci 232 – Computer Networks 4 How Are Forwarding Tables Populated to Implement Routing? Dynamic Routing: Intra- vs. Inter-AS Statically Dynamically Administrator Routers exchange network reachability OSPF manually configures information using ROUTING PROTOCOLS. forwarding table entries Routers use this to compute best routes + Can rapidly adapt to changes BGP + More control AS 1 itktlin network topology + Not restricted to IGP = Interior Gateway Protocol + Can be made to scale well destination-based - Complex distributed algorithms forwarding Metric based: OSPF, IS-IS, RIP, - Consume CPU, Bandwidth, Memory - Doesn’t scale EIGRP (cisco) EIGRP - Debugging can be difficult - Slow to adapt to - Current protocols are destination-based EGP = Exterior Gateway Protocol AS 2 network failures Policy based: BGP In practice : a mix of these. Static routing mostly at the “edge” The Routing Domain of BGP is the entire Internet Csci 232 – Computer Networks 5 Csci 232 – Computer Networks Routing and Network Layer Part II 6 1 Internet AS Hierarchy Intra-AS vs. Inter-AS Routing border (exterior gateway) routers Inter-AS C.b routing between B.a A.a A and B Host b A.c c h2 a a C b a B Host d Intra-AS routing h1 c A b within AS B Intra-AS routing within AS A interior routers Csci 232 – Computer Networks Routing and Network Layer Part II 7 Csci 232 – Computer Networks Routing and Network Layer Part II 8 Intra-AS and Inter-AS Routing Where Does Forwarding Table Come From? C.b RIP Process BGP Process B.a “Gateways”: •perform inter- A.a RIP Routing tables BGP Routing tables AS routing b c a A.c a amongst C b BGP a B themselves OSPF Process •perform intra- d c A b AS routing with OSPF Routing tables other routers in their AS network layer inter-AS, intra-AS link layer RIP routing in Domain OSPF Forwarding Table Manager gateway A.c physical layer Domain Forwarding Table Csci 232 – Computer Networks Routing and Network Layer Part II 9 Csci 232 – Computer Networks 10 Routing Basic Routing Problem • Goal: determine a “good” path through • Assume the network from source to destination – A network with N nodes, where each – Good means usually the shortest path edge is associated a cost –A node knows only its neighbors and the • Network modeled as a graph 5 cost to reach them –Routers nodes 3 • How does each node learn how B C –Link edges 2 5 5 • Edge cost: delay, congestion level,… to reach every other node A 2 1 F 3 3 B C along the shortest path? 5 1 2 2 D E 1 A 2 1 F 3 1 2 D E 1 Csci 232 – Computer Networks Routing and Network Layer Part II 11 Csci 232 – Computer Networks Routing and Network Layer Part II 12 2 Routing: Issues Routing Paradigms •Hop-by-hop Routing • How are routing tables determined? – Each packet contains destination address • Who determines table entries? – Each router chooses next-hop to destination • routing decision made at each (intermediate) hop! • What info is used in determining table • packets to same destination may take different paths! entries? – Example: IP’s default datagram routing •Source Routing • When do routing table entries change? – Sender selects the path to destination precisely • Where is routing info stored? – Routers forward packet to next-hop as specified • Problem: if specified path no longer valid due to link failure! • How to control routing table size? –Example: • IP’s loose/strict source route option Answer these questions, we are done! • virtual circuit setup phase in ATM (or MPLS) Csci 232 – Computer Networks Routing and Network Layer Part II 13 Csci 232 – Computer Networks Routing and Network Layer Part II 14 Routing Algorithms/Protocols Centralized vs. Distributed Routing Algorithms Issues Need to Be Addressed: • Route selection may depend on different criteria Centralized: – Performance: choose route with the smallest delay • A centralized route server collects routing information and – Policy: choose a route that doesn’t cross .gov network network topology, makes route selection decisions, then distributes them to routers • Adapt to changes in network topology or condition Distributed: – Self-healing: little or no human intervention •Routers cooperate using a distributed protocol • Scalability –to create mutually consistent routing tables – Must be able to support a large number of hosts, routers •Two standard distributed routing algorithms – Link State (LS) routing – Distance Vector (DV) routing Csci 232 – Computer Networks Routing and Network Layer Part II 15 Csci 232 – Computer Networks Routing and Network Layer Part II 16 Link State vs Distance Vector Link State Algorithm • Both assume that • Basic idea: Distribute link state packet to – The address of each neighbor is known –The cost of reaching each neighbor is known all routers •Both find global information – Topology of the network • Cost of each link in the network – By exchanging routing info among neighbors • Each router independently computes • Differ in the information exchanged and optimal paths route computation – From itself to every destination – LS: tells every other node its distances to neighbors – Routes are guaranteed to be loop free if – DV: tells neighbors its distance to every other node • Each router sees the same cost for each link • Uses the same algorithm to compute the best path Csci 232 – Computer Networks Routing and Network Layer Part II 17 Csci 232 – Computer Networks Routing and Network Layer Part II 18 3 Link State: Control Traffic Link State: Node State • Each node floods its local information to every other node in the network C C • Each node ends up knowing the entire network A A D Host C C D topology use Dijkstra to compute the shortest A D path to every other node Host A Host D B B E E Host C B E Host A Host D N2 N1 C A D N1 N2 N3 C A D B N3 E C N5 A D N5 B C E A D Host B B Host B N4 Host E N4 Host E B E N6 N7 N6 N7 Csci 232 – Computer Networks Routing and Network Layer Part II 19 Csci 232 – Computer Networks Routing and Network Layer Part II 20 Topology Dissemination Topology Database: Example • Each router creates a set of link state 5 packets (LSPs) 3 – Describing its links to neighbors B C 5 – LSP contains 2 • Router id, neighbor’s id, and cost to its neighbor A 2 1 F 3 • Copies of LSPs are distributed to all 1 2 routers D E 1 –Using controlled flooding • Each router maintains a topology database link state database – Database containing all LSPs Csci 232 – Computer Networks Routing and Network Layer Part II 21 Csci 232 – Computer Networks Routing and Network Layer Part II 22 Constructing Routing Table: Algorithm (at Node X) Dijkstra’s Algorithm • Given the network topology • Initialization – How to compute the shortest path to each destination? –N = {X} • Some notation – For all nodes V • If V adjacent to X, D(V) = C(X,V) else D(V) = – X: source node – N: set of nodes to which shortest paths are known so far • Loop • N is initially empty –Find U not in N such that D(U) is the smallest – D(V): the cost of the known shortest path from source X – Add U into set N to V – Update D(V) for all V not in N – C(U,V): cost of link U to V •D(V) = min{D(V), D(U) + C(U,V)} • C(U,V) = if not neighbors – Until all nodes in N Csci 232 – Computer Networks Routing and Network Layer Part II 23 Csci 232 – Computer Networks Routing and Network Layer Part II 24 4 Example: Dijkstra’s Algorithm Example: Dijkstra’s Algorithm Step start N D(B),p(B) D(C),p(C) D(D),p(D) D(E),p(E) D(F),p(F) Step start N D(B),p(B) D(C),p(C) D(D),p(D) D(E),p(E) D(F),p(F) 0 A 2,A 5,A 1,A 0 A 2,A 5,A 1,A 1 1 AD 4,D 2,D 2 2 3 3 4 4 5 5 … 5 1 Initialization: 5 2 N = {A}; 8 Loop 9 find w not in N s.t. D(w) is a minimum; B 3 C 3 for all nodes v B 3 C 2 5 2 5 10 add w to N; 4 if v adjacent to A 11 update D(v) for all v adjacent A 2 1 F A 2 1 F 3 5 then D(v) = c(A,v); 3 to w and not in N: 1 2 6 else D(v) = ; 1 2 12 D(v) = min( D(v), D(w) + c(w,v) ); D E D E 1 … 1 13 until all nodes in N; Csci 232 – Computer Networks Routing and Network Layer Part II 25 Csci 232 – Computer Networks Routing and Network Layer Part II 26 Example: Dijkstra’s Algorithm Example: Dijkstra’s Algorithm Step start N D(B),p(B) D(C),p(C) D(D),p(D) D(E),p(E) D(F),p(F) Step start N D(B),p(B) D(C),p(C) D(D),p(D) D(E),p(E) D(F),p(F) 0 A 2,A 5,A 1,A 0 A 2,A 5,A 1,A 1 AD 4,D 2,D 1 AD 4,D 2,D 2 ADE 3,E 4,E 2 ADE 3,E 4,E 3 3 ADEB 4 4 5 5 … … 5 8 Loop 5 8 Loop 9 find w not in N s.t.
Load more

Recommended publications
  • Chapter 6: Chapter 6: Implementing a Border Gateway Protocol Solution Y
    Chapter 6: Implementing a Border Gateway Protocol Solution for ISP Connectivity CCNP ROUTE: Implementing IP Routing ROUTE v6 Chapter 6 © 2007 – 2010, Cisco Systems, Inc. All rights reserved. Cisco Public 1 Chapter 6 Objectives . Describe basic BGP terminology and operation, including EBGP and IBGP. ( 3) . Configure basic BGP. (87) . Typical Issues with IBGP and EBGP (104) . Verify and troubleshoot basic BGP. (131) . Describe and configure various methods for manipulating path selection. (145) . Describe and configure various methods of filtering BGP routing updates. (191) Chapter 6 © 2007 – 2010, Cisco Systems, Inc. All rights reserved. Cisco Public 2 BGP Terminology, Concepts, and Operation Chapter 6 © 2007 – 2010, Cisco Systems, Inc. All rights reserved. Cisco Public 3 IGP versus EGP . Interior gateway protocol (IGP) • A routing protocol operating within an Autonomous System (AS). • RIP, OSPF, and EIGRP are IGPs. Exterior gateway protocol (EGP) • A routing protocol operating between different AS. • BGP is an interdomain routing protocol (IDRP) and is an EGP. Chapter 6 © 2007 – 2010, Cisco Systems, Inc. All rights reserved. Cisco Public 4 Autonomous Systems (AS) . An AS is a group of routers that share similar routing policies and operate within a single administrative domain. An AS typically belongs to one organization. • A singgpgyp()yle or multiple interior gateway protocols (IGP) may be used within the AS. • In either case, the outside world views the entire AS as a single entity. If an AS connects to the public Internet using an exterior gateway protocol such as BGP, then it must be assigned a unique AS number which is managed by the Internet Assigned Numbers Authority (IANA).
    [Show full text]
  • Understanding Linux Internetworking
    White Paper by David Davis, ActualTech Media Understanding Linux Internetworking In this Paper Introduction Layer 2 vs. Layer 3 Internetworking................ 2 The Internet: the largest internetwork ever created. In fact, the Layer 2 Internetworking on term Internet (with a capital I) is just a shortened version of the Linux Systems ............................................... 3 term internetwork, which means multiple networks connected Bridging ......................................................... 3 together. Most companies create some form of internetwork when they connect their local-area network (LAN) to a wide area Spanning Tree ............................................... 4 network (WAN). For IP packets to be delivered from one Layer 3 Internetworking View on network to another network, IP routing is used — typically in Linux Systems ............................................... 5 conjunction with dynamic routing protocols such as OSPF or BGP. You c an e as i l y use Linux as an internetworking device and Neighbor Table .............................................. 5 connect hosts together on local networks and connect local IP Routing ..................................................... 6 networks together and to the Internet. Virtual LANs (VLANs) ..................................... 7 Here’s what you’ll learn in this paper: Overlay Networks with VXLAN ....................... 9 • The differences between layer 2 and layer 3 internetworking In Summary ................................................. 10 • How to configure IP routing and bridging in Linux Appendix A: The Basics of TCP/IP Addresses ....................................... 11 • How to configure advanced Linux internetworking, such as VLANs, VXLAN, and network packet filtering Appendix B: The OSI Model......................... 12 To create an internetwork, you need to understand layer 2 and layer 3 internetworking, MAC addresses, bridging, routing, ACLs, VLANs, and VXLAN. We’ve got a lot to cover, so let’s get started! Understanding Linux Internetworking 1 Layer 2 vs.
    [Show full text]
  • Overview of Routing Security Landscape for the Quilt Member Meeting, Winter 2019 Mark Beadles, CISO, Oarnet [email protected] BGP IDLE
    Overview of Routing Security Landscape for the Quilt Member Meeting, Winter 2019 Mark Beadles, CISO, OARnet [email protected] BGP IDLE CONNECT ACTIVE OPEN OPEN SENT CONFIRM ESTAB- LISHED 2/13/2019 Routing Security Landscape - The Quilt 2 Overview of Routing Security Landscape • Background • Threat environment • Current best practices • Gaps 2/13/2019 Routing Security Landscape - The Quilt 3 Background - Definitions • BGP • Border Gateway Protocol, an exterior path-vector gateway routing protocol • Autonomous System & Autonomous System Numbers • Collection of IP routing prefixes under control of a network operator on behalf of a single administrative domain that presents a defined routing policy to the Internet • Assigned number for each AS e.g. AS600 2/13/2019 Routing Security Landscape - The Quilt 4 Background - The BGP Security Problem By design, routers running BGP accept advertised routes from other BGP routers by default. (BGP was written under the assumption that no one would lie about the routes, so there’s no process for verifying the published announcements.) This allows for automatic and decentralized routing of traffic across the Internet, but it also leaves the Internet potentially vulnerable to accidental or malicious disruption, known as BGP hijacking. Due to the extent to which BGP is embedded in the core systems of the Internet, and the number of different networks operated by many different organizations which collectively make up the Internet, correcting this vulnerabilityis a technically and economically challenging problem. 2/13/2019 Routing Security Landscape - The Quilt 5 Background – BGP Terminology • Bogons • Objects (addresses/prefixes/ASNs) that don't belong on the internet • Spoofing • Lying about your address.
    [Show full text]
  • Chapter 12, “Configuring Layer 3 Interfaces”
    CHAPTER 12 Configuring Layer 3 Interfaces This chapter contains information about how to configure Layer 3 interfaces on the Catalyst 6500 series switches, which supplements the information and procedures in the Release 12.1 publications at this URL: http://www.cisco.com/univercd/cc/td/doc/product/software/ios121/121cgcr/index.htm This chapter consists of these sections: • Configuring IP Routing and Addresses, page 12-2 • Configuring IPX Routing and Network Numbers, page 12-6 • Configuring AppleTalk Routing, Cable Ranges, and Zones, page 12-7 • Configuring Other Protocols on Layer 3 Interfaces, page 12-8 Catalyst 6500 Series Switch Cisco IOS Software Configuration Guide—Release 12.1 E 78-14099-04 12-1 Chapter 12 Configuring Layer 3 Interfaces Configuring IP Routing and Addresses Note • For complete syntax and usage information for the commands used in this chapter, refer to the Catalyst 6500 Series Switch Cisco IOS Command Reference publication and the Release 12.1 publications at this URL: http://www.cisco.com/univercd/cc/td/doc/product/software/ios121/121cgcr/index.htm • Release 12.1(13)E and later releases support configuration of 4,096 Layer 3 VLAN interfaces. – We recommend that you configure a combined total of no more than 2,000 Layer 3 VLAN interfaces and Layer 3 ports on an MSFC2 with either Supervisor Engine 1 or Supervisor Engine 2. – We recommend that you configure a combined total of no more than 1,000 Layer 3 VLAN interfaces and Layer 3 ports on an MSFC. • With releases earlier than Release 12.1(13)E, an MSFC2 with either Supervisor Engine 1 or Supervisor Engine 2 supports a combined maximum of 1,000 Layer 3 VLAN interfaces and Layer 3 ports.
    [Show full text]
  • TCP/IP Protocol Suite
    TCP/IP Protocol Suite Marshal Miller Chris Chase Robert W. Taylor (Director of Information Processing Techniques Office at ARPA 1965-1969) "For each of these three terminals, I had three different sets of user commands. So if I was talking online with someone at S.D.C. and I wanted to talk to someone I knew at Berkeley or M.I.T. about this, I had to get up from the S.D.C. terminal, go over and log into the other terminal and get in touch with them. I said, oh, man, it's obvious what to do: If you have these three terminals, there ought to be one terminal that goes anywhere you want to go where you have interactive computing. That idea is the ARPANET." – New York Times Interview: December 20, 1999 Overview • Terminology • History • Technical Details: – TCP – IP – Related Protocols • Physical Media • Social Implications • Economic Impact 3 Terminology • Protocol – A set of rules outlining the format to be used for communication between systems • Domain Name System (DNS) – Converts an Internet domain into an IP address • Router – A computer or software package used in packet switched networks to look at the source and destination addresses, and decide where to send the packets • Uniform Resource Indicators – Uniform Resource Location (URL) • How to find the resource: HTTP, FTP, Telnet – Uniform Resource Names (URN) • What the resource is: Not as common as URL 4 History: Pre-TCP/IP • Networks existed and information could be transferred within • Because of differences in network implementation communication between networks different for each application • Need for unification in protocols connecting networks 5 History: TCP/IP Development • 1968: Plans develop for using Interface Message Processors (IMPs) • Dec.
    [Show full text]
  • Introduction to the Border Gateway Protocol – Case Study Using GNS3
    Introduction to The Border Gateway Protocol – Case Study using GNS3 Sreenivasan Narasimhan1, Haniph Latchman2 Department of Electrical and Computer Engineering University of Florida, Gainesville, USA [email protected], [email protected] Abstract – As the internet evolves to become a vital resource for many organizations, configuring The Border Gateway protocol (BGP) as an exterior gateway protocol in order to connect to the Internet Service Providers (ISP) is crucial. The BGP system exchanges network reachability information with other BGP peers from which Autonomous System-level policy decisions can be made. Hence, BGP can also be described as Inter-Domain Routing (Inter-Autonomous System) Protocol. It guarantees loop-free exchange of information between BGP peers. Enterprises need to connect to two or more ISPs in order to provide redundancy as well as to improve efficiency. This is called Multihoming and is an important feature provided by BGP. In this way, organizations do not have to be constrained by the routing policy decisions of a particular ISP. BGP, unlike many of the other routing protocols is not used to learn about routes but to provide greater flow control between competitive Autonomous Systems. In this paper, we present a study on BGP, use a network simulator to configure BGP and implement its route-manipulation techniques. Index Terms – Border Gateway Protocol (BGP), Internet Service Provider (ISP), Autonomous System, Multihoming, GNS3. 1. INTRODUCTION Figure 1. Internet using BGP [2]. Routing protocols are broadly classified into two types – Link State In the figure, AS 65500 learns about the route 172.18.0.0/16 through routing (LSR) protocol and Distance Vector (DV) routing protocol.
    [Show full text]
  • Lab 2.8.1: Basic Static Route Configuration
    Lab 2.8.1: Basic Static Route Configuration Topology Diagram Addressing Table Device Interface IP Address Subnet Mask Default Gateway Fa0/0 172.16.3.1 255.255.255.0 N/A R1 S0/0/0 172.16.2.1 255.255.255.0 N/A Fa0/0 172.16.1.1 255.255.255.0 N/A R2 S0/0/0 172.16.2.2 255.255.255.0 N/A S0/0/1 192.168.1.2 255.255.255.0 N/A FA0/0 192.168.2.1 255.255.255.0 N/A R3 S0/0/1 192.168.1.1 255.255.255.0 N/A PC1 NIC 172.16.3.10 255.255.255.0 172.16.3.1 PC2 NIC 172.16.1.10 255.255.255.0 172.16.1.1 PC3 NIC 192.168.2.10 255.255.255.0 192.168.2.1 Learning Objectives Upon completion of this lab, you will be able to: • Cable a network according to the Topology Diagram. • Erase the startup configuration and reload a router to the default state. • Perform basic configuration tasks on a router. All contents are Copyright © 1992–2007 Cisco Systems, Inc. All rights reserved. This document is Cisco Public Information. Page 1 of 20 CCNA Exploration Routing Protocols and Concepts: Static Routing Lab 2.8.1: Basic Static Route Configuration • Interpret debug ip routing output. • Configure and activate Serial and Ethernet interfaces. • Test connectivity. • Gather information to discover causes for lack of connectivity between devices. • Configure a static route using an intermediate address.
    [Show full text]
  • IP Routing & Protocols
    Lecture 11: IP routing, IP protocols Contents n Routing principles n Local datagram delivery n ICMP Protocol n UDP Protocol n TCP/IP Protocol n Assuring requirements for streaming TPC n Building and terminating TCP connection n API for network services (brief info on sockets) AE4B33OSS Lecture 11 / Page 2 Silberschatz, Galvin and Gagne ©2005 Datagram routing (1) n Routing is a decision making process on where to forward the datagram (or its fragment). l Any device making such decision is called router l Routing can be direct or indirect Direct routing occurs when the destination host is a part of the LAN directly connected to the router so that the datagram can be delivered directly to the destination. All other cases represent indirect routing l Routers in the Internet form a cooperative interconnected structure. Datagrams pass from router to router until they reach a router capable to deliver directly (locally) to the destination l Table driven routing Every router maintains a routing table with entries in the form of pairs (N, G), where N is netid of the destination network and G is the IP address of the ªnext routerº along the path to the destination network N. The ªnext routerº must be reachable directly so that the datagram can be forwarded there without further routing AE4B33OSS Lecture 11 / Page 3 Silberschatz, Galvin and Gagne ©2005 Datagram routing (2) 20.0.0.5 30.0.0.6 40.0.0.7 Network Network Network Network 10.0.0.0 F 20.0.0.0 G 30.0.0.0 H 40.0.0.0 10.0.0.5 20.0.0.6 30.0.0.7 Destination is on the net Forward datagram to 20.0.0.0 Deliver directly 30.0.0.0 Deliver directly 10.0.0.0 20.0.0.5 40.0.0.0 30.0.0.7 Routing table of G n Default routes l Often LAN's are connected to the ªrest of worldº through a single router.
    [Show full text]
  • REDDIG II – Computer Networking Training
    REDDIG II – Computer Networking Training JM SANCHEZ / PH RASSAT - 20/06/2012 IP Addressing and Subnetting Invierno 2011 | Capacitacion en fabrica - CORPAC IP Addressing and Subnetting IP Addresses An IP address is an address used to uniquely identify a device on an IP network. The address is made up of 32 binary bits which can be divisible into a network portion and host portion with the help of a subnet mask. 32 binary bits are broken into four octets (1 octet = 8 bits) Dotted decimal format (for example, 172.16.254.1) REDDIG II | Network Course | Module 2 | 3 IP Addressing and Subnetting Binary and Decimal Conversion REDDIG II | Network Course | Module 2 | 4 IP Addressing and Subnetting IP Address Classes • IP classes are used to assist in assigning IP addresses to networks with different size requirements. • Classful addressing: REDDIG II | Network Course | Module 2 | 5 IP Addressing and Subnetting Private Address Range • Private IP addresses provide an entirely separate set of addresses that still allow access on a network but without taking up a public IP address space. • Private addresses are not allowed to be routed out to the Internet, so devices using private addresses cannot communicate directly with devices on the Internet. REDDIG II | Network Course | Module 2 | 6 IP Addressing and Subnetting Network Masks • Distinguishes which portion of the address identifies the network and which portion of the address identifies the node. • Default masks: Class A: 255.0.0.0 Class B: 255.255.0.0 Class C: 255.255.255.0 • Once you have the address and the mask represented in binary, then identification of the network and host ID is easier.
    [Show full text]
  • IP Routing and Mobility
    IP Routing and Mobility Cristina Hristea and Fouad Tobagi Stanford University {christea,tobagi}@Stanford.edu Abstract. The original design of the Internet and its underlying protocols did not anticipate users to be mobile. With the growing interest in supporting mobile users and mobile computing, a great deal of work is taking place to solve this problem. For a solution to be practical, it has to integrate easily with existing Internet infrastructure and protocols, and offer an adequate migration path toward what might represent the ultimate solution. In that respect, the solution has to be incrementally scalable to handle a large number of mobile users and wide geographical scopes, and well performing so as to support all application requirements including voice and video communications and a wide range of mobility speeds. In this paper, we present a survey of the state-of-the- art and propose a multi-layer architecture for mobility in IP networks. In particular, we propose the use of extended local area networks and protocols for efficient and scalable mobility support in the Internet. 1 Introduction In the broadest sense, the term mobile networking refers to a system that allows users to maintain network connectivity while moving from one location to another. Mobility is often associated with wireless technologies that require mobile networks to support continuous movement, at high speeds and for long periods of time. Recently, there has been an explosive growth in wireless devices with built in access to the Internet. In the near future, large numbers of mobile users will access the Internet for a variety of high-speed multimedia services.
    [Show full text]
  • BGP: Border Gateway Protocol an Interdomain Routing Protocol
    LAB 8 BGP: Border Gateway Protocol An Interdomain Routing Protocol OBJECTIVES The objective of this lab is to simulate and study the basic features of an interdomain routing protocol called Border Gateway Protocol (BGP). OVERVIEW The Internet is organized as a set of routing domains. Each routing domain is called an autonomous system (AS). Each AS is controlled by a single administrative entity (e.g., an AS of 75 a single service provider). Each AS has a unique 16-bit identifi cation number. This number is assigned by a central authority. An AS uses its own intradomain routing protocol (e.g., RIP or OSPF). An AS establishes routes with other ASs through interdomain routing protocols. The Border Gateway Protocol (BGP) is one of the well-known interdomain routing protocols. The main goal of BGP is to fi nd any path to the destination that is loop-free. This is different from the common goal of intradomain routing protocols, which is to fi nd an optimal route to the destination based on a specifi c link metric. The routers that connect different ASs are called border gateways . The task of the border gateways is to forward packets between ASs. Each AS has at least one BGP speaker. BGP speakers exchange reachability information among ASs. BGP advertises the complete path to the destination AS as an enumerated list. In this way, routing loops can be avoided. A BGP speaker can also apply some policies such as balancing the load over the neighboring ASs. If a BGP speaker has a choice of several different routes to a destination, it will advertise the best one according to its own local policies.
    [Show full text]
  • Network Layer/Internet Protocols Ip
    04 2080 CH03 8/16/01 1:34 PM Page 61 CHAPTER 3 NETWORK LAYER/INTERNET PROTOCOLS You will learn about the following in this chapter: • IP operation, fields and functions • ICMP messages and meanings • Fragmentation and reassembly of datagrams IP IP (Internet Protocol) does most of the work in the TCP/IP protocol suite. All protocols and applications within the TCP/IP suite run on top of IP and utilize it for logical Network layer addressing and transmission of datagrams between internet hosts. IP maps to the Internet layer of the DoD and to the Network layer of the OSI models. ICMP (Internet Control Message Protocol) is considered an integral part of IP and uses IP for its datagram delivery; we will dis- cuss ICMP later in this chapter. Figure 3.1 shows how IP maps to the DoD and OSI models. How Do I Buy a Ticket on the IP Train? The phrase ”runs on top of” might sound as if an application or protocol is buying a ticket to ride on an IP train. This term is not restricted to IP. In reality, it is industry jargon used to describe any upper- layer protocol or application coming down the OSI model and utilizes another lower-layer protocol’s features (in this case IP at the Network layer). IP provides an unreliable, connectionless datagram delivery service, which means that IP does not guarantee that an IP datagram successfully reaches its destination; rather it provides best effort of delivery, which means it sends it out and hopes it gets there.
    [Show full text]