Low Cost Quality of Service Multicast Routing in High Speed Networks

Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.

Recursive SDN for Carrier Networks

Control planes for global carrier networks should be programmable (so that new functionality can be easily introduced) and scalable (so they can handle the numerical scale and geographic scope of these networks). Neither traditional control planes nor new SDN-based control planes meet both of these goals. In this paper, we propose a framework for recursive routing computations that combines the best of SDN (programmability) and traditional networks (scalability through hierarchy) to achieve these two desired properties. Through simulation on graphs of up to 10,000 nodes, we evaluate our design's ability to support a variety of routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism

Efficient Micro-Mobility using Intra-domain Multicast-based Mechanisms (M&M)

One of the most important metrics in the design of IP mobility protocols is the handover performance. The current Mobile IP (MIP) standard has been shown to exhibit poor handover performance. Most other work attempts to modify MIP to slightly improve its efficiency, while others propose complex techniques to replace MIP. Rather than taking these approaches, we instead propose a new architecture for providing efficient and smooth handover, while being able to co-exist and inter-operate with other technologies. Specifically, we propose an intra-domain multicast-based mobility architecture, where a visiting mobile is assigned a multicast address to use while moving within a domain. Efficient handover is achieved using standard multicast join/prune mechanisms. Two approaches are proposed and contrasted. The first introduces the concept proxy-based mobility, while the other uses algorithmic mapping to obtain the multicast address of visiting mobiles. We show that the algorithmic mapping approach has several advantages over the proxy approach, and provide mechanisms to support it. Network simulation (using NS-2) is used to evaluate our scheme and compare it to other routing-based micro-mobility schemes - CIP and HAWAII. The proactive handover results show that both M&M and CIP shows low handoff delay and packet reordering depth as compared to HAWAII. The reason for M&M's comparable performance with CIP is that both use bi-cast in proactive handover. The M&M, however, handles multiple border routers in a domain, where CIP fails. We also provide a handover algorithm leveraging the proactive path setup capability of M&M, which is expected to outperform CIP in case of reactive handover.Comment: 12 pages, 11 figure

Multicast traffic aggregation in MPLS-based VPN networks

This article gives an overview of the current practical approaches under study for a scalable implementation of multicast in layer 2 and 3 VPNs over an IP-MPLS multiservice network. These proposals are based on a well-known technique: the aggregation of traffic into shared trees to manage the forwarding state vs. bandwidth saving trade-off. This sort of traffic engineering mechanism requires methods to estimate the resources needed to set up a multicast shared tree for a set of VPNs. The methodology proposed in this article consists of studying the effect of aggregation obtained by random shared tree allocation on a reference model of a representative network scenario.Publicad

TCPSnitch: Dissecting the Usage of the Socket API

Networked applications interact with the TCP/IP stack through the socket API. Over the years, various extensions have been added to this popular API. In this paper, we propose and implement the TCPSnitch software that tracks the interactions between Linux and Android applications and the TCP/IP stack. We collect a dataset containing the interactions produced by more than 120 different applications. Our analysis reveals that applications use a variety of API calls. On Android, many applications use various socket options even if the Java API does not expose them directly. TCPSnitch and the associated dataset are publicly available.Comment: See https://www.tcpsnitch.or

Message-Bundle Converting in Intenet Protocol Multicast-Based High Level Architecture Exercises

The Department of Defense is pushing for more wide-spread and realistic interactive training simulations which increases the demand on network capacity and resources. While network bandwidth is a measurable resource, packet bandwidth, or the number of packets-per-second (Pk/s) a host can handle, is a shifting commodity. This research analyzes host performance characteristics under varying data loads. The hosts include SGI single and multi-processor systems and Intel Pentium platforms using both Windows 95 and Linux Operating Systems. The networking media covers Ethernet, ATM and FDDI. For the ATM network, both AAL5 and IP over ATM were analyzed. With the data from this research, a system is proposed and developed that takes individual messages and bundles them into multi-message packets. This bundling process overcomes the 5,000 Pk/s limitation, reduces the CPU network handling time and introduces a flow-control mechanism at the local network level. While the idea of bundling messages to increase CPU efficiency is not new, there are no current methods of bundling within the new High Level Architecture (HLA). This proposed process is a novel approach to introduce flow control, priority message handling and increase address space while utilizing bundled data delivery. For traditional network delivery, typical CPU usage from network data varies as a function of traffic load, ranging from 5% at 500 messages-per-second to over 80% at 4,000 messages-per-second. The new bundling process requires 10% at 500 messages-per-second but only increases to 13% at 4,000 messages-per-second

Implications of Implementing HDTV Over Digital Subscriber Line Networks

This thesis addresses the different challenges a telecommunications company would face when trying to implement an HDTV video service over a Digital Subscriber Line (DSL) connection. Each challenge is discussed in detail and a technology, protocol, or method is suggested to overcome that particular challenge. One of the biggest challenges is creating a network architecture that can provide enough bandwidth to support video over a network that was originally designed for voice traffic. The majority of the network connections to a customer premises in a telephony network consists of a copper pair. This type of connection is not optimal for high bandwidth services. This limitation can be overcome using Gigabit Ethernet (GE) over fiber in the core part of the network and VDSL2 in the access part of the network. For the purposes of this document, the core portion of the network is considered to be an area equal to several counties or approximately 50 miles in radius. The core network starts at the primary central office (CO) and spreads out to central offices in suburbs and small towns. The primary central office is a central point in the telecom operator\u27s network. Large trunks are propagated from the primary central office to smaller central offices making up the core network. The access portion of the network is considered to be an area within a suburb or small town from the central office to a subscriber\u27s home. Appendix A, located on page 60, contains a network diagram illustrating the scope of each of the different portions of the network. Considerations must also be given for the internal network to the residence such as category 5 (Cat5) cable or higher grade and network equipment that can provide up to 30 Megabits per second (Mbps) connections or throughput. The equipment in the telecommunications network also plays a part in meeting the challenge of 30 Mbps bandwidth. GE switches should be used with single mode fiber optic cable in the core part of the network. Digital Subscriber Line Access Multiplexers (DSLAM) with the capability to filter Internet Group Management Protocol (IGMP) messages should be used in the access part of the network to facilitate bandwidth utilization. Placement of this equipment and how the data is aggregated is another issue to consider when implementing HDTV service. Another major challenge facing the implementation of HDTV over DSL networks is controlling quality of service (QoS) throughout the network. Class of Service (CoS) and Differentiated Services (DiffServ) is a method of QoS that would enable video packets to have a higher priority and less delay than other data packets. The consumer could have data, video, and voice traffic all over the same DSL connection. Data, video and voice packets would need to have a different priority in order to maintain appropriate QoS levels for each service. The use of advanced technology in video encoding will be essential to the success of the video service. MPEG-2, MPEG-4, and Windows Media 9 are just a few of the video encoding technologies that could be used to reduce the necessary bandwidth for HDTV. The advancement of this technology is essential to allow telecommunications providers to offer HDTV. Another challenge for the telecom operator concerns the security of the network and service after implementation. Theft of service will be another area that the telecomm operator will be forced to resolve. The cable operators currently face this issue and lose millions of dollars in revenue. Authentication, IP filtering and MAC address blocking are a few possible solutions to this problem