By Topic

Network and Service Management, IEEE Transactions on

Issue 2 • Date June 2014

Filter Results

Displaying Results 1 - 10 of 10
  • Table of Contents

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (106 KB)  
    Freely Available from IEEE
  • Achieving Sub-Second Downtimes in Large-Scale Virtual Machine Migrations with LISP

    Page(s): 133 - 143
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2214 KB) |  | HTML iconHTML  

    Nowadays, the rapid growth of Cloud computing services is stressing the network communication infrastructure in terms of resiliency and programmability. This evolution reveals missing blocks of the current Internet Protocol architecture, in particular in terms of virtual machine mobility management for addressing and locator-identifier mapping. In this paper, we propose some changes to the Locator/Identifier Separation Protocol (LISP) to cope with this gap. We define novel control-plane functions and evaluate them exhaustively in the worldwide public LISP testbed, involving five LISP sites distant from a few hundred kilometers to many thousands kilometers. Our results show that we can guarantee service downtime upon live virtual machine migration lower than a second across American, Asian and European LISP sites, and down to 300 ms within Europe, outperforming standard LISP and legacy triangular routing approaches in terms of service downtime, as a function of datacenter-datacenter and client-datacenter distances. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SeLeCT: Self-Learning Classifier for Internet Traffic

    Page(s): 144 - 157
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (475 KB) |  | HTML iconHTML  

    Network visibility is a critical part of traffic engineering, network management, and security. The most popular current solutions - Deep Packet Inspection (DPI) and statistical classification, deeply rely on the availability of a training set. Besides the cumbersome need to regularly update the signatures, their visibility is limited to classes the classifier has been trained for. Unsupervised algorithms have been envisioned as a viable alternative to automatically identify classes of traffic. However, the accuracy achieved so far does not allow to use them for traffic classification in practical scenario. To address the above issues, we propose SeLeCT, a Self-Learning Classifier for Internet Traffic. It uses unsupervised algorithms along with an adaptive seeding approach to automatically let classes of traffic emerge, being identified and labeled. Unlike traditional classifiers, it requires neither a-priori knowledge of signatures nor a training set to extract the signatures. Instead, SeLeCT automatically groups flows into pure (or homogeneous) clusters using simple statistical features. SeLeCT simplifies label assignment (which is still based on some manual intervention) so that proper class labels can be easily discovered. Furthermore, SeLeCT uses an iterative seeding approach to boost its ability to cope with new protocols and applications. We evaluate the performance of SeLeCT using traffic traces collected in different years from various ISPs located in 3 different continents. Our experiments show that SeLeCT achieves excellent precision and recall, with overall accuracy close to 98%. Unlike state-of-art classifiers, the biggest advantage of SeLeCT is its ability to discover new protocols and applications in an almost automated fashion. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-the-Fly Capture and Replay Mechanisms for Multi-Port Network Devices in Operational Networks

    Page(s): 158 - 171
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1660 KB) |  | HTML iconHTML  

    Testing network devices in a live environment is desirable due to its reality. However, the defects are not reproducible, and the network connectivity will be broken if the device is down. For effective defect reproduction from real traffic, we design a new mechanism, which allows the device under test (DUT) to be automatically online/offline, and supports multi-port replay for multi-port network devices with an OpenFlow switch. The defect traces are captured when the DUT is online. When a DUT failure is detected, the DUT will be offline, and the defect-triggering traces will be replayed to identify the defect. For efficient replay, we keep only partial payloads in a reduced number of packets in the defect traces that are sufficient to trigger the defects. For defect identification, reduction based on a binary search algorithm is presented to deal with the defects caused by payload anomalies and by overloading. The downsizing ratios in the cases of payload anomalies and overloading are up to 98.8% and 96%, respectively. The minimum outage time of the failover during the DUT failure is obtained when the check interval is 1 second and the number of tolerable consecutive failures is 2. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Backbone VLAN Identifier (BVID) Allocation in 802.1Qay Provider Backbone Bridged — Traffic Engineered Networks

    Page(s): 172 - 187
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2626 KB) |  | HTML iconHTML  

    Carrier Ethernet is rapidly being deployed in the metropolitan and core segments of the transport network. One of the emerging flavors of Carrier Ethernet is the IEEE 802.1Qay PBB-TE or Provider Backbone Bridging-Traffic Engineering standard. PBB-TE relies on the assignment of a network-specific Virtual Local Area Network (VLAN) tag, called the Backbone VLAN ID or BVID that is used in conjunction with a backbone Media Access Control (MAC) address for forwarding. The 12-bit BVID along with 48-bit Backbone MAC address are used to forward an Ethernet frame. The assignment of BVIDs in a network is critical, given that there are only 4094 possible assignments, especially for those paths that are overlapping in the network graph and incident at the same destination. While the only way to scale is to reuse BVIDs, this method can lead to a complication if the same BVID is allocated to an overlapping path. To the best of our knowledge, this is the first instance of isolating this problem of limited BVID availability which rises only due to graphical overlap between services. We formulate and solve this as a constrained optimization problem. We present optimal and heuristic algorithms to solve the BVID problem. The optimal approach solves the `static' case, while the heuristic can solve both the `static' and the `dynamic' cases of the BVID allocation problem. Results show that the developed heuristics perform close to the optimal and can be used in commercial settings for both the static and dynamic cases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Economic Framework for Routing and Channel Allocation in Cognitive Wireless Mesh Networks

    Page(s): 188 - 203
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1419 KB) |  | HTML iconHTML  

    We consider wireless mesh networks with cognitive ability of the wireless routers' radios. The cognitive ability is a cost efficient manner to increase available bandwidth but requires an adaptive bandwidth management mechanism to deal with dynamics of primary users' activities. In this paper, we investigate the joint channel allocation and routing in cognitive wireless mesh networks including the channel reuse opportunities in order to improve the network performance. In particular we propose an economic framework for adaptation and control of the network resources with the goal of network profit maximization. The economic framework is based on the notion of state dependent node shadow price that is derived from Markov decision theory. The node shadow prices are used as routing metrics while their average values are used to allocate the channels among the different nodes. Simulation results illustrate the network profit maximization and effectiveness of the proposed channel allocation scheme that is integrated with a channel reuse algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a Probability Density Function Targeting Energy-Efficient Node Deployment in Wireless Sensor Networks

    Page(s): 204 - 219
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1018 KB) |  | HTML iconHTML  

    In wireless sensor networks the issue of preserving energy requires utmost attention. One primary way of conserving energy is judicious deployment of sensor nodes within the network area so that the energy flow remains balanced throughout the network and prevents the problem of occurrence of energy holes. Firstly, we have analyzed network lifetime, found node density as the parameter which has significant influence on network lifetime and derived the desired parameter values for balanced energy consumption. Then to meet the requirement of energy balancing, we have proposed a probability density function (PDF), derived the PDF's intrinsic characteristics and shown its suitability to model the network architecture considered for the work. A node deployment algorithm is also developed based on this PDF. Performance of the deployment scheme is evaluated in terms of coverage-connectivity, energy balance and network lifetime. In qualitative analysis, we have shown the extent to which our proposed PDF has been able to provide desired node density derived from the analysis on network lifetime. Finally, the scheme is compared with three existing deployment schemes based on various distributions. Simulation results confirm our scheme's supremacy over all the existing schemes in terms of all the three performance metrics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Aesop Approach for Semantic-Based End-User Service Optimization

    Page(s): 220 - 234
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2761 KB) |  | HTML iconHTML  

    The need to autonomically optimize end-user service experience in near real time has been identified in the literature in recent years. Management systems that monitor end-user service session context exist but approaches that estimate end-user service experience from session context do not analyze the compliance of that experience with user expectations. Approaches that optimize end-user service delivery are not applicable to arbitrary services; they either optimize specific service types or use general mechanisms that do not consider service experience. The lack of a holistic model for end-user service management is a barrier to autonomic end-user service optimization. This paper presents Aesop, an approach addressing autonomic optimization of end-user service delivery using semantic-based techniques. Its knowledge base uses the End-User Service Analysis and Optimization ontology, which models the end-user service management domain and partitions knowledge that varies over time for efficient access. The Aesop Engine executes an autonomic loop in near real time, which runs semantic algorithms to monitor sessions, analyze their compliance with expectations, and plan and execute optimizations on service delivery networks. The algorithms are efficient because they operate on small partitioned subsets of the Knowledge Base held as separate self-contained models at run time. An Aesop implementation was evaluated on a home area network test bed where compliance of service sessions with expectations when optimization was active was compared with compliance of an identical set of sessions when optimization was inactive. Significant improvements were observed on compliance levels of high priority sessions in all experimental scenarios, with compliance levels more than doubled in some cases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Leveraging MPLS Backup Paths for Distributed Energy-Aware Traffic Engineering

    Page(s): 235 - 249
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1831 KB) |  | HTML iconHTML  

    Backup paths are usually pre-installed by network operators to protect against single link failures in backbone networks that use multi-protocol label switching. This paper introduces a new scheme called Green Backup Paths (GBP) that intelligently exploits these existing backup paths to perform energy-aware traffic engineering without adversely impacting the primary role of these backup paths of preventing traffic loss upon single link failures. This is in sharp contrast to most existing schemes that tackle energy efficiency and link failure protection separately, resulting in substantially high operational costs. GBP works in an online and distributed fashion, where each router periodically monitors its local traffic conditions and cooperatively determines how to reroute traffic so that the highest number of physical links can go to sleep for energy saving. Furthermore, our approach maintains quality-of-service by restricting the use of long backup paths for failure protection only, and therefore, GBP avoids substantially increased packet delays. GBP was evaluated on the point-of-presence representation of two publicly available network topologies, namely, GÉANT and Abilene, and their real traffic matrices. GBP was able to achieve significant energy saving gains, which are always within 15% of the theoretical upper bound. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance–Cost Trade-Off Strategic Evaluation of Multipath TCP Communications

    Page(s): 250 - 263
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2094 KB) |  | HTML iconHTML  

    Today's mobile terminals have several access network interfaces. New protocols have been proposed during the last few years to enable the concurrent use of multiple access paths for data transmission. In practice, the use of different access technologies is subject to different interconnection costs, and mobile users have preferences on interfaces jointly depending on performance and cost factors. There is therefore an interest in defining “light” multipath communication policies that are less expensive than greedy unconstrained ones such as with basic multipath TCP (MP-TCP) and that are strategically acceptable assuming a selfish endpoint behavior. With this goal, we analyze the performance-cost trade-off of multi-homed end-to-end communications from a strategic standpoint. We model the communication between multi-homed terminals as a specific non-cooperative game to achieve performance-cost decision frontiers. The resulting potential game always allows selecting multiple equilibria, leading to a strategic load-balancing distribution over the available interfaces, possibly constraining their use with respect to basic MP-TCP. By simulation of a realistic three-interface scenario, we show how the achievable performance is bound by the interconnection cost; we show that we can halve the interconnection cost with respect to basic (greedy) MP-TCP while offering double throughputs with respect to single-path TCP. Moreover, we evaluate the compromise between keeping or relaxing strategic constraints in a coordinated MP-TCP context. 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