DOCSLIB.ORG

Protocol Independent Multicast (PIM)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Protocol Independent Multicast (PIM) Proto col Indep endent MulticastSparse Mo de PIMSM Motivation and Arc hitecture Stephen Deering Deb orah Estrin arinacci Dino F Xerox PARC Computer Science DepartmentISI Cisco Systems Inc Coyote Hill Road University of Southern California West Tasman Drive Palo Alto CA Los Angeles CA San Jose CA deeringparcxeroxcom estrinuscedu dinociscocom Handley Ahmed Helmy Van Jacobson Mark Department of Computer Science Lawrence Berkeley Lab oratory Computer Science Department University College London Cyclotron Road University of Southern California wer Street Go Berkeley CA Los Angeles CA BT vaneelblgov London WCE ahelmycatarinauscedu UK mhandleycsuclacuk Chinggung Liu Puneet Sharma David Thaler Computer Science Department Computer Science Department EECS Department higan University of Southern California University of Southern California University of Mic Ann Arb or MI Los Angeles CA Los Angeles CA thalerdeecsumichedu charleycatarinauscedu puneetcatarinauscedu Liming W ei Cisco Systems Inc West Tasman Drive San Jose CA lweiciscocom draftietfidmrpimarc hps Octob er Status of This Memo This do cument is an Internet Draft Internet Drafts are working do cuments of the Internet Engineering Task orce IETF its Areas and its Working Groups Note that other groups may also distribute working do cuments F as Internet Drafts Internet Drafts are draft do cuments valid for a maximum of six months Internet Drafts may b e up dated replaced or obsoleted by other do cuments at any time It is not appropriate to use Internet Drafts as orking draft or work in progress reference material or to cite them other than as a w draftietfidmrpimarchps Please check the ID abstract listing contained in each Internet Draft directory to learn the current status of this or any other Internet Draft draftietfidmrpimarchps Abstract Traditional multicast routing mechanisms eg DVMRP and MOSPF were intended for use within regions where groups are widely represented or bandwidth is universally plentiful When group memb ers and senders to those group memb ers are distributed sp arsely across a wide area these schemes are not ecient data packets or memb ership rep ort information are p erio dically sent over lead to receivers or senders resp ectively This characteristic lead the Internet many links that do not community to investigate multicast routing architectures that eciently establish distribution trees across widearea internets where many groups are sparsely represented and where bandwidth is not uniformly plentiful due to the distances and multiple administrations traversed Eciency is evaluated across the entire in terms of the state control message pro cessing and data packet pro cessing required network in order to deliver data packets to the memb ers of the group Mo de PIMSM architecture The Proto col Indep endent MulticastSparse a maintains the traditional IP multicast service mo del of receiverinitiated memb ership that propagate hopbyhop from memb ers directly connected routers toward b uses explicit joins the distribution tree c builds a shared multicast distribution tree centered at a Rendezv ous Point and then builds trees for those sources whose data trac warrants it sourcesp ecic d is not dep endent on a sp ecic unicast routing proto col and e uses softstate mechanisms to adapt to underlying network conditions and group dynamics y and scaling prop erties of this architecture make it well suited to large The robustness exibilit heterogeneous internetworks This do cument motivates and describ es the PIMSM architecture Companion do cuments describ e the detailed proto col mechanisms for PIMSM and PIMDM resp ectively draftietfidmrpimarchps Intro duction This do cument describ es an architecture for eciently routing to multicast groups that may span wide area and interdomain internets We refer to the approach as Proto col Indep endent MulticastSparse Mo de PIMSM b ecause it is not dep endent on any particular unicast routing proto col Throughout this do cument we will use the shorter term PIM to mean PIMSM When we are referring to the PIM Dense Mo de proto col we will say PIMDM explicitly t innovation in this architecture is the ecient supp ort of sparse wide area groups The most signican This sp arse mode SM of op eration complements the traditional densemode approach to multicast as develop ed by Deering and implemented in MOSPF and DVMRP routing for campus networks These traditional dense mo de multicast schemes were intended for use within regions where a group is widely represented or bandwidth is universally plentiful Ho wever when group memb ers and senders across a wide area these schemes are not ecient data packets to those groups are distributed sparsely in the case of DVMRP or memb ership rep ort information in the case of MOSPF are o ccasionally sent over many links that do not lead to receivers or senders resp ectively The purp ose of this work is to develop a multicast routing architecture that eciently establishes distribution trees even when memb ers is evaluated in terms of the state control message and data packet are sparsely distributed Eciency across the entire network in order to deliver data packets to the memb ers of the group overhead required Denition of Terms Glossary Following is a list of terms and denitions used throughout this do cument in alphab etical order This is a subset of the glossary list that app ears in the proto col sp ecication Asserts The pro cess of cho osing a single router to forward multicast packets from a particular segment The need for Asserts arises when a LAN segment has source onto a particular LAN multiple directlyconnected routers with routes to the source Bo otstrap router BSR A BSR is a dynamically elected router within a PIM domain It is resp onsible for constructing the RPSet and originating Bo otstrap messages CandidateBSR CBSR A CBSR is a router congured to participate in the BSR election and act as BSRs if elected Densemo de DM A generic term referring to a multicast routing proto col that is optimized for dense groups DVMRP MOSPF and Densemo de PIM are examples Designated Router DR The DR is the highest IP addressed PIM router on a multiaccess LAN Normally the DR sets up multicast route entries and sends corresp onding JoinPrune and Register messages on b ehalf of directlyconnected receivers and sources resp ectively The DR may or may not b e the same router as the IGMP Querier The DR may or may not b e the longterm lasthop router for the group or a particular source that is sending to the group a router on the LAN that has a lower metric route to the data source or to the groups RP may take over that role Incoming interface iif The iif of a multicast route entry indicates the interface from which multicast data packets are accepted for forwarding The iif is initialized when the entry is created Join list The Join list is one of two lists of IP unicast addresses that is included in a JoinPrune message each address refers to a source or RP It indicates those sources or RPs to which down stream receivers wish to join draftietfidmrpimarchps Lasthop router The lasthop router is the router which forwards multicast data packets to directlyconnected memb er hosts In general the lasthop router is the DR for the LAN However under various conditions describ ed in this do cument a parallel router connected to the same LAN may take over as the lasthop router in place of the DR Memb er A host that desires to receive multicast datagrams for a group This host need not b e a sender to the group A Memb er is synonymously called a R eceiver interface oif list Each multicast route entry has an oif list containing the outgoing Outgoing interfaces to which multicast packets matching that entry should b e forwarded Prune List The Prune list is the second list of IP unicast addresses that is included in a JoinPrune message It indicates those sources or RPs from which downstream receivers wish to prune PIM Multicast Border Router PMBR A PMBR connects a PIM domain to other multicast routing domains Rendezvous Point RP Each multicast group has a sharedtree via which receivers hear of sources The RP is the ro ot of this p ergroup shared tree called the RPTree CandidateRPs are routers congured to participate as RPs for some or all groups RPSet The BSR for a PIM region constructs a set of RP IP addresses based on CandidateRP advertisements received The RPSet information is distributed to all PIM routers in a domain in a Bo otstrap message Reverse Path Forwarding RPF RPF is used to select the appropriate incoming interface for is the the nexthop router used a multicast route entry The RPF neighb or for an IP address X to forward packets toward X The RPF interface is the interface to that RPF neighb or In the common case this is the next hop used by the unicast routing proto col for sending unicast packets toward X For example in cases where unicast and multicast routes are not congruent it can b e t dieren A multicast route entry is state maintained in a router along the distribution tree Route entry and is created and up dated based on incoming control messages and in some cases data packets The route entry may b e dierent from the forwarding entry the latter is used to forward data packets in real time Typically a forwarding entry is not created until data packets arrive the forwarding entrys iif and oif list are copied from the route entry and the forwarding entry may b e and recreated at will ushed Shared Tree RP tree The set of paths connecting all receivers of a group
Load more

Recommended publications
  • 15-744: Computer Networking Multicast Routing Example Applications Overview
    Multicast Routing • Unicast: one source to one destination • Multicast: one source to many destinations 15-744: Computer Networking • Two main functions: • Efficient data distribution • Logical naming of a group L-20 Multicast 2 Example Applications Overview • Broadcast audio/video • IP Multicast Service Basics • Push-based systems • Software distribution • Multicast Routing Basics • Web-cache updates • Teleconferencing (audio, video, shared • Overlay Multicast whiteboard, text editor) • Multi-player games • Reliability • Server/service location • Other distributed applications • Congestion Control 3 4 1 IP Multicast Architecture Multicast – Efficient Data Distribution Src Src Service model Hosts Host-to-router protocol (IGMP) Routers Multicast routing protocols (various) 5 6 Multicast Router Responsibilities IP Multicast Service Model (rfc1112) • Learn of the existence of multicast groups • Each group identified by a single IP address (through advertisement) • Groups may be of any size • Identify links with group members • Members of groups may be located anywhere in the Internet • Establish state to route packets • Members of groups can join and leave at will • Replicate packets on appropriate interfaces • Senders need not be members • Routing entry: • Group membership not known explicitly • Analogy: Src, incoming interface List of outgoing interfaces • Each multicast address is like a radio frequency, on which anyone can transmit, and to which anyone can tune-in. 7 8 2 IP Multicast Addresses Multicast Scope Control – Small TTLs • Class
    [Show full text]
  • IP Multicast Routing Technology Overview
    IP Multicast Routing Technology Overview • Information About IP Multicast Technology, on page 1 • Additional References for IP Multicast, on page 15 Information About IP Multicast Technology This section provides information about IP multicast technology. About IP Multicast Controlling the transmission rate to a multicast group is not supported. At one end of the IP communication spectrum is IP unicast, where a source IP host sends packets to a specific destination IP host. In IP unicast, the destination address in the IP packet is the address of a single, unique host in the IP network. These IP packets are forwarded across the network from the source to the destination host by devices. At each point on the path between source and destination, a device uses a unicast routing table to make unicast forwarding decisions, based on the IP destination address in the packet. At the other end of the IP communication spectrum is an IP broadcast, where a source host sends packets to all hosts on a network segment. The destination address of an IP broadcast packet has the host portion of the destination IP address set to all ones and the network portion set to the address of the subnet. IP hosts, including devices, understand that packets, which contain an IP broadcast address as the destination address, are addressed to all IP hosts on the subnet. Unless specifically configured otherwise, devices do not forward IP broadcast packets, so IP broadcast communication is normally limited to a local subnet. IP multicasting falls between IP unicast and IP broadcast communication. IP multicast communication enables a host to send IP packets to a group of hosts anywhere within the IP network.
    [Show full text]
  • Rule-Based Forwarding (RBF): Improving the Internet's Flexibility
    Rule-based Forwarding (RBF): improving the Internet’s flexibility and security Lucian Popa∗ Ion Stoica∗ Sylvia Ratnasamy† 1Introduction 4. rules allow flexible forwarding: rules can select ar- From active networks [33] to the more recent efforts on bitrary forwarding paths and/or invoke functionality GENI [5], a long-held goal of Internet research has been made available by on-path routers; both path and to arrive at a network architecture that is flexible.Theal- function selection can be conditioned on (dynamic) lure of greater flexibility is that it would allow us to more network and packet state. easily incorporate new ideas into the Internet’s infras- The first two properties enable security by ensuring tructure, whether these ideas aim to improve the existing the network will not forward a packet unless it has network (e.g., improving performance [36, 23, 30], relia- been explicitly cleared by its recipients while the third bility [12, 13], security [38, 14, 25], manageability [11], property ensures that rules cannot be (mis)used to attack etc.) or to extend it with altogether new services and the network itself. As we shall show, our final property business models (e.g., multicast, differentiated services, enables flexibility by allowing a user to give the network IPv6, virtualized networks). fine-grained instructions on how to forward his packets. An unfortunate stumbling block in these efforts has In the remainder of this paper, we present RBF, a been that flexibility is fundamentally at odds with forwarding architecture that meets the above properties. another long-held goal: that of devising a secure network architecture.
    [Show full text]
  • Routing and Packet Forwarding
    Routing and Packet Forwarding Tina Schmidt September 2008 Contents 1 Introduction 1 1.1 The Different Layers of the Internet . .2 2 IPv4 3 3 Routing and Packet Forwarding 5 3.1 The Shortest Path Problem . .6 3.2 Dijkstras Algorithm . .7 3.3 Practical Realizations of Routing Algorithms . .8 4 Autonomous Systems 10 4.1 Intra-AS-Routing . 10 4.2 Inter-AS-Routing . 11 5 Other Services of IP 11 A Dijkstra's Algorithm 13 1 Introduction The history of the internet and Peer-to-Peer networks starts in the 60s with the ARPANET (Advanced Research Project Agency Network). Back then, when computers were expen- sive and linked to several terminals, the aim of ARPANET was to establish a continuous network inbetween mainframe computers in the U.S. Starting with only three computers in 1969, mainly universities were involved in establishing the ARPANET. The ARPANET became a network inbetween networks of mainframe computes and therefore was called inter-net. Today it became the internet which links millions of computers. For a long time nobody knew what use such a Wide Area Netwok (WAN) could have for the pop- ulation. The internet was used for e-mails, newsgroups, exchange of scientific data and some special software, all in all services that were barely known in public. The spread of 1 Application Layer Peer-to-Peer-networks, e.g. Telnet = Telecommunication Network FTP = File Transfer Protocol HTTP = Hypertext Transfer Protocol SMTP = Simple Mail Transfer Protocol Transport Layer TCP = Transmission Control Protocol UDP = User Datagram Protocol Internet Layer IP = Internet Protocol ICMP = Internet Control Message Protocol IGMP = Internet Group Management Protocol Host-to-Network Layer device drivers or Link Layer (e.g.
    [Show full text]
  • WAN-LAN PIM Multicast Routing and LAN IGMP FEATURE OVERVIEW and CONFIGURATION GUIDE
    Technical Guide WAN-LAN PIM Multicast Routing and LAN IGMP FEATURE OVERVIEW AND CONFIGURATION GUIDE Introduction This guide describes WAN-LAN PIM Multicast Routing and IGMP on the LAN and how to configure WAN-LAN PIM multicast routing and LAN IGMP snooping. The AlliedTelesis Next Generation Firewalls (NGFWs) can perform routing of IPv4 and IPv6 multicast, using PIM-SM and PIM-DM. Also, switching interfaces of the NGFWs are IGMP aware, and will only forward multicast steams to these switch ports that have received reports. IGMP snooping allows a device to only forward multicast streams to the links on which they have been requested. PIM Sparse mode requires specific designated routers to receive notification of all streams destined to specific ranges of multicast addresses. When a router needs to get hold of a given group, it sends a request to the designated Rendezvous Point for that group. If there is a source in the network that is transmitting a stream to this group, then the Rendezvous Point will be receiving it, and will forward it to the requesting router. C613-22042-00 REV A alliedtelesis.com x Products and software version that apply to this guide Contents Introduction.............................................................................................................................................................................1 Products and software version that apply to this guide .......................................................................2 Configuring WAN-LAN PIM Multicast Routing and LAN IGMP Snooping........................................3
    [Show full text]
  • Routing Review Autonomous System Concept
    Routing Review Autonomous System Concept • Term Autonomous System (AS) to specify groups of routers • One can think of an AS as a contiguous set of networks and routers all under control of one administrative authority – For example, an AS can correspond to an ISP, an entire corporation, or a university – Alternatively, a large organization with multiple sites may choose to define one AS for each site – In particular, each ISP is usually a single AS, but it is possible for a large ISP to divide itself into multiple ASs • The choice of AS size can be made for – economic, technical, or administrative reasons The Two Types of Internet Routing Protocols • All Internet routing protocols are divided into two major categories: – Interior Gateway Protocols (IGPs) – Exterior Gateway Protocols (EGPs) • After defining the two categories – we will examine a set of example routing protocols that illustrate each category • Interior Gateway Protocols (IGPs) • Exterior Gateway Protocols (EGPs) The Two Types of Internet Routing Protocols Interior Gateway Protocols (IGPs) • Routers within an AS use an IGP exchange routing information • Several IGPs are available – each AS is free to choose its own IGP • Usually, an IGP is easy to install and operate • IGP may limit the size or routing complexity of an AS The Two Types of Internet Routing Protocols Exterior Gateway Protocols (EGPs) • A router in one AS uses an EGP to exchange routing information with a router in another AS • EGPs are more complex to install and operate than IGPs – but EGPs offer more flexibility
    [Show full text]
  • Unicast Multicast IP Multicast Introduction
    Outline 11: ❒ IP Multicast ❒ Multicast routing IP Multicast ❍ Design choices ❍ Distance Vector Multicast Routing Protocol (DVMRP) Last Modified: ❍ Core Based Trees (CBT) ❍ Protocol Independent Multicast (PIM) 4/9/2003 1:15:00 PM ❍ Border Gateway Multicast Protocol (BGMP) ❒ Issues in IP Multicast Deplyment Based on slides by Gordon Chaffee Berkeley Multimedia Research Center URL: http://bmrc.berkeley.edu/people/chaffee 4: Network Layer 4a-1 4: Network Layer 4a-2 What is multicast? Unicast ❒ ❒ 1 to N communication Problem Sender ❍ ❒ Nandwidth-conserving technology that Sending same data to reduces traffic by simultaneously many receivers via unicast is inefficient delivering a single stream of information to R multiple recipients ❒ Example ❒ Examples of Multicast ❍ Popular WWW sites ❍ Network hardware efficiently supports become serious multicast transport bottlenecks • Example: Ethernet allows one packet to be received by many hosts ❍ Many different protocols and service models • Examples: IETF IP Multicast, ATM Multipoint 4: Network Layer 4a-3 4: Network Layer 4a-4 Multicast IP Multicast Introduction ❒ Efficient one to many Sender ❒ Efficient one to many data distribution data distribution ❍ Tree style data distribution ❍ Packets traverse network links only once R ❒ Location independent addressing ❍ IP address per multicast group ❒ Receiver oriented service model ❍ Applications can join and leave multicast groups ❍ Senders do not know who is listening ❍ Similar to television model ❍ Contrasts with telephone network, ATM 4: Network Layer
    [Show full text]
  • Broadcast and Multicast Routing
    Broadcast and Multicast Routing Daniel Zappala CS 460 Computer Networking Brigham Young University Broadcast Multicast Service Model DVMRP CBT PIM Status Group Communication • How can the Internet provide efficient group communication? • send the same copy of a data stream (e.g. TV show, teleconference) to a group of users • need to find where everyone is located (routing) • need to avoid sending a separate copy to everyone 2/34 Broadcast Multicast Service Model DVMRP CBT PIM Status Choices • unicast: send a separate copy of each packet to each host • broadcast: send one copy of each packet, the network will replicate it and deliver it to all hosts • broadcast provides efficient network flooding • multicast: send one copy of each packet, the network will replicate it and deliver it to only those hosts that want it • multicast provides efficient group communication 3/34 Broadcast Broadcast Multicast Service Model DVMRP CBT PIM Status Broadcast • send a copy of each packet to all your neighbors • need to eliminate duplicates • sequence numbers: drop a sequence number previously seen • reverse path forwarding: accept the packet only on the incoming interface used to send packets to the source 5/34 Broadcast Multicast Service Model DVMRP CBT PIM Status Spanning and Steiner Trees • spanning tree • connect all routers in the entire Internet • easy to build a minimum cost tree • Steiner Tree • connect only those routers with multicast members for a particular group • NP-complete (one of the original 21!) • many different heuristics, but often centralized
    [Show full text]
  • Introduction to IP Multicast Routing
    Introduction to IP Multicast Routing by Chuck Semeria and Tom Maufer Abstract The first part of this paper describes the benefits of multicasting, the Multicast Backbone (MBONE), Class D addressing, and the operation of the Internet Group Management Protocol (IGMP). The second section explores a number of different algorithms that may potentially be employed by multicast routing protocols: - Flooding - Spanning Trees - Reverse Path Broadcasting (RPB) - Truncated Reverse Path Broadcasting (TRPB) - Reverse Path Multicasting (RPM) - Core-Based Trees The third part contains the main body of the paper. It describes how the previous algorithms are implemented in multicast routing protocols available today. - Distance Vector Multicast Routing Protocol (DVMRP) - Multicast OSPF (MOSPF) - Protocol-Independent Multicast (PIM) Introduction There are three fundamental types of IPv4 addresses: unicast, broadcast, and multicast. A unicast address is designed to transmit a packet to a single destination. A broadcast address is used to send a datagram to an entire subnetwork. A multicast address is designed to enable the delivery of datagrams to a set of hosts that have been configured as members of a multicast group in various scattered subnetworks. Multicasting is not connection oriented. A multicast datagram is delivered to destination group members with the same “best-effort” reliability as a standard unicast IP datagram. This means that a multicast datagram is not guaranteed to reach all members of the group, or arrive in the same order relative to the transmission of other packets. The only difference between a multicast IP packet and a unicast IP packet is the presence of a “group address” in the Destination Address field of the IP header.
    [Show full text]
  • Analysis and Improvement of Name-Based Packet Forwarding
    Analysis and Improvement of Name-based Packet Forwarding over Flat ID Network Architectures Antonio Rodrigues Peter Steenkiste Ana Aguiar [email protected] [email protected] [email protected] Carnegie Mellon University Carnegie Mellon University Faculty of Engineering, Univ. of Porto Pittsburgh, PA, USA Pittsburgh, PA, USA Instituto de Telecomunicações Faculty of Engineering, Univ. of Porto Porto, Portugal Instituto de Telecomunicações Porto, Portugal ABSTRACT URLs to identify web objects. Name-based Information Centric One of ICN’s main challenges is attaining forwarding table scala- Networks (ICNs) such as NDN [8] promise to be a good fit for such bility when confronted with a huge content space. This is specially applications, for two reasons: (1) no need for external name lookup true in flat ID architectures, which do not naturally support route (e.g., DNS or GNS [18]) by using name-based forwarding at the aggregation for hierarchical names. Previous work has proposed network layer; and (2) reduced forwarding table sizes as a result improving scalability by aggregating content names in a fixed-size of the aggregation enabled by the hierarchical structure of names. Bloom Filters (BF). However, the negative impact of false positive In contrast, ICNs based on flat IDs (defined as fixed-size bit strings (FPs) matches on forwarding correctness and performance has not in this paper), e.g., DONA [12], PURSUIT [6], do not natively have been studied thoroughly. In this paper, we study the end-to-end net- these benefits. work performance of BF-based forwarding. We devise an analytical Recently, a forwarding scheme based on Bloom Filters (BFs) [13, model that accurately models BF-based forwarding and the flow of 14] has been proposed to enable aggregation of content descriptors BF-based packets over inter-domain topologies.
    [Show full text]
  • Unicast Reverse Path Forwarding Configuration Guide, Cisco IOS XE 17 (Cisco ASR 900 Series)
    Unicast Reverse Path Forwarding Configuration Guide, Cisco IOS XE 17 (Cisco ASR 900 Series) First Published: 2020-01-10 Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 THE SPECIFICATIONS AND INFORMATION REGARDING THE PRODUCTS IN THIS MANUAL ARE SUBJECT TO CHANGE WITHOUT NOTICE. ALL STATEMENTS, INFORMATION, AND RECOMMENDATIONS IN THIS MANUAL ARE BELIEVED TO BE ACCURATE BUT ARE PRESENTED WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED. USERS MUST TAKE FULL RESPONSIBILITY FOR THEIR APPLICATION OF ANY PRODUCTS. THE SOFTWARE LICENSE AND LIMITED WARRANTY FOR THE ACCOMPANYING PRODUCT ARE SET FORTH IN THE INFORMATION PACKET THAT SHIPPED WITH THE PRODUCT AND ARE INCORPORATED HEREIN BY THIS REFERENCE. IF YOU ARE UNABLE TO LOCATE THE SOFTWARE LICENSE OR LIMITED WARRANTY, CONTACT YOUR CISCO REPRESENTATIVE FOR A COPY. The Cisco implementation of TCP header compression is an adaptation of a program developed by the University of California, Berkeley (UCB) as part of UCB's public domain version of the UNIX operating system. All rights reserved. Copyright © 1981, Regents of the University of California. NOTWITHSTANDING ANY OTHER WARRANTY HEREIN, ALL DOCUMENT FILES AND SOFTWARE OF THESE SUPPLIERS ARE PROVIDED “AS IS" WITH ALL FAULTS. CISCO AND THE ABOVE-NAMED SUPPLIERS DISCLAIM ALL WARRANTIES, EXPRESSED OR IMPLIED, INCLUDING, WITHOUT LIMITATION, THOSE OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OR ARISING FROM A COURSE OF DEALING, USAGE, OR TRADE PRACTICE. IN NO EVENT SHALL CISCO OR ITS SUPPLIERS BE LIABLE FOR ANY INDIRECT, SPECIAL, CONSEQUENTIAL, OR INCIDENTAL DAMAGES, INCLUDING, WITHOUT LIMITATION, LOST PROFITS OR LOSS OR DAMAGE TO DATA ARISING OUT OF THE USE OR INABILITY TO USE THIS MANUAL, EVEN IF CISCO OR ITS SUPPLIERS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
    [Show full text]
  • A Scalable and Flexible Packet Forwarding Method for Future Internet Networks
    Globecom 2014 - Next Generation Networking Symposium A Scalable and Flexible Packet Forwarding Method for Future Internet Networks Andrzej Beben, Piotr Wiśniewski Jordi Mongay Batalla George Xilouris Warsaw University of Technology National Institute of Telecommunications NCSR Demokritos Warsaw, Poland Warsaw, Poland Athens, Greece {abeben, p.wisniewski}tele.pw.edu.pl [email protected] [email protected] Abstract—The paper proposes a novel flexible packet in the data plane while improving SDN scalability thanks to the forwarding (FPF) method designed for Future Internet networks. reduction of state information in SDN forwarders [4]. It follows the source routing principle at an inter-domain level and applies the list of domain customized identifiers to forward II. ANALYSIS OF RELATED WORKS packets on the end-to-end path. The main features are capability to introduce flexible routing path selection, native support for One of the main FI challenges is to design effective routing multipath and multicast packet transfer, ability for exploitation and forwarding methods that overcame limitations of the IP of advanced in-network packet processing as, e.g., content protocol. The key objectives are providing more flexible recoding and caching. The performance and scalability of FPF routing path selection and enabling innovative in-network approach were evaluated by experimentation on developed packet processing, while assuring scalability of the solution. prototype as well as by scalability studies assuming Internet-scale Many of recently proposed approaches are based on the source network scenario. routing principle, which is not really a new idea. The original studies on exploiting source routing in IP networks are Future Internet, source routing, packet forwarding, SDN presented in [5].
    [Show full text]