By Topic

Network and Service Management, IEEE Transactions on

Issue 3 • Date September 2012

Filter Results

Displaying Results 1 - 12 of 12
  • Table of contents

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (43 KB)  
    Freely Available from IEEE
  • Mobility Management in Wireless Mesh Networks Utilizing Location Routing and Pointer Forwarding

    Page(s): 226 - 239
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (870 KB) |  | HTML iconHTML  

    We propose and analyze LMMesh: a routing-based location management scheme with pointer forwarding for wireless mesh networks. LMMesh integrates routing-based location update and pointer forwarding by exploiting the advantages of both methods, while avoiding their drawbacks. It considers the effect of the integration on the overall network cost incurred by location management and packet delivery. By exploring the tradeoff between the service cost for packet delivery and the signaling cost for location management, LMMesh identifies the optimal protocol setting that minimizes the overall network cost on a per-user basis for each individual mesh client, when given a set of parameter values characterizing the specific mobility and service characteristics of the mesh client. We develop an analytical model based on stochastic Petri net techniques for analyzing the performance of LMMesh and a computational procedure for calculating the overall network cost. Through a comparative performance study, we show that LMMesh outperforms both pure routing-based location management schemes and pure pointer forwarding schemes, as well as traditional tunnel-based location management schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IP/MPLS-over-OTN-over-DWDM Multilayer Networks: An Integrated Three-Layer Capacity Optimization Model, a Heuristic, and a Study

    Page(s): 240 - 253
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1981 KB) |  | HTML iconHTML  

    Multilayer network design has received significant attention in current literature. Despite this, the explicit modeling of IP/MPLS over OTN over DWDM in which the OTN layer is specifically considered has not been addressed before. This architecture has been identified as promising that bridges integration and interaction between the IP and optical layers. In this paper, we present an integrated capacity optimization model for network planning of such multilayer networks that consider the OTN layer as a distinct layer with its unique technological sublayer constraints. We develop a heuristic algorithm to solve this model for large networks. Finally, we provide a detailed numeric study that considers various cost parameter values of each layer in the network. We analyze the impact of each layer's cost parameter values on neighboring layers and overall network cost. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An OSPF-Integrated Routing Strategy for QoS-Aware Energy Saving in IP Backbone Networks

    Page(s): 254 - 267
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (465 KB) |  | HTML iconHTML  

    This paper deals with an energy saving routing solution, called Energy Saving IP Routing (ESIR), to be applied in an IP network. ESIR operation is integrated with Open Shorthest Path First (OSPF) protocol and allows the selection of the links to be switched off so that the negative effects of the IP topology reconfiguration procedures are avoided. The basic mechanisms which ESIR is based on are the concepts of SPT exportation and move. These mechanisms allow to share a Shortest Path Tree (SPT) between neighbor routers, so that the overall set of active network links can be reduced. Properties of moves are defined and the energy saving problem in an IP network is formulated as the problem of finding the Maximum Set of Compatible Moves (MSCM). The MSCM problem is investigated in two steps: firstly, a relaxed version of the problem, named basic MSCM problem, is considered in which QoS requirements are neglected; in the second step, the solution of the full problem, named QoS-aware MSCM problem, is faced. We prove that the basic MSCM problem can be formulated as the well-known Maximum Clique Problem in a graph; instead the QoS-aware MSCM introduces a condition equivalent to the Knapsack problem. ILP formulations to solve both the problems are given and heuristics to solve them in practical cases are proposed. The performance evaluation shows that in a real ISP network scenario ESIR is able to switch off up to 30% of network links by exploiting over-provisioning adopted by operators in the network resource planning phase and typical daily traffic trend. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Measurement Study on Potential Inter-Domain Routing Diversity

    Page(s): 268 - 278
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    In response to Internet emergencies, Internet resiliency is investigated directly through an autonomous system (AS) level graph inferred from policy-compliant BGP paths or/and traceroute paths. Due to policy-driven inter-domain routing, the physical connectivity does not necessarily imply network reachability in the AS-level graph, i.e., many physical paths are not visible by the inter-domain routing protocol for connectivity recovery during Internet outages. We call the invisible connectivity at the routing layer, which can be quickly restored for recovering routing failures by simple configurations, as the potential routing diversities. In this paper, we evaluate two kinds of potential routing diversities, which are recognized as Internet eXchange Points (IXPs) participant reconnection and peering policy relaxation. Using the most complete dataset containing AS-level map and IXP participants that we can achieve, we successfully evaluate the ability of potential routing diversity for routing recovery during different kinds of Internet emergencies. Encouragingly, our experimental results show that 40% to 80% of the interrupted network pairs can be recovered on average beyond policy-compliant paths, with rich path diversities and a little traffic shifts. Thus, this paper implies that the potential routing diversities are promising venues to address Internet failures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Impact of Jitter on Traffic Flow Optimization in Communication Networks

    Page(s): 279 - 292
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (498 KB) |  | HTML iconHTML  

    Current network planning and design methods use the average delay, packet loss and throughput as metrics to optimize the network cost and performance. New multimedia applications, on the other hand, also have critical jitter requirements that are not taken into account by these methods. Here, we explore the impact on the network performance of adding these jitter constraints. We use a fast jitter calculation model to solve the optimal routing problem for flows subject to jitter or delay constraints. We find that the optimal routing is very different for the two kinds of flows: They should be routed on different paths, the jitter-constrained flows should not be split on multiple paths while the opposite conclusion is true for delay-constrained flows. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing

    Page(s): 293 - 305
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (428 KB) |  | HTML iconHTML  

    It has been observed that transient failures are fairly common in IP backbone networks and there have been several proposals based on local rerouting to provide high network availability despite failures. While most of these proposals are effective in handling single failures, they either cause loops or drop packets in the case of multiple independent failures. To ensure forwarding continuity even with multiple failures, we propose Localized On-demand Link State (LOLS) routing. Under LOLS, each packet carries a blacklist, which is a minimal set of failed links encountered along its path, and the next hop is determined by excluding the blacklisted links. We show that the blacklist can be reset when the packet makes forward progress towards the destination and hence can be encoded in a few bits. Furthermore, blacklist-based forwarding entries at a router can be precomputed for a given set of failures requiring protection. While the LOLS approach is generic, this paper describes how it can be applied to ensure forwarding to all reachable destinations in case of any two link or node failures. Our evaluation of this failure scenario based on various real network topologies reveals that LOLS needs 6 bits in the worst case to convey the blacklist information. We argue that this overhead is acceptable considering that LOLS routing deviates from the optimal path by a small stretch only while routing around failures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unified Approach to Routing Protection in IP Networks

    Page(s): 306 - 319
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (355 KB) |  | HTML iconHTML  

    Routing failures are common on the Internet and routing protocols can not always react fast enough to recover from them, which usually cause packet delivery failures. To address the problem, fast reroute solutions have been proposed to guarantee reroute path availability and to avoid high packet loss after network failures. However, existing solutions are often specific to single type of routing protocol. It is hard to deploy these solutions together to protect Internet routing including both intra- and inter-domain routing protocols because of their individual computational and storage complexity. Moreover, most of them can not provide effective protection for traffic over failed links, especially for the bi-directional traffic. In this paper, we propose a unified fast reroute solution for routing protection under network failures. Our solution leverages identifier based direct forwarding to guarantee the effectiveness of routing protection and supports incremental deployment. In particular, enhanced protection cycle (e-cycle) is proposed to construct rerouting paths and to provide node and link protection for both intra- and inter-domain routing protocols. We evaluate our solution by simulations, and the results show that the solution provides 100% failure coverage for all end-to-end routing paths with approximately two extra Forwarding Information Base (FIB) entries. Furthermore, we report an experimental evaluation of the proposed solution in operational networks. Our results show that the proposed solution effective provides failure recovery and does not introduce processing overhead to packet forwarding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective Acquaintance Management based on Bayesian Learning for Distributed Intrusion Detection Networks

    Page(s): 320 - 332
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (546 KB) |  | HTML iconHTML  

    An effective Collaborative Intrusion Detection Network (CIDN) allows distributed Intrusion Detection Systems (IDSes) to collaborate and share their knowledge and opinions about intrusions, to enhance the overall accuracy of intrusion assessment as well as the ability of detecting new classes of intrusions. Toward this goal, we propose a distributed Host-based IDS (HIDS) collaboration system, particularly focusing on acquaintance management where each HIDS selects and maintains a list of collaborators from which they can consult about intrusions. Specifically, each HIDS evaluates both the false positive (FP) rate and false negative (FN) rate of its neighboring HIDSes' opinions about intrusions using Bayesian learning, and aggregates these opinions using a Bayesian decision model. Our dynamic acquaintance management algorithm allows each HIDS to effectively select a set of collaborators. We evaluate our system based on a simulated collaborative HIDS network. The experimental results demonstrate the convergence, stability, robustness, and incentive-compatibility of our system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LatLong: Diagnosing Wide-Area Latency Changes for CDNs

    Page(s): 333 - 345
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (503 KB) |  | HTML iconHTML  

    Minimizing user-perceived latency is crucial for Content Distribution Networks (CDNs) hosting interactive services. Latency may increase for many reasons, such as interdomain routing changes and the CDN's own load-balancing policies. CDNs need greater visibility into the causes of latency increases, so they can adapt by directing traffic to different servers or paths. In this paper, we propose a tool for CDNs to diagnose large latency increases, based on passive measurements of performance, traffic, and routing. Separating the many causes from the effects is challenging. We propose a decision tree for classifying latency changes, and determine how to distinguish traffic shifts from increases in latency for existing servers, routers, and paths. Another challenge is that network operators group related clients to reduce measurement and control overhead, but the clients in a region may use multiple servers and paths during a measurement interval. We propose metrics that quantify the latency contributions across sets of servers and routers. Based on the design, we implement the LatLong tool for diagnosing large latency increases for CDN. We use LatLong to analyze a month of data from Google's CDN, and find that nearly 1% of the daily latency changes increase delay by more than 100 msec. Note that the latency increase of 100 msec is significant, since these are daily averages over groups of clients, and we only focus on latency-sensitive traffic for our study. More than 40% of these increases coincide with interdomain routing changes, and more than one-third involve a shift in traffic to different servers. This is the first work to diagnose latency problems in a large, operational CDN from purely passive measurements. Through case studies of individual events, we identify research challenges for managing wide-area latency for CDNs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Estimated Delay Based Association Policy for Web Browsing in a Multirate WLAN

    Page(s): 346 - 358
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (422 KB) |  | HTML iconHTML  

    Station-Access Point (STA-AP) association is an important function in IEEE 802.11 Wireless LAN (WLAN) management. We obtain an association policy that can be implemented in centralized WLAN management devices, or in STAs, by taking into account explicitly two aspects of practical importance: (a) TCP-controlled short file downloads interspersed with read times (motivated by web browsing), and (b) different STAs associated with an Access Point (AP) at possibly different rates (depending on distance from the AP). Our approach is based on two steps. First, we consider an analytical model to obtain the aggregate AP throughput for long TCP-controlled file downloads when STAs are associated at k different rates r1, r2, ..., rk; this extends earlier work in the literature. Second, we present a 2-node closed queueing network model to approximate the expected average-sized file download time for a user who shares the AP with other users associated at a multiplicity of rates. These analytical results motivate the proposed association policy, called the Estimated Delay based Association (EDA) policy: Associate with the AP at which the expected file download time is the least. Simulations indicate that for a web-browsing type traffic scenario, EDA performs substantially better than other policies that have been proposed earlier. Crucially, the improved performance is sustained even in realistic evaluation scenarios, where the assumptions underpinning the analytical model do not hold. To the best of our knowledge, this is the first work that proposes an association policy tailored specifically for web browsing. Apart from this, our analytical results could be of independent interest. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Functionality Placement for Multiplay Service Provider Architectures

    Page(s): 359 - 372
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (342 KB) |  | HTML iconHTML  

    The proliferation of multiplay services is creating design dilemmas for service providers, related to where certain key networking functionality should be placed. For example, service providers need to know whether to distribute more network intelligence closer to the subscriber or cluster it in a central location. In view of this, we quantify the cost differences among service provider architectures, identified based on the functionality distribution (centralized vs. distributed, clustered vs. unclustered and single vs. multi edge). For this purpose, we formulate a modular mixed-integer programming model based on a set of close-to-real-case scenarios. Given the complexity of such problems, we propose methodologies that can reduce the number of locations. Our results indicate that distributing the IP intelligence and the video replication is preferable. Moreover, deploying edge systems with faster backplane has little benefit in the aggregation network, and providers should rather invest in faster interfaces. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief

Rolf Stadler
Laboratory for Communication Networks
KTH Royal Institute of Technology
Stockholm
Sweden
stadler@kth.se