QoS-based multicast routing optimization algorithms for Internet

Most of the multimedia applications require strict Quality-of-Service （QoS） guarantee during the communication between a single source and multiple destinations. The paper mainly presents a QoS Multicast Routing algorithms based on Genetic Algorithm （QMRGA）. Simulation results demonstrate that the algorithm is capable of discovering a set of QoS-based near optimized, non-dominated multicast routes within a few iterations, even for the networks environment with uncertain parameters.     

面向绿色互联网的低功耗多播路由算法

基于路径节点驱动策略,提出了一种绿色互联网中的一对多组播路由算法,充分利用路径节点共享路径,生成低功耗最短路径树,提高用户QoS满意度。基于CERNET2拓扑仿真实现了该算法,通过与现有的能量感知启发式路由算法在网络功耗、路由成功率和运行时间等方面的性能对比,表明本文提出的算法具有更好的性能。     

A survey of multicast routing protocols for mobile Ad-Hoc networks

A Mobile Ad-hoc NETwork (MANET) is composed of Mobile Nodes (MNs) without any infrastructure. MNs selforganize to form a network over radio links. In this environment, multicast routing protocols are faced with the challenge of producing multi-hop routing under host mobility and bandwidth constraint. Multicast routing plays a significant role in MANETs. In recent years, various multicast routing protocols with distinguishing feature have been newly proposed. In order to provide a comprehensive understanding of these multicast routing protocols designed for MANETs and pave the way for the further research, a survey of the multicast routing protocols is discussed in detail in this paper. Qualitatively, based on their primary multicast routing selection principle, we show that all these protocols could be placed under one of two broad routing selection categories: multicast routing based on application independence and multicast routing based on application dependence.     

A framework for resilient Internet routing protocols

At a fundamental level, all Internet-based applications rely on a dependable packet delivery service provided by the Internet routing infrastructure. However, the Internet is a large-scale complex loosely coupled distributed system made of many imperfect components. Faults of varying-scale and severity occur from time to time. In this paper we survey the research efforts over the years aimed at enhancing the dependability of the routing infrastructure. To provide a comprehensive overview of the various efforts, we first introduce a threat model based on known threats, then sketch out a defense framework, and put each of the existing efforts at appropriate places in the framework based on the faults and attacks against which it can defend. Our analysis shows that although individual defense mechanisms may effectively guard against specific faults, no single fence can counter all faults. Thus, a resilient Internet routing infrastructure calls for integrating techniques from cryptographic protection mechanisms, statistical anomaly detection, protocol syntax checking, and protocol semantics checking to build a multifence defense system.     

Recent developments in securing Internet routing protocols

Routing protocols distribute network topology information around the routers of a network. They are part of the critical network infrastructure, but are vulnerable to both internal and external attacks. In this paper, different routing protocols are first introduced, followed by reviews of routing protocol security publications in academia and industry. The general vulnerabilities and threats of routing protocols are then analysed. The two major protection countermeasures for both link-state routing protocols and distance-vector routing protocols are presented in detail. The popular hacking tools which can be used directly or customised to launch attacks are described. The product vendors of routing protocol security and the best practice adopted by network carriers and ISPs are investigated. The paper aims to provide an overview of Internet routing protocol security, and highlight areas for further research.     

Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

Enhancing transport networks with Internet protocols

Transport networks are facing new challenges and opportunities because of the explosive growth of data traffic. Besides having to meet the ever-increasing bandwidth demand, transport networks need to provide new functionalities for the support of data applications. For example, they should provide elastic data pipes which guarantee minimum bandwidths but also allow expansion when extra bandwidth is available. They should support instant and automatic discovery and configuration of layer 3 nodes which, traditionally, is possible only for LANs. Enhanced transport systems with inherent packet multiplexing can meet these challenges. It will be natural to use Internet protocols and technologies to implement these packet transport systems, and thereby reuse much of the existing Internet infrastructure already widely deployed     

A framework for systematic evaluation of multicast congestion control protocols

Congestion control is a major requirement for multicast to be deployed in the current Internet. Due to the complexity and conflicting tradeoffs, the design and testing of multicast congestion control protocols is difficult. In this paper, we present a novel framework for systematic testing of multicast congestion control protocols. In our framework, we first design an appropriate model for the studied protocols based on the protocols specifications and correctness conditions, and then we develop an automated search engine to generate all possible error scenarios and filter these errors to come up with a selected set of scenarios that we evaluate in more detailed simulations. Our methodology helps in identifying the potential problems of the studied protocols and points to possible improvements. We hope that this will provide a valuable tool to expedite the development and standardization of such protocols.     

QoS-aware multicast routing for the Internet: the design andevaluation of QoSMIC

One of the main problems of the current Internet infrastructure is its inability to provide services at consistent quality-of-service (QoS) levels. At the same time, many emerging Internet applications, such as teleeducation, and teleconferencing, require multicast protocols that will provide the necessary QoS. In this paper, we propose QoSMIC, a multicast routing protocol for the Internet, that provides QoS-sensitive paths in a scalable, resource-efficient, and flexible way. QoSMIC differs from the previous protocols in that it identifies multiple paths and selects the one that can provide the required QoS. Two other key advantages of QoSMIC are its flexibility and adaptivity. First, the distribution tree does not have to be rooted at a preselected core router. Second, we can tradeoff between efficiency metrics depending on our needs; for example, we can tradeoff routing efficiency for a reduction in the control messages. Extensive simulations show that our protocol improves the resources utilization and the end-to-end performance compared to the current protocols. Specifically, our protocol reduces the call blocking probability by a factor of six and reduces the end-to-end delay by as much as 90% compared to the PIM protocol     

A framework for routing and congestion control for multicast information flows

We propose a new multicast routing and scheduling algorithm called multipurpose multicast routing and scheduling algorithm (MMRS). The routing policy load balances among various possible routes between the source and the destinations, basing its decisions on the message queue lengths at the source node. The scheduling is such that the flow of a session depends on the congestion of the next hop links. MMRS is throughput optimal. In addition, it has several other attractive features. It is computationally simple and can be implemented in a distributed, asynchronous manner. It has several parameters which can be suitably modified to control the end-to-end delay and packet loss in a topology-specific manner. These parameters can be adjusted to offer limited priorities to some desired sessions. MMRS is expected to play a significant role in end-to-end congestion control in the multicast scenario.     

Internet protocols for multimedia communications. II. Resourcereservation, transport, and application protocols

Part I (ibid., July-Oct. 1997) surveyed the evolution of Internet protocols and applications and described the Internet protocol IPv6 in detail. This part discusses new developments at the upper layers that support real-time Internet multimedia, such as audio and video conferencing and shared whiteboard applications. Application-level framing (ALF), proposed in 1990 for protocol and application design, now forms the basis for many new Internet protocols and applications, including Real-time Transport Protocol (RTP) and Mbone multimedia applications. RTP supports real-time applications that adapt to changing network situations to maintain the quality of service (QoS). The Resource Reservation Protocol (RSVP) provides new Internet services with higher quality than best-effort by means of resource reservations     

Destination-driven routing for low-cost multicast

We present a destination-driven algorithm that optimizes for applications, such as group video or teleconferencing, that require multicast trees with low total cost. The destination-driven algorithm uses a greedy strategy based on shortest-path trees and minimal spanning trees but biases routes through destinations. The performance of the algorithm is analyzed through extensive simulation and compared with several Steiner tree heuristics and the popular shortest-path tree (SPT) method. The algorithm is found to produce trees with significantly lower overall cost than the SPT while maintaining reasonable per-destination performance. Its performance also compares well with other known Steiner heuristics. Moreover, the algorithm does not suffer from high complexity common to most Steiner tree heuristics and builds a route by querying only incident links for cost information     

Alternate path routing for multicast

Current network-layer multicast routing protocols build multicast trees based only on hop count and policy. If a tree cannot meet application requirements, the receivers have no alternative. In this paper, we propose a general and modular architecture that integrates alternate path routing with the network's multicast services. This enables individual multicast receivers to reroute a multicast tree according to their needs, subject to policy restrictions. Our design focuses on the two primary components of this architecture - a loop-free path installation protocol and a scalable, distributed path computation algorithm. Based on a simulation study, we demonstrate that using alternate path routing enables receivers to find acceptable paths nearly as well as a link-state protocol, with much lower overhead. We also show that our approach scales to large networks and that performance improves as a multicast group grows in size.     

A QoS-aware multicast routing protocol

The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network with excessive overhead. We propose QMRP, a new QoS-aware multicast routing protocol. QMRP achieves scalability by significantly reducing the communication overhead of constructing a multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path routing and multiple-path routing according to the current network conditions. The high level design of QMRP makes it operable on top of any unicast routing algorithm in both intradomain and interdomain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of routing without the use of timeout. In addition, QMRP always constructs loop-free multicast trees     

Routing state reduction in multicast protocols

To improve the scalability of multicast protocols, a simple yet novel technique, called the dynamic overlap tree path (DOTP), is proposed. According to the simulation results, the overall average forwarding state-table size can be reduced by ~30%     

A classification of reliable multicast protocols

The range of user requirements on multicast protocols is so wide that no single protocol will ever satisfy them. The set of multicast protocols can be classified using the user requirements, and the architectures, mechanisms, communications patterns, and policies used to satisfy these requirements. We provide such a classification, and illustrate it with several example protocols chosen to cover the range of features described.     

Transport protocols in multicast via satellite

In a wide variety of broadband applications, there is a need to distribute information to a potentially large number of receiver sites that are widely dispersed from each other. Communication satellites are a natural technology option and are extremely well suited for carrying such services because of the inherent broadcast capability of the satellite channel. Despite the potential of satellite multicast, there exists little support for multicast services over satellite networks. Although several multicast protocols have been proposed for use over the Internet, they are not optimized for satellite networks. One of the key multicast components that is affected when satellite networks are involved in the communication is the transport layer. In this paper, we attempt to provide an overview of the design space and the ways in which the network deployment and application requirements affect the solution space for transport layer schemes in a satellite environment. We also highlight some of the issues that are critical in the development of next generation satellite multicast services. Copyright © 2004 John Wiley & Sons, Ltd.     

Class-based multicast routing in interdomain scenarios

DiffServ-like domains bring new challenges to quality of service (QoS) multicast routing simply by shifting the focus from individual flows into classes of flows. Packets are marked at edge routers and receive differentiated treatment according to the class and not the flow that they belong to. DiffServ therefore became adverse to multicast, as packet replication inside the domain may require classification and remarking functions not present in core nodes. At the interdomain level, no doubt multicast QoS complexity is increased by the interleaving of DiffServ and non-Diffserv domains, making it more difficult to address QoS multicast in an end-to-end perspective. In today’s real interconnection world, classes of service have no meaning in certain links of a full interdomain path. While the problem is not new, as already pointed out, there are no real efforts to bring multicast back to a class-of-service domain without compromising its model of operation. In this article, we present an innovative multicast QoS routing strategy, clearly designed for the new class-of-service paradigm. The solution is based upon the construction of multiple trees, one per class of service available, while still allowing receivers to shift for source-specific trees in its own class of service. The strategy is presented in a full end-to-end perspective. Intradomain trees use differentiated routing paths thus helping traffic differentiation. Intradomain receivers are allowed to shift from shared trees into an adequate class-of-service source tree. At interdomain level, each class-of-service interdomain tree branch is accomplished by means of an improved path probing strategy enabling for QoS path establishment. This paper presents this new strategy, and associated protocols, for constructing several multicast and directed distribution trees, one per class of service, within each multicast group. This new strategy and associated protocols are then simulated using NS-2 platform. Simulation results are analyzed and compared with other multicast routing solutions, both at intra- and interdomain levels.