By Topic

Network and Service Management, IEEE Transactions on

Issue 4 • Date December 2013

Filter Results

Displaying Results 1 - 8 of 8
  • Table of contents

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (42 KB)  
    Freely Available from IEEE
  • A Prioritized Adaptive Scheme for Multimedia Services over IEEE 802.11 WLANs

    Page(s): 340 - 355
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2319 KB)  

    IEEE 802.11e protocol enables QoS differentiation between different traffic types, but requires MAC layer support and assigns traffic with static priority. This paper proposes an intelligent Prioritized Adaptive Scheme (iPAS) to provide QoS differentiation for heterogeneous multimedia delivery over wireless networks. iPAS assigns dynamic priorities to various streams and determines their bandwidth share by employing a probabilistic approach-which makes use of stereotypes. Unlike existing QoS differentiation solutions, the priority level of individual streams in iPAS is variable and considers service types and network delivery QoS parameters (i.e. delay, jitter, and packet loss rate). A bandwidth estimation technique is adopted to provide network conditions and the IEEE 802.21 framework is used to enable control information exchange between network components without modifying existing MAC protocol. Simulations and real life tests demonstrate how better results are obtained when employing iPAS than when either IEEE 802.11 DCF or 802.11e EDCA mechanisms are used. The iPAS key performance benefits are as follows: 1) better fairness in bandwidth allocation; 2) higher throughput than 802.11 DCF and 802.11e EDCA with up to 38% and 20%, respectively; 3) enables definite throughput and delay differentiation between streams. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Virtual Network Embedding: Node-Link Formulation

    Page(s): 356 - 368
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (622 KB)  

    Network Virtualization is claimed to be a key component of the Future Internet, providing the dynamic support of different networks with different paradigms and mechanisms in the same physical infrastructure. A major challenge in the dynamic provision of virtual networks is the efficient embedding of virtual resources into physical ones. Since this problem is known to be NP-hard, previous research focused on designing heuristic-based algorithms; most of them either do not consider a simultaneous embedding of virtual nodes and virtual links, or apply link-path formulation, leading to non-optimal solutions. This paper proposes an integer linear programming (ILP) formulation to solve the online virtual network embedding problem as a result of an objective function striving for the minimization of resource consumption and load balancing. To this end 3 different objective functions are proposed and evaluated. This approach applies multi-commodity flow constraint to accomplish a node-link formulation that optimizes the allocation of physical network resources. This proposal is evaluated against state of the art heuristics. The performance of the heuristics related to Virtual Network (VN) request acceptance ratio is, at least, 30% below the one of the Virtual Network Embedding Node-Link Formulation (VNE-NLF) method. From the three cost functions evaluated, the Weighted Shortest Distance Path (WSDP) is the one which embeds more VNs and also requires, on average, less physical resources per embedding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pacer: A Progress Management System for Live Virtual Machine Migration in Cloud Computing

    Page(s): 369 - 382
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (366 KB) |  | HTML iconHTML  

    Live migration of virtual machines is a key management function in cloud computing. Unfortunately, no live migration progress management system exists in the state-of-theart, leading to (1) guesswork over how long a migration might take and the inability to schedule dependent tasks accordingly; (2) unacceptable application degradation when application components become split over distant cloud datacenters for an arbitrary period during migration; (3) inability to tradeoff application performance and migration time e.g. to finish migration later for less impact on application performance. Pacer is the first migration progress management system that solves these problems. Pacer's techniques are based on robust and lightweight run-time measurements of system and workload characteristics, efficient and accurate analytic models for progress predictions, and online adaptation to maintain user-defined migration objectives for coordinated and timely migrations. Our experiments on a local testbed and on Amazon EC2 show that Pacer is highly effective under a range of application workloads and network conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective Statistical Detection of Smart Confidentiality Attacks in Multi-Domain Networks

    Page(s): 383 - 397
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (822 KB)  

    The need to preserve information confidentiality among network providers has prevented the actual deployment of effective Traffic Engineering (TE) solutions for QoS-enabled end-to-end connectivity services in multi-domain multi-provider networks. The use of Path Computation Element (PCE) architecture can foster the effective implementation of TE through a centralized engine devoted to end-to-end path computations. However, despite authentication, authorization and encryption, confidentiality issues may arise due to abuses of information included in path computation replies to bogus requests issued by malicious PCEs. This paper first demonstrates the security leak allowing the exposure of intra-domain information in current inter-PCE path computation procedures. Then it proposes an anomaly-based approach, namely PCE Anomaly Detector (PAD) in order to detect malicious utilization of path computation services. The proposed PAD employs a novel double-step multi-dimensional formulation based on the Sequential Hypothesis Testing (SHT) statistical classification procedure, able to recognize a suspicious sequence of requests while aiming at inferring confidential information about other domains. PAD is extensively evaluated through simulations. Results show good performance in terms of detection capabilities while guaranteeing the trade-off between accuracy and responsiveness, minimizing false alarm occurrences. Robustness against smart attacks is also proved with respect to a comprehensive set of attack patterns and under different network load conditions. Finally, intra-domain information exposition is evaluated, showing the PAD ability to preserve confidentiality. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autonomic Prioritization of Enterprise Transactions Based on Bid-Price Controls

    Page(s): 398 - 409
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1253 KB)  

    We study the business-driven prioritization of workflows in enterprise transaction processing systems. Today, IT services are increasingly shared amongst workflows, and static prioritization is applied during phases of high system workload to mitigate the business impact of service queuing and resulting workflow response-time increase. Static prioritization rules can only be optimal for one particular workflow definition and demand mix scenario, while in practice workflow definitions are continuously re-engineered and demand varies over time. We propose a technique to automatically adapt workflow priorities aimed at minimizing overload-related costs resulting from workflow delays. We continuously align maximum service buffer lengths and bid-prices reflecting current marginal opportunity costs of invoking a shared service. New prioritization is derived by comparing expected costs when queuing a workflow with its current opportunity costs, computed as the sum of bid-prices of invoked services. Simulation outcomes based on industry data illustrate that the approach dominates standard queuing disciplines as well as static prioritization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying the Concurrent Properties in BPEL Based Web Service Composition Process

    Page(s): 410 - 424
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (751 KB)  

    The relatively new web service software paradigm involves services which are loosely coupled, highly reusable and flexible. By specifying the workflow of individual services, Web service composition enhances the ability to handle more complex business processes and provides many value-added services. In this article, we propose an extended control flow graph (XCFG) to formally model the workflow of Web service composition specified in BPEL, and corresponding techniques to verify concurrent properties, such as deadlock-free, non-conflict, and link non-redundant. XCFG can model not only the workflow of BPEL but also the synchronization control dependencies among concurrent activities. Meanwhile, each element of XCFG keeps record of related information of corresponding activity in BPEL so as to support further analysis and verification. Experimental study validates the effectiveness and efficiency of the proposed XCFG-based technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of Competition Between ISPs on the Net Neutrality Debate

    Page(s): 425 - 433
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (561 KB)  

    Network neutrality is the topic of a vivid and very sensitive debate, in both the telecommunication and political worlds, because of its potential impact in everyday life. That debate has been raised by Internet Service Providers (ISPs), complaining that content providers (CPs) congest the network with insufficient monetary compensation, and threatening to impose side payments to CPs in order to support their infrastructure costs. While there have been many studies discussing the advantages and drawbacks of neutrality, there is no game-theoretical work dealing with the observable situation of competitive ISPs in front of a (quasi-)monopolistic CP. Though, this is a typical situation that is condemned by ISPs, and, according to them, another reason of the non-neutrality need. We develop and analyze here a model describing the relations between two competitive ISPs and a single CP, played as a three-level game corresponding to three different time scales. At the largest time scale, side payments (if any) are determined. At a smaller time scale, ISPs decide their (flat-rate) subscription fee (toward users), then the CP chooses the (flat-rate) price to charge users. Users finally select their ISP (if any) using a price-based discrete choice model, and decide whether to also subscribe to the CP service. The game is analyzed by backward induction. As a conclusion, we obtain among other things that non-neutrality may be beneficial to the CP, and not necessarily to ISPs, unless the side payments are decided by ISPs. 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