Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top

2006 | Book

Traffic Modeling and Classification Using Packet Train Length and Packet Train Size Read chapter Read first chapter

Autonomic Principles of IP Operations and Management

6th IEEE International Workshop on IP Operations and Management, IPOM 2006, Dublin, Ireland, October 23-25, 2006. Proceedings

Editors: Gerard Parr, David Malone, Mícheál Ó Foghlú

Publisher: Springer Berlin Heidelberg

Book Series : Lecture Notes in Computer Science

Part of: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Login to get access
insite
SEARCH

About this book

th This volume presents the proceedings of the 6 IEEE International Workshop on IP Operations and Management (IPOM 2006), which was held as part of Manweek 2006 rd th in Dublin, Ireland from October 23 to 25 , 2006. In line with its reputation as one ofthe pre-eminent venues for the discussion and debate of advances of management of IP networks and services, the 2006 iteration of IPOM brought together an international audience of researchers and practitioners from both industry and academia. The overall theme of Manweek 2006 was “Autonomic Component and System Management”,with IPOM taking this to be the application of autonomic principles to the IP operations, administration, maintenance and provisioning (OAM&P) domain. IPOM 2006 is more relevant than ever to the emerging communications infrastr- ture that is increasingly focused on “convergence” of networks and services. Although arguably over-hyped, there is a fundamental truth to this convergence story, and this is based on the fact that the TCP/IP protocol suite (IPv4 and IPv6) has become the common denominator for a plethora of such converged services. One good example in the period between IPOM 2005 and IPOM 2006 has been the large scale deployment of consumer VoIP, linked to the success of Skype and alternatives including SIP-based approaches. In many countries VoIP is driving broadband deployment for SMEs where real costs savings can be accrued, especially for companies with remote staff in the ?eld.

Table of Contents

Frontmatter

Modeling and Planning

Traffic Modeling and Classification Using Packet Train Length and Packet Train Size
Abstract
Traffic modeling and classification finds importance in many areas such as bandwidth management, traffic analysis, traffic prediction, network planning, Quality of Service provisioning and anomalous traffic detection. Network traffic exhibits some statistically invariant properties. Earlier works show that it is possible to identify traffic based on its statistical characteristics. In this paper, an attempt is made to identify the statistically invariant properties of different traffic classes using multiple parameters, namely packet train length and packet train size. Models generated using these parameters are found to be highly accurate in classifying different traffic classes. The parameters are also useful in revealing different classes of services within different traffic classes.
Dinil Mon Divakaran, Hema A. Murthy, Timothy A. Gonsalves
Adaptive Bandwidth Allocation Method for Long Range Dependence Traffic
Abstract
In this paper, we propose a new method to allocate bandwidth adaptively according to the amount of input traffic volume for a long range dependent traffic requiring Quality of Service (QoS). In the proposed method, we divide the input process, which is modelled by an M/G/∞ input process, into two sub-processes, called a long time scale process and a short time scale process. For the long time scale process we estimate the required bandwidth using the linear prediction. Since the long time scale process varies (relatively) slowly, the required bandwidth doesn’t need to be estimated frequently. On the other hand, for the short time scale process, we use the large deviation theory to estimate the effective bandwidth of the short time scale process based on the required QoS of the input traffic. By doing this we can capture the short time scale fluctuation by a buffer and the long time scale fluctuation by increasing or decreasing the bandwidth adaptively. Through simulations we verify that our proposed method performs well to satisfy the required QoS.
Bong Joo Kim, Gang Uk Hwang
Algorithms for Fast Resilience Analysis in IP Networks
Abstract
When failures occur in IP networks, the traffic is rerouted over the next shortest paths and potentially causes overload on the respective links. This leads to congestion on links and to end-to-end service degradation. These can be anticipated by evaluating the bandwidth requirements of the traffic on the links after rerouting for a set of relevant failure scenarios \(\mathcal{S}\). As this set can be large in practice, a fast evaluation of the bandwidth requirements is needed. In this work, we propose several optimized algorithms for that objective together with an experimental assessment of their computation time. In particular, we take advantage of the incremental shortest path first (iSPF) algorithm to reduce the computation time.
Michael Menth, Jens Milbrandt, Frank Lehrieder

Quality of Service Routing

Efficient OSPF Weight Allocation for Intra-domain QoS Optimization
Abstract
This paper presents a traffic engineering framework able to optimize OSPF weight setting administrative procedures. Using the proposed framework, enhanced OSPF configurations are now provided to network administrators in order to effectively improve the QoS performance of the corresponding network domain. The envisaged NP-hard optimization problem is faced resorting to Evolutionary Algorithms, which allocate OSPF weights guided by a bi-objective function. The results presented in this work show that the proposed optimization tool clearly outperforms common weight setting heuristics.
Pedro Sousa, Miguel Rocha, Miguel Rio, Paulo Cortez
Probabilistic QoS Guarantees with FP/EDF Scheduling and Packet Discard in a Real Time Context: A Comparative Study of Local Deadline Assignment Techniques
Abstract
In this paper, we are interested in comparing local deadline assignment techniques in a multi-hop network supporting real time traffic with end-to-end delay constraints, when the FP/EDF scheduling is used, assuming that packets which don’t respect their local delay constraints are discarded. In each node, packets are scheduled according to their Fixed Priorities (FP), and within the same priority, packets are scheduled according to the Earliest Deadline First (EDF) policy, using local deadlines, which correspond to the sojourn times not to be exceeded in that node. Consequently, an accurate choice of these local deadlines must be done in order to respect the flows’ end-to-end delay constraints and minimize the packet discard rate. As we are interested in giving probabilistic QoS guarantees, we develop a mathematical model to compare the performances of five existing deadline assignment techniques. We show that all these techniques give very high packet discard rates. So, we propose to use another packet discard policy and we show that it gives better results.
Fadhel Karim Maïna, Leila Azouz Saïdane
A Quantitative QoS Routing Model for Diffserv Aware MPLS Networks
Abstract
The paper proposes a pre-established multi-path model for quantitative QoS guarantees in Differentiated Services (Diffserv) aware MPLS networks. The proposed model pre-establishes several MPLS label switching paths (LSPs) between each ingress-egress router pair. An ingress router performs admission control based on the resource availability on these paths. The model reduces QoS route computation complexity and increases signaling and state scalability. It also increases resource utilization by performing dynamic load-balancing among the paths based on their utilization. The experimental results are provided to illustrate the efficiency of our model under various network conditions.
Haci A. Mantar

Quality of Service Issues

Experience-Based Admission Control with Type-Specific Overbooking
Abstract
Experience-based admission control (EBAC) is a hybrid approach combining the classical parameter-based and measurement-based admission control schemes. EBAC calculates an appropriate overbooking factor used to overbook link capacities with resource reservations in packet-based networks. This overbooking factor correlates with the average peak-to-mean rate ratio of all admitted traffic flows on the link. So far, a single overbooking factor is calculated for the entire traffic aggregate. In this paper, we propose type-specific EBAC which provides a compound overbooking factor considering different types of traffic that subsume flows with similar peak-to-mean rate ratios. The concept can be well implemented since it does not require type-specific traffic measurements. We give a proof of concept for this extension and compare it with the conventional EBAC approach. We show that EBAC with type-specific overbooking leads to better resource utilization under normal conditions and to faster response times for changing traffic mixes.
Jens Milbrandt, Michael Menth, Jan Junker
Applying Blood Glucose Homeostatic Model Towards Self-management of IP QoS Provisioned Networks
Abstract
Due to the rapid growth of the Internet architecture and the complexities required for network management, the need for efficient resource management is a tremendous challenge. This paper presents a biologically inspired self-management technique for IP Quality of Service (QoS) prov-isioned network using the blood glucose regulation model of the human body. The human body has the capability to maintain overall blood glucose level depending on the intensity of activity performed and at the same time produce the required energy based on the fitness capacity of the body. We have applied these biological principles to resource management, which includes (i) the ability to manage resources based on predefined demand profile as well as unexpected and fluctuating traffic, and (ii) the ability to efficiently manage multiple traffic types on various paths to ensure maximum revenue is obtained. Simulation results have also been presented to help validate our biologically inspired self-management technique.
Sasitharan Balasubramaniam, Dmitri Botvich, William Donnelly, Nazim Agoulmine
New Mathematical Models for Token Bucket Based Meter/Markers
Abstract
The paper presents analytical models for two types of token bucket based meter/markers used as building blocks of Assured Forwarding PHB in IP/DiffServ networks: srTCM and trTCM. The models enable quick finding of meter/marker characteristics under particular configuration and checking how parameter manipulations affect the characteristics of meter/markers. The models are validated by simulations with two types of traffic: TCP/ftp and web-like traffic.
Rafal Stankiewicz, Andrzej Jajszczyk

Management and Configuration

Unique Subnet Auto-configuration in IPv6 Networks
Abstract
IPv6 host auto-configuration has been part of IPv6 specification from the start, but IPv6 routers still require manual configuration and administration. This is not only unacceptable for emerging home and SOHO networks, but it also complicates network management for complex corporate networks. To enable easy and ubiquitous deployment of future IPv6 networks, there is a need for an IPv6 router auto-configuration protocol to complement IPv6 host auto-configuration to make IPv6 networks truly plug-and-play. In this paper we address this issue and propose an IPv6 router auto-configuration algorithm. The idea is for each router to assign unique subnetids to each of their interfaces during startup, and cooperate with other routers in the network to maintain the uniqueness of their subnetid assignment in the face of topological changes. We show how the proposed algorithm can be implemented by a simple modification of the basic intra-domain topology broadcast algorithm. Finally we extend the algorithm to hybrid networks, where some of the segments are manually configured by the administrators and the rest of the segments are auto-configured by the routers.
Reha Oguz Altug, Cuneyt Akinlar
An Efficient Process for Estimation of Network Demand for QoS-Aware IP Network Planning
Abstract
Estimations of network demand are an essential input to the IP network planning process. We present a technique for per traffic class IP network demand estimation based on harnessing information gathered for accounting and charging purposes. This technique represents an efficient use of pre-existing information, is easy to deploy, and, crucially, is highly cost-effective in comparison to traditional direct measurement systems employing dedicated traffic metering hardware. In order to facilitate QoS-aware network planning we also introduce a technique for estimation of QoS related effective bandwidth coefficients via analysis of a relatively small number of packet traces. The combination of the demand and effective bandwidth coefficient estimation techniques provide the basis for an effective, low-cost network planning solution. In this paper we present initial results that validate our contention that network accounting records can be reused to create a QoS aware demand matrix for IP networks.
Alan Davy, Dmitri Botvich, Brendan Jennings
A Protocol for Atomic Deployment of Management Policies in QoS-Enabled Networks
Abstract
This paper presents a novel protocol to support the atomic deployment of management policies for networks with quality of service (QoS) support. The necessity of such a protocol comes from the fact that faulty policy deployments lead to situations where the required QoS is not provided to network users but still consumes network resources such as bandwidth. In addition to the protocol definition, we present a Web services-based implementation and an analysis of the proposed protocol in a policy-based architecture for the management of differentiated services (DiffServ)-enabled networks.
Rodrigo Sanger Alves, Lisandro Zambenedetti Granville, Maria Janilce Bosquiroli Almeida, Liane Margarida Rockenbach Tarouco

Autonomics and Security

Towards Autonomic Network Management for Mobile IPv4 Based Wireless Networks
Abstract
The rapid progress of wireless communication technologies has opened a possibility to offer various types of communications to users irrespective of their locations. The all-IP based wireless networks have been proposed and the Mobile IP protocol is considered as one of prominent candidate frameworks to support a seamless mobility of users. However, to our best knowledge, there are few research efforts to design and develop a network management system targeted for Mobile IP based wireless networks. In this paper, we introduce the concept of autonomic wireless network management which utilizes SNMP agents to manage more intelligently through the self-management functionality. We present a design of autonomic wireless network management system (AWNMS) and its prototype implementation. The currently implemented system is fully compliant with Mobile IP MIB and provides management functions such as network topology auto-discovery, mobility tracking function, etc. The implemented system is validated and examined in a Wireless LAN based test-bed network.
Dong-Hee Kwon, Woo-Jae Kim, Young-Joo Suh, James W. Hong
A Comparison of Mobile Agent and SNMP Message Passing for Network Security Management Using Event Cases
Abstract
Research has proposed that next generation Mobile Agent (MA) technology will achieve the overall notion of “Zero Touch” network management. The advantages offered by using MA-based Network Manage-ment (MANM) include reduction in network traffic, intelligence, automation, fault-tolerance, and robustness. From our previous research, we have developed a security-focused MA framework (MASAM) for achieving active network management. This paper aims to examine the implication of network traffic load when implementing network security management by using MANM through four simulated security attack event cases. Evaluation results indicate that the MANM approach can enhance performance and security when dealing with various security attacks.
Ching-hang Fong, Gerard Parr, Philip Morrow
Principles of Secure Network Configuration: Towards a Formal Basis for Self-configuration
Abstract
The challenge for autonomic network management is the provision of future network management systems that have the characteristics of self-management, self-configuration, self-protection and self-healing, in accordance with the high level objectives of the enterprise or human end-user. This paper proposes an abstract model for network configuration that is intended to help understand fundamental underlying issues in self-configuration. We describe the cascade problem in self-configuring networks: when individual network components that are securely configured are connected together (in an apparently secure manner), a configuration cascade can occur resulting in a mis-configured network. This has implications for the design of self-configuring systems and we discuss how a soft constraint-based framework can provide a solution.
Simon N. Foley, William Fitzgerald, Stefano Bistarelli, Barry O’Sullivan, Mícheál Ó Foghlú

Topology

Risk Assessment of End-to-End Disconnection in IP Networks due to Network Failures
Abstract
Restoration and protection switching mechanisms in IP networks are triggered by link or node failures to redirect traffic over backup paths. These mechanisms are no longer effective if a network becomes disconnected after a failure. The risk of end-to-end disconnection increases if the nodes of a network are only sparsely meshed or if multiple network failures occur simultaneously. This leads inevitably to violations of service level agreements with customers and peering network providers. In this paper, we present a method to assess the risk of end-to-end disconnection in IP networks due to network failures. We calculate the disconnection probabilities for all pairs of network nodes taking into account a set of probable network failures. The results are considered from different perspectives. This helps to identify weak spots of the network and to appropriately upgrade its topological infrastructure with additional links. We implemented the concept in a software tool which assists network providers with assessing the risk of disconnection in their network prior to any network failure and to take appropriate actions.
Jens Milbrandt, Ruediger Martin, Michael Menth, Florian Hoehn
Evaluation of a Large-Scale Topology Discovery Algorithm
Abstract
In the past few years, the network measurement community has been interested in the problem of internet topology discovery using a large number (hundreds or thousands) of measurement monitors. The standard way to obtain information about the internet topology is to use the traceroute tool from a small number of monitors. Recent papers have made the case that increasing the number of monitors will give a more accurate view of the topology. However, scaling up the number of monitors is not a trivial process. Duplication of effort close to the monitors wastes time by reexploring well-known parts of the network, and close to destinations might appear to be a distributed denial-of-service (DDoS) attack as the probes converge from a set of sources towards a given destination. In prior work, authors of this paper proposed Doubletree, an algorithm for cooperative topology discovery, that reduces the load on the network, i.e., router IP interfaces and end-hosts, while discovering almost as many nodes and links as standard approaches based on traceroute. This paper presents our open-source and freely downloadable implementation of Doubletree in a tool we call traceroute@home. We evaluate the performance of our implementation on the PlanetLab testbed and discuss a large-scale monitoring infrastructure that could benefit of Doubletree.
Benoit Donnet, Bradley Huffaker, Timur Friedman, kc claffy
The Virtual Topology Service: A Mechanism for QoS-Enabled Interdomain Routing
Abstract
In this paper we present the Virtual Topology Service (VTS), a new approach to provide interdomain services taking into account QoS and Traffic Engineering (TE) constraints. It is known that in these days the provisioning of end-to-end interdomain connections does not consider any type of QoS due to limitations of the BGP routing protocol. At the same time, many extensions have been proposed to BGP, however none of them were put into practice. We advocate in favor of a service layer that offers new mechanisms for interdomain routing without affecting the underlying Internet infrastructure. The VTS abstracts the physical network details of each Autonomous System (AS) and is totally integrated with BGP. We use the Internet hierarchy to obtain more alternative routes towards a destination. The architecture was already used to provide interdomain services in optical networks. In this paper we show how the architecture can be used to provide interdomain connections in IP networks. We will show how the VTS and other services such as the end-to-end negotiation service work together to provide a complete mechanism for provisioning of interdomain QoS-enabled routes. Preliminary evaluation results are also presented.
Fábio Verdi, Maurício Magalhães, Edmundo Madeira, Annikki Welin

Short Papers

Correlating User Perception and Measurable Network Properties: Experimenting with QoE
Abstract
User perception of a networking service is usually very different from the operators’ understanding of service usability. Quality of Experience (QoE) metrics are supposed to describe the service from the end-users’ point of view – although QoE is hard to measure for mass services. Collection and analysis of QoS and SLS (Service Level Specification) properties of networking services are daily tasks of the operators. These metrics, however often provide misleading description of user satisfaction. Our ultimate aim is to find methods and metrics determining QoE by passive measurements on an aggregated network link. In this paper we describe our experimental results on correlating the severity of a network bottleneck and the experienced service quality. During our measurements we have loaded the network with various kinds of service requests and made notes on the perceived quality. We have also captured packet level traffic, and derived metrics based on packet interarrival times, packet size information and packet loss information. This paper briefly presents some of our analysis results.
Pál Varga, Gergely Kún, Gábor Sey, István Moldován, Péter Gelencsér
Towards Realization of Web Services-Based TSA from NGOSS TNA
Abstract
To avoid frequent changes of OSS’s architecture, TNA provides NGOSS architecture in technology-neutral manner. TNA can be mapped to appropriate TSAs using specific technologies such as XML, Java and CORBA. Web Service can be applied for NGOSS TSA. In this paper, we examine architectural principles of TNA and propose an application mechanism of Web services technologies to TNA.
Mi-Jung Choi, Hong-Taek Ju, James W. K. Hong, Dong-Sik Yun
An Efficient Queue Management (EQM) Technique for Networks
Abstract
In this paper I present a simple and efficient queue management (EQM) technique based on optimal bandwidth allocation for networks. Each router calculates the bandwidth share (throughput) of each interfering flow at a link using link capacity and Interface IP Address (see RFC 3630) or round trip time (RTT) and congestion window size of the flows which are carried in the packets. The sources send packets and the routers in the path drop or allow the packets based on a certain probability and label the non-dropped packets with the allowable optimal throughput for the next round. Each router in the path modifies this label and the sources eventually adjust their sending rates based on the allowable throughput they get from the returning ACKs. In this way EQM finds the fair bandwidth allocation and gives fair queue management.
I also a prove that EQM can converge to a stable point.
Debessay Fesehaye Kassa
Monitoring MIPv6 Traffic with IPFIX
Abstract
As Mobile IPv6 (MIPv6) networks are being deployed, traffic measurement meets several challenges such as monitoring handover events, detecting tunneled IPv6 traffic, and classifying MIPv6 packets with the extension headers. However, typical traffic monitoring methods used in the plain IP network cannot be applied to MIPv6 networks. Hence, this paper proposes a new traffic monitoring mechanism suitable for a MIPv6 network. For this purpose, we used the IP Flow Information eXport (IPFIX) standard for monitoring MIPv6 access routers, and extended IPFIX templates that can carry MIPv6-specific information such as MIPv6 handover messages and IPv6-in-IPv6 tunneled flows. Thus, IPv6 data traffic, MIPv6 handover events, and tunneled IPv6 traffic could be monitored from multiple MIPv6 routers.
Youngseok Lee, Soonbyoung Choi, Jaehwa Lee
Backmatter
Metadata
Title
Autonomic Principles of IP Operations and Management
Editors
Gerard Parr
David Malone
Mícheál Ó Foghlú
Copyright Year
2006
Publisher
Springer Berlin Heidelberg
Electronic ISBN
978-3-540-47702-0
Print ISBN
978-3-540-47701-3
DOI
https://doi.org/10.1007/11908852

Premium Partner

    Image Credits