A Domain-Based Routing Protocol for SSM Source Mobility in Mobile IPv6 Networks

In Mobile IP, the signaling traffic overhead will be too high since the new Care-of-Address (CoA) of the mobile node (MN) is registered all the way with the home agent (HA) whenever the MN has moved into a new foreign network. To complement Mobile IP in better handling local movement, several IP micro protocols have been proposed. These protocols introduce a hierarchical mobility management scheme, which divides the mobility into micro mobility and macro mobility according to whether the host's movement is intra-domain or inter-domain. Thus, the requirements on performance and flexibility are achieved, especially for frequently moving hosts. This paper introduces a routing protocol for multicast source mobility on the basis of the hierarchical mobile management scheme, which provides a unified global architecture for both uni- and multicast routing in mobile networks. The implementation of multicast services adopts an improved SSM (Source Specific Multicast) model, which combines the advantages of the existing protocols in scalability and mobility transparency. Simulation results show that the proposed protocol has better performance than the existing routing protocols for SSM source mobility.     

Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications

Quality of service (QoS) in wireless mesh networks is an active area of research, which is driven by the increasing demand for real-time and multimedia applications, such as Voice over IP and Video on Demand. In this paper, we propose a novel QoS based routing protocol for wireless mesh infrastructure, called Hybrid QoS Mesh Routing (HQMR). It is composed of two QoS based routing sub-protocols: a reactive multi-metric routing protocol for intra-infrastructure communications and a proactive multi-tree based routing protocol for communications with external networks. The proposed routing protocol enables forwarding real-time and streaming applications with QoS guarantee in a mesh wireless environment, by assigning a specific routing path for each defined service class. To this end, three different QoS service classes are defined, depending on the applications requirements. We analyze in this paper the simulation results of different scenarios conducted on the network simulator ns-3 to demonstrate the effectiveness of the HQMR protocol and to compare it to other routing protocols while forwarding real-time applications with QoS guarantee.     

A new QoS routing algorithm based on self-organizing maps for wireless sensor networks

For the past ten years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks such as path discovery. In this paper, we explore and compare the performance of two very well known routing paradigms, directed diffusion and Energy-Aware Routing, with our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes.     

在基于MPLS的层次化移动IP网络中支持DiffServ的研究

MPLS支持DiffServ、流量工程,能为网络提供较好的QoS保证,而移动IP(MIP)能为移动设备提供较好的移动性支持。文章探讨了在无线接入网中MPLS和MIP结合实现DiffServ的方案,并给出了一种在基于MPLS的层次化MIP网络结构中支持DiffServ的体系结构,设计了其节点功能模型和关键协议。方案中利用了层次化结构的区域注册和重路由机制,减少了切换时延和网络的信令负荷。     

On-demand power management for ad hoc networks

Battery power is an important resource in ad hoc networks. It has been observed that in ad hoc networks, energy consumption does not reflect the communication activities in the network. Many existing energy conservation protocols based on electing a routing backbone for global connectivity are oblivious to traffic characteristics. In this paper, we propose an extensible on-demand power management framework for ad hoc networks that adapts to traffic load. Nodes maintain soft-state timers that determine power management transitions. By monitoring routing control messages and data transmission, these timers are set and refreshed on-demand. Nodes that are not involved in data delivery may go to sleep as supported by the MAC protocol. This soft state is aggregated across multiple flows and its maintenance requires no additional out-of-band messages. We implement a prototype of our framework in the ns-2 simulator that uses the IEEE 802.11 MAC protocol. Simulation studies using our scheme with the Dynamic Source Routing protocol show a reduction in energy consumption near 50% when compared to a network without power management under both long-lived CBR traffic and on–off traffic loads, with comparable throughput and latency. Preliminary results also show that it outperforms existing routing backbone election approaches.     

Routing Protocol for Heterogeneous Hierarchical Wireless Multimedia Sensor Networks

Recently, wireless multimedia sensor networks (WMSNs) have emerged as one of the most important technologies, driven by the development of powerful multimedia device such as CMOS. WMSNs require several factors such as resource constraints, specific QoS, high bandwidth and so on. In this paper, we propose a hierarchical heterogeneous network model based routing protocol for WMSNs. In our proposal, proposed network model is classified into monitoring class, delivery class and aggregation class. Also we define two kinds of the routing path in order to ensure bandwidth and QoS. In simulation results, we illustrate the performance of our proposal.     

Security and QoS Self-Optimization in Mobile Ad Hoc Networks

Network quality-of-service and network security have been considered as separate entities and research in these areas have largely proceeded independently. However, security impacts overall QoS and it is therefore essential to consider both security and QoS together when designing protocols for ad hoc environments as one impacts the other. In this paper we propose a mechanism for a distributed dynamic management system which aims to maximize QoS and/or security while maintaining a minimum user acceptable level of QoS and/or security even as network resource availability change. In order to achieve this objective, we propose three basic frameworks: a policy based plug-in security framework, multi-layer QoS guided routing and a proportional integral derivative (PID) controller. Simulation results indicate the proposed PID optimized security and QoS algorithm produce similar performance as non-secure QoS routing protocols under various traffic loads.     

Capacity management and routing policies for voice over IP traffic

This article addresses the problem of designing capacity management and routing mechanisms to support telephony over an IP network. For this service, we propose two distinct architectural models. The first relies on enhancements to the basic IP infrastructure to support integrated service transport and QoS routing. The second assumes that the IP network can support an overlay virtual private network with dedicated capacity for the VoIP service, thereby allowing standard capacity management and routing mechanisms from circuit-switched networks to be reused. We evaluate the performance of these two architectural models and their-associated policies via simulations using configuration and usage data derived from operational networks     

Ad Hoc网络中基于协商机制的QoS多播路由研究

针对移动Ad Hoc网络QoS多播路由中普遍存在的拥塞问题,提出了一种基于协商机制的QoS多播路由协议,节点协商使用以一定QoS约束建立起的多播链路,避免过度使用多播资源引起网络拥塞,从而提高分组投递率和网络吞吐量。通过NS2仿真证明,该协议能够保证不同类型业务在网络中传输的服务质量,提高网络的利用率。     

Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

Traffic engineering aims to distribute traffic so as to "optimize" some performance criterion. This optimal distribution of traffic depends on both the routing protocol and the forwarding mechanisms in use in the network. In IP networks running the OSPF or IS-IS protocols, routing is over shortest paths, and forwarding mechanisms distribute traffic "uniformly" over equal cost shortest paths. These constraints often make achieving an optimal distribution of traffic impossible. In this paper, we propose and evaluate an approach that can realize near optimal traffic distribution without changes to routing protocols and forwarding mechanisms. In addition, we explore the tradeoff that exists between performance and the configuration overhead that our solution requires. The paper's contributions are in formulating and evaluating an approach to traffic engineering in IP networks that achieves near-optimal performance while preserving the existing infrastructure.     

Evaluation of QoS differentiation mechanisms in asynchronous bufferless optical packet-switched networks

Existing quality of service differentiation schemes for today's IP over point-to-point optical WDM networks take advantage of electronic RAM to implement traffic management algorithms in order to isolate the service classes. Since practical optical RAM is not available, these techniques are not suitable for a future all-optical network. Hence, new schemes are needed to support QoS differentiation in optical packet-switched (OPS) networks. In this article we first present an overview of existing QoS differentiation mechanisms suitable for asynchronous bufferless OPS. We then compare the performance of the presented schemes and qualitatively discuss implementation issues, in order to evaluate the mechanisms. In particular, we present an evaluation framework, which quantifies the throughput reduction observed when migrating from a best effort scenario to a service-differentiated scenario. Our study shows that preemption-based schemes have the best performance, but also the highest implementation complexity.     

An Efficient RSVP–Mobile IP Interworking Scheme

During the past years, several attempts have been made to develop functionality for mobility management support and QoS provision in the realm of the IP networks. Since IP was not designed to support such functionality, new protocols have been specified and implemented to tackle these issues. Mobile IP is currently the dominant protocol that allows users to retain connectivity while roaming in IP networks. RSVP (Resource reSerVation Protocol) is a well established protocol for reserving network resources to support QoS requirements. These protocols, when deployed separately, can work quite efficiently. However, if their functionality is combined, several inefficiencies arise in terms of QoS deterioration and misuse of the network resources. To minimize these inefficiencies, we propose a new approach that limits mobility and QoS related network modifications inside the domain, in which a user moves. The deployment of our scheme enhances the network resource usage efficiency, while minimizing the duration of the QoS deterioration experienced after a terminal movement. To quantify the advantages of our proposal, we have developed an analytical and a simulation model that we also present in this paper.     

QoS provision in wireless access networks: a routing perspective considering mobility

Future wireless communications are expected to provide mobile users access to the desired service with the appropriate quality at any place. The essential elements for assembling such a vision are mobility, quality of service (QoS) provision and scalability, which are expected to be merged into the design process of wireless access networks. Internet mobility support is currently entering a mature phase in which scalable solutions provide low loss or even seamless handovers in cellular and heterogeneous mobile environments. Wireless and mobile QoS architectures extend the equivalent Internet approaches in order to accommodate the requirements associated with the presence of wireless links and mobility. Nevertheless, none of the popular mobility proposals combined with wireless and mobile QoS architectures encounter QoS in the routing function, leaving the QoS provision underutilized. QoS routing (QoSR) complements existing QoS architectures, enhancing application performance especially in the case of congestion, while providing efficient resource management. However, QoSR was originally designed for fixed IP networks without taking mobility into account. This paper investigates the interaction of QoSR in wireless access networks, identifying key points for the efficient cooperation with mobility and existing QoS architectures. Copyright © 2009 John Wiley & Sons, Ltd.     

UPS: Universal Protocol Stack for emerging wireless networks

Recent devices developed for emerging wireless networks, such as 4G cellular networks, wireless mesh networks, and mobile ad hoc networks, support multiple communication substrates and require execution of multiple protocols within a layer, which cannot be supported efficiently by traditional, layered protocol stack approaches. While cross-layer approaches can be designed to support these new requirements, the lack of modularity makes cross-layer approaches inflexible and hence difficult to adapt for future devices and protocols. Thus, there is a need for a new protocol architecture to provide universal support for cross-layer interactions between layers, while also supporting multiple communication substrates and multiple protocols within a stack. In this paper, we propose Universal Protocol Stack (UPS), which provides such support in a modular way through packet-switching, information-sharing and memory management. To show that UPS is realizable with very low overhead and that it enables concurrent and independent execution of protocols of the same stack layer, first, we present a wireless sensor network test-bed evaluation, where UPS is implemented in TinyOS and installed on individual sensor motes. Two cross-layer routing protocols are implemented and evaluated with UPS and without UPS. We also implemented UPS in the OPNET simulator, where the IP (e.g., Routing Information Protocol (RIP)) and AODV routing protocols are executed concurrently to support networks with both static and mobile wireless nodes. Our implementation shows that the overhead incurred to implement UPS is very low, and little or no modification is required to adapt existing protocols to the UPS framework. Both studies also show the advantage of enabling concurrent protocol execution within a stack layer, improving the successful packet delivery ratio or the total number of packets sent for the investigated scenarios.     

Evaluating the impact of stale link state on quality-of-servicerouting

Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage by selecting paths based on connection traffic parameters and link load information. However, distributing link state imposes significant bandwidth and processing overhead on the network. This paper investigates the performance tradeoff between protocol overhead and the quality of the routing decisions in the context of the source-directed link state routing protocols proposed for IP and ATM networks. We construct a detailed model of QoS routing that parameterizes the path-selection algorithm, link-cost function, and link state update policy. Through extensive simulation experiments with several network topologies and traffic patterns, we uncover the effects of stale link state information and random fluctuations in traffic load on the routing and setup overheads. We then investigate how inaccuracy of link state information interacts with the size and connectivity of the underlying topology. Finally, we show that tuning the coarseness of the link-cost metric to the inaccuracy of underlying link state information reduces the computational complexity of the path-selection algorithm without significantly degrading performance. This work confirms and extends earlier studies, and offers new insights for designing efficient quality-of-service routing policies in large networks     

Mobile flow-aware networks for mobility and QoS support in the IP-based wireless networks

As the volume of mobile traffic consisting of video, voice, and data is rapidly expanding, a challenge remains with the mobile transport network, which must deliver data traffic to mobile devices without degrading the service quality. Since every Internet service holds its own service quality requirements, the flow-aware traffic management in fine granularity has been widely investigated to guarantee Quality of Service (QoS) in the IP networks. However, the mobile flow-aware management has not been sufficiently developed yet because of the inherent constraints of flow routing in the mobile networks regarding flow-aware mobility and QoS support. In this paper, we propose a flow-aware mobility and QoS support scheme called mobile flow-aware network (MFAN) for IP-based wireless mobile networks. The proposed scheme consists of dynamic handoff mechanisms based on QoS requirements per flow to reduce the processing overhead of the flow router while ensuring QoS guarantee to mobile flows. The performance analyses of the proposed scheme demonstrate that MFAN successfully supports the mobile flow traffic delivery while satisfying the QoS requirement of flows in the wireless mobile IP networks.     

QUORUM—Quality of Service in Wireless Mesh Networks

Wireless mesh networks (WMNs) can provide seamless broadband connectivity to network users with low setup and maintenance costs. To support next-generation applications with real-time requirements, however, these networks must provide improved quality of service guarantees. Current mesh protocols use techniques that fail to accurately predict the performance of end-to-end paths, and do not optimize performance based on knowledge of mesh network structures. In this paper, we propose QUORUM, a routing protocol optimized for WMNs that provides accurate QoS properties by correctly predicting delay and loss characteristics of data traffic. QUORUM integrates a novel end-to-end packet delay estimation mechanism with stability-aware routing policies, allowing it to more accurately follow QoS requirements while minimizing misbehavior of selfish nodes.     

Simple,efficient location‐based routing for data center network using IP address hierarchy

Increasing demand and sophistication of applications deployed on data centers resulted in various designs for data center networks (DCNs). One of the major challenges in the design of DCNs is the design of routing protocol that scales to support millions of servers that a typical DCN hosts. Many alternative routing protocols are proposed to overcome the scalability problem of conventional routing protocols such as Open Shortest Path First and Routing Information Protocol. These alternative protocols that use topology characteristics of DCN are broadly classified as source routing and location‐based routing. In the process of fixing the scalability problem, these protocols introduced additional complexities such as large network control overhead and reprogramming of network elements. The extra control overhead in these protocols is the result of their effort to determine the relative location of the end hosts in a given topology. Further, existing location‐based routing is not entirely location based and covers only the latter half of a route. In our work, we present a new location‐based routing based on IP address hierarchy that (a) does not need any additional network control plane and management planes, (b) deployable on proven network technologies, and (c) covers entire path of the route. We establish the correlation between topology design and address assignments that helps determining the location of an end host directly from the address assigned to it. We demonstrate our proposed location‐based routing on an existing proven architecture for DCN, BCube‐IP and on our proposed architecture 4‐4, 1‐4. We give proper justification for proposing 4‐4, 1‐4, a better design for our proposed location‐based routing. Copyright © 2016 John Wiley & Sons, Ltd.     

A QoS Routing Protocol with Bandwidth Allocation in Multichannel Ad Hoc Networks

Mobile multimedia applications have recently generated much interest in mobile ad hoc networks (MANETs) supporting quality-of-service (QoS) communications. Multiple non-interfering channels are available in 802.11 and 802.15 based wireless networks. Capacity of such channels can be combined to achieve higher QoS performance than for single channel networks. The capacity of MANETs can be substantially increased by equipping each network node with multiple interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channel assignment, and routing protocols are required to utilize the increased bandwidth in multichannel MANETs. In this paper, we propose an on-demand routing protocol M-QoS-AODV in multichannel MANETs that incorporates a distributed channel assignment scheme and routing discovery process to support multimedia communication and to satisfy QoS bandwidth requirement. The proposed channel assignment scheme can efficiently express the channel usage and interference information within a certain range, which reduces interference and enhances channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel MANETs over existing routing algorithms. Simulation results show that the proposed M-QoS-AODV protocol can effectively increase throughput and reduce delay, as compared to AODV and M-AODV-R protocols.     

A model of user behavior in multi-service priced networks

Today’s IP networks must be able to serve many applications with different needs and goals and the traditional best effort approach is not sufficient to provide the various degrees of Quality of Service (QoS) required by these heterogeneous applications. In previous work, we have proposed a user-centric QoS management scheme within a game theoretic framework. In this paper, our goal is to model user behavior and to study the relationship between network performance, user satisfaction and choice of service class. Our results show that our user behavior model is realistic in the context of a user-controlled QoS: users can obtain a satisfactory service by choosing their service classes themselves. Their satisfaction is higher when they can choose their service classes dynamically rather than with a static allocation. The model also points out the importance of user actions on network stability.