By Topic

Network and Service Management, IEEE Transactions on

Issue 3 • Date September 2013

Filter Results

Displaying Results 1 - 8 of 8
  • Table of contents

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • Graph-Based Authentication Design for Color-Depth-Based 3D Video Transmission over Wireless Networks

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

    3D video applications such as 3D-TV and 3D games have become more and more popular in recent years. These applications raised significant challenges in the media security, processing and transmissions. Especially, when 3D videos are delivered over wireless networks, the video streaming suffers the potential malicious attacks. One of the most important security challenging issues is how to guarantee the integrity of media content over error-prone wireless networks. To address this challenge, in the paper, we for the first time propose an authentication approach for 3D video transmission over wireless networks, which can improve the reconstructed media quality under error-prone wireless environment with lower authentication overheads and energy consumption. The proposed method is based on color-depth 3D video coding approach, which can save bandwidth, be tolerable to packet losses and thus satisfy the users' Quality of Experience (QoE) requirements. Our major contribution in this paper includes: (1) designing a joint source-channel-authentication coding framework for color-depth-based 3D video transmission; (2) proposing a media quality prediction model for color-depth-based 3D video transmission; (3) developing optimization for graph-based authentication on 3D video transmission to improve reconstructed media quality, reduce authentication overheads and energy consumption. Experimental results demonstrated the effectiveness of our proposed solutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent-Based Self-Adaptable Context-Aware Network Vulnerability Assessment

    Page(s): 255 - 270
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2216 KB) |  | HTML iconHTML  

    Immunology inspired computer security has attracted enormous attention as its potential impacts on the next generation service-oriented network operation system. In this paper, we propose a new agent-based threat awareness assessment strategy inspired by the human immune system to dynamically adapt against attacks. Specifically, this approach is based on the dynamic reconfiguration of the file access right for system calls or logs (e.g., file rewritability) with balanced adaptability and vulnerability. Based on an information-theoretic analysis on the coherently associations of adaptability, autonomy as well as vulnerability, a generic solution is suggested to break down their coherent links. The principle is to maximize context-situation awared systems' adaptability and reduce systems' vulnerability simultaneously. Experimental results show the efficiency of the proposed biological behaviour-inspired vulnerability awareness system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time Scheduling with Security Enhancement for Packet Switched Networks

    Page(s): 271 - 285
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (480 KB) |  | HTML iconHTML  

    Real-time network applications depend on schedulers to guarantee the quality of service (QoS). Conventional real-time schedulers focus on the timing constraints but are much less effective in satisfying the security requirements. In this paper, we propose an adaptive security-aware scheduling system for packet switched networks using a real-time multi-agent design model. The proposed system combines real-time scheduling with security service enhancement. The scheduling unit uses the differentiated-earliest-deadline-first (Diff-EDF) scheduler and the security enhancement scheme adopts a congestion control mechanism. The required QoS is guaranteed for different types (audio and video) of real-time data flows, while the packet security levels are adaptively enhanced according to the feedbacks from the congestion control module. Compared with the IPsec protocol, the proposed scheme reduces the number of pending packets at the destinations. In implementation, the proposed scheme can overload the priority code point and the virtual-LAN identifier fields of the IEEE 802.1Q frame format, hence eliminating the overhead of the security associations performed by the IPsec protocol. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Cache Management in Information-Centric Networks

    Page(s): 286 - 299
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1160 KB) |  | HTML iconHTML  

    The main promise of current research efforts in the area of Information-Centric Networking (ICN) architectures is to optimize the dissemination of information within transient communication relationships of endpoints. Efficient caching of information is key to delivering on this promise. In this paper, we look into achieving this promise from the angle of managed replication of information. Management decisions are made in order to efficiently place replicas of information in dedicated storage devices attached to nodes of the network. In contrast to traditional off-line external management systems we adopt a distributed autonomic management architecture where management intelligence is placed inside the network. Particularly, we present an autonomic cache management approach for ICNs, where distributed managers residing in cache-enabled nodes decide on which information items to cache. We propose four on-line intra-domain cache management algorithms with different level of autonomicity and compare them with respect to performance, complexity, execution time and message exchange overhead. Additionally, we derive a lower bound of the overall network traffic cost for a certain category of network topologies. Our extensive simulations, using realistic network topologies and synthetic workload generators, signify the importance of network wide knowledge and cooperation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In a Telco-CDN, Pushing Content Makes Sense

    Page(s): 300 - 311
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (476 KB) |  | HTML iconHTML  

    The exploding HD video streaming traffic calls for deploying content servers deeper inside network operators' infrastructures. Telco-CDN are new content distribution services that are managed by Internet Service Providers (ISP). Since the network operator controls both the infrastructure and the content delivery overlay, it is in a position to engineer telco-CDN so that networking resources are optimally utilized. In this paper, we show the following two findings: 1. it is possible to implement an efficient algorithm for the placement of video chunks into a telco-CDN. We present an algorithm, which is based on a genetic algorithm implemented on the MapReduce framework. We show that, for a national VoD service, computing a quasi-optimal placement is possible. 2. such push strategy makes sense because it allows to actually take into account fine-grain traffic management strategies on the underlying infrastructure. Our proposal re-opens the debate about the relevance of such "push" approach (where the manager of telco-CDN proactively pushes video content into servers) versus the traditional caching approach (where the content is pulled to the servers from requests of clients). Our proposal of a quasi-optimal tracker enables fair comparisons between both approaches for most traffic engineering policies. We illustrate the interest of our proposal in the context of a major European Telco-CDN with real traces from a popular Video-on-Demand (VoD) service. Our experimental results show that, given a perfect algorithm for predicting user preferences, our placement algorithm is able to keep aligned with LRU caching in terms of the traditional hit-ratio, but the workload on some troubled links (e.g., over-used links) in a push-based strategy is significantly alleviated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cloud Analytics for Capacity Planning and Instant VM Provisioning

    Page(s): 312 - 325
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (702 KB) |  | HTML iconHTML  

    The popularity of cloud service spurs the increasing demands of virtual resources to the service vendors. Along with the promising business opportunities, it also brings new technique challenges such as effective capacity planning and instant cloud resource provisioning. In this paper, we describe our research efforts on improving the service quality for the capacity planning and instant cloud resource provisioning problem. We first formulate both of the two problems as a generic cost-sensitive prediction problem. Then, considering the highly dynamic environment of cloud, we propose an asymmetric and heterogeneous measure to quantify the prediction error. Finally, we design an ensemble prediction mechanism by combining the prediction power of a set of prediction techniques based on the proposed measure. To evaluate the effectiveness of our proposed solution, we design and implement an integrated prototype system to help improve the service quality of the cloud. Our system considers many practical situations of the cloud system, and is able to dynamically adapt to the changing environment. A series of experiments on the IBM Smart Cloud Enterprise (SCE) trace data demonstrate that our method can significantly improve the service quality by reducing the resource provisioning time while maintaining a low cloud overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Bin Packing Heuristic for On-Line Service Placement and Performance Control

    Page(s): 326 - 339
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (663 KB) |  | HTML iconHTML  

    The ever-increasing size and complexity of cloud computing, data centers, virtualization, web services, and other forms of distributed computing make automated and effective service management increasingly important. This article treats the service placement problem as a novel generalization of the on-line vector packing problem. This generalization of the service placement problem does not require a priori knowledge of the service resource profiles, allows for resource profiles to change over time, and allows services to be moved once placed on a server. An on-line self-organizing model profiles resource supplies and demands arranging services in a placement based on their resulting quality rating. A policy-driven asymmetric matrix norm quantifies the quality of the placement allowing for administrative preferences regarding service performance versus service inclusion. Service resource usage profiles' variations cause changes in their assigned placement quality; forcing new, better server placements to be found. Because some placements perform better, a proportional integral derivative controller for performance feedback adjusts the services' actual profile according to service's individual response times. This large scale system autonomically organizes placement of services in response to changes in demand and network disruptions. This article presents theorems which demonstrate the theoretical basis for the model. The article includes empirical results from the implementation of this model in a self-organizing testbed of web servers and services. 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