By Topic

IP Operations & Management, 2003. (IPOM 2003). 3rd IEEE Workshop on

Date 1-3 Oct. 2003

Filter Results

Displaying Results 1 - 21 of 21
  • Analysis of adjusted probabilistic packet marking

    Publication Year: 2003 , Page(s): 9 - 13
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (374 KB) |  | HTML iconHTML  

    Probabilistic packet marking (PPM) has been proposed for the identification of the source of a denial of service (DoS) attack (Savage, S. et al., Proc. ACM SIGCOM, p.295-305, 2000). PPM is based on marking packets with a fixed probability by all routers. However, using a fixed marking probability allows a large number of packets to reach the victim unmarked, which can be spoofed to impede traceback. Also, using a fixed marking probability, the victim receives fewer marked packets from routers further away from the victim, which increases the computational time needed for traceback. Hence, we study the adjusted probabilistic packet marking (APPM) scheme (Teo Peng et al., Proc. Networking, 2002), where variable marking probability is used so that the victim receives packets from all routers with equal probability. However, using the analysis similar to that of Kihomg Park and Heejo Lee (see Proc. IEEE INFOCOM, 2001) we show that APPM is also subject to spoofing of the marking field for smaller path lengths. A modified version of APPM is proposed that reduces unmarked packets reaching the victim and the computational time needed for traceback. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reordering-free multipath traffic engineering architecture for DiffServ-MPLS networks

    Publication Year: 2003 , Page(s): 107 - 113
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (545 KB) |  | HTML iconHTML  

    We propose a novel traffic engineering architecture for IP networks with multiprotocol label switching (MPLS) backbones. In this architecture, two (primary and secondary) label switched paths (LSPs) are established among every pair of IP routers located at the edge of an MPLS cloud. Traffic between a source-destination pair is then split between the primary and secondary LSPs using an ABR-like explicit-rate feedback gathered from the network. Taking into consideration the packet reordering effect of packet-based load balancing schemes, we propose a novel traffic splitting mechanism that operates on a per-flow basis. We show, using a variety of scenarios, that deploying flow-based multipath traffic engineering not only provides significantly and consistently better throughput than that of a single path, but is also void of any packet reordering. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of an IPFIX compliant flow traffic meter: challenges and performance assessment

    Publication Year: 2003 , Page(s): 61 - 67
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (568 KB) |  | HTML iconHTML  

    Several tools are already available for measuring IP traffic flows. However, a standard for exporting results is still missing and the IETF IPFIX WG (IP flow information export working group) is currently working towards this target. We present a prototype implementation of an IPFIX compliant flow meter and discuss its major challenges. Through an extensive profiling activity, we try to point out which operations are most critical for scalability issues. The latter can be raised by both a large number of contemporary flows and a high packet input rate. We finally provide some indicative figures of the incoming traffic rate, which can be reliably monitored with the platform we used to test our implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RTTometer: measuring path minimum RTT with confidence

    Publication Year: 2003 , Page(s): 127 - 134
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (599 KB) |  | HTML iconHTML  

    Internet path delay is a substantial metric in determining path quality. Therefore, it is not surprising that round-trip time (RTT) plays a tangible role in several protocols and applications, such as overlay network construction protocol, peer-to-peer services, and proximity-based server redirection. Unfortunately, current RTT measurement tools report delay without any further insight about path condition. Therefore, applications usually estimate minimum RTT by sending a large number of probes to gain confidence in the measured RTT. Nevertheless, a large number of probes does not directly translate to better confidence. Usually, minimum RTT can be measured using few probes. Based on observations of path RTT presented by Z. Wang et al. (see Proc. Passive & Active Measurement Workshop - PAM'03, 2003), we develop a set of techniques, not only to measure minimum path RTT, but also to associate it with a confidence level that reveals the condition on the path during measurement. Our tool, called RTTometer, is able to provide a confidence measure associated with path RTT. Besides, given a required confidence level, RTTometer dynamically adjusts the number of probes based on a path's condition. We describe our techniques implemented in RTTometer and present our preliminary experiences using RTTometer to estimate RTT on various representative paths of the Internet. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Off-line reduced complexity layout design for MPLS networks

    Publication Year: 2003 , Page(s): 99 - 105
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (492 KB) |  | HTML iconHTML  

    One of the main reasons for the present market enthusiasm for the MPLS architecture is its capability for implementing evolved traffic engineering (TE) functionalities, as they are required, for example, to support the next generation Internet. MPLS paths (LSPs) can be calculated on-line, as demands arrive, or off-line for a given estimate of the traffic matrix. Off-line calculation has the advantage of enabling a globally optimal network design. From the operational standpoint, the layout design for a large network should consider minimizing the layout complexity, thus reducing the cost of operation. Layout optimization objectives usually aim at minimizing total delay in the network, maximum loaded link, or any other function of link loads. To address the layout complexity issue, we propose an optimization problem whose objective is to minimize the number of required paths, while an end-to-end path delay constraint provides the required quality of service (QoS) guarantees. To solve the resulting multicommodity flow allocation problem, a MINLP (mixed integer non linear program) formulation is used. The results are then compared to the solutions obtained with a commonly used cost function, which does not consider complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for rerouting in traffic engineering of MPLS based IP networks

    Publication Year: 2003 , Page(s): 115 - 118
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (358 KB) |  | HTML iconHTML  

    Multiprotocol label switching (MPLS) enables IP networks with quality of service to be traffic engineered well. Rerouting and bumping of label switched paths (LSP) are caused by link or node failure or recovery, connection admission or load balancing. We develop an algorithm for the traffic engineering problem associated with rerouting. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An alarm management approach in the management of multi-layered networks

    Publication Year: 2003 , Page(s): 77 - 84
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (616 KB) |  | HTML iconHTML  

    We consider large interconnected networks that operate under a user-provider paradigm (such as IP over SONET) where networks from different layers are in different administrative domains. In such a relationship, the overall network survivability can benefit from a limited sharing of network management data between networks of different layers. The paper proposes a multi-layered alarm management framework in such a setting. The alarm manager uses a finite state machine to represent an alarm instance with state transitions triggered as a result of the correlation of multiple alarms. We present a constructive argument to demonstrate the correctness of the finite state machine. Alarm correlation is handled by a rule-based reasoning engine. The set of correlation rules and corresponding actions depends on the definition of alarms that can enter the system. Therefore, based on the multi-layered paradigm and the inclusion of a performance management agent, three alarm categories are created: provider network alarms; user network alarms; predictive alarms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of IP address fragmentation strategies for DDoS traceback

    Publication Year: 2003 , Page(s): 1 - 7
    Cited by:  Papers (3)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (518 KB) |  | HTML iconHTML  

    Distributed denial-of-service (DDoS) attacks are among the most difficult and damaging security problems that the Internet currently faces. The component problems for an end-system that is the victim of a DDoS attack are: determining which incoming packets are part of the attack (intrusion detection); tracing back to find the origins of the attack (i.e., "traceback"); taking action to mitigate or stop the attack at the source by configuring firewalls or taking some kind of punitive measures. The preferable solution to these problems operates in real time so that a DDoS attack can be mitigated before the victim is seriously harmed. The paper focuses on the technique of packet marking/overloading for automated DDoS traceback which is a complex problem simply because attackers can use spoof source IP addresses in their attacking packets. A new packet marking strategy is proposed and is shown to yield better results in terms of complexity and performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flow-level upstream traffic behavior in broadband access networks: DSL versus broadband fixed wireless

    Publication Year: 2003 , Page(s): 135 - 141
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (483 KB) |  | HTML iconHTML  

    We present flow-level upstream traffic behavior based on data collected from broadband fixed wireless (BFW) and digital subscriber line (DSL) access services. The study involves data collected using Cisco's NetFlow tools on both access networks. The observations indicate that a number of applications based on peer-to-peer (P2P) concepts create most of the upstream traffic. The flows observed are mostly short-lived for both BFW and DSL access, with DSL being the lesser of the two. The inter-arrival time displays near-range correlation for the DSL flows. There is a significant periodicity observed in the interarrival time distribution for flows on BFW access, which is indicative of the influence of the underlying medium access control (MAC) protocol on traffic behavior. These analysis of upstream traffic characteristics form the first step towards constructing a generalized parametric model for broadband access networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of telephony routing over IP (TRIP)

    Publication Year: 2003 , Page(s): 47 - 53
    Cited by:  Papers (1)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (545 KB) |  | HTML iconHTML  

    A new signaling protocol being developed for use in the Internet or an enterprise IP network is analyzed. The protocol is telephony routing over IP (TRIP). The most basic function of TRIP is to locate the optimum gateway on a voice over IP (VoIP) network connected to the public switched telephone network (PSTN). TRIP is analyzed from a carrier perspective and performance results are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MobyDick FlowVis - using NeTraMet for distributed protocol analysis in a 4G network environment

    Publication Year: 2003 , Page(s): 55 - 60
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (481 KB) |  | HTML iconHTML  

    The commercial operation of future "4G" mobile wireless networks, comprising both IP-based voice and data uniformly, is widely considered as the next challenge for service providers. Within such an IP-environment, with its implicit integration of the control and data plane, passive measuring and metering will be one of the key elements for AAA and QoS provision, for performance and fault management purposes. Within the IETF, a real-time flow measurement framework has been developed for measurement and accounting for the fixed Internet infrastructure. The article first briefly introduces the IETF "real-time flow measurement" (RTFM) architecture, a pure IP 4G-architecture, together with its key signalling scenarios, and Java/J2EE and Web middleware technology. It then describes "FlowVis", a highly scalable and distributed IP based protocol visualization and verification framework for both signalling and data traffic. Combining the near-real-time capabilities of the existing IETF RTFM with current middleware technology, this "FlowVis" framework can serve as a starting point for distributed protocol analysis in future 4G networks. We use NeTraMet, an open-source implementation of the RTFM architecture as the key metering component of "Moby Dick", a 4G mobile access network architecture. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated service and network management system for MPLS traffic engineering and VPN services

    Publication Year: 2003 , Page(s): 69 - 75
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (603 KB) |  | HTML iconHTML  

    MPLS technology has recently been widely adopted, not only in large-scale IP backbones, but in metro and enterprise networks as well. Among the merits of MPLS, effective and efficient support of TE (traffic engineering) and VPN (virtual private network) services is the most influential factor that has facilitated the diffusion of the technology. However, although MPLS itself has become a currently operational technology, issues regarding the management of various services that are built on top of individually operating MPLS capable network elements have not been well identified or solved. These service level management issues arise, not only under heterogeneous conditions, but even when the target network is homogeneously composed. The paper discusses the requirements and architectural aspects of an integrated service management system for MPLS TE and VPN services. The discussion encompasses fault and performance management issues and information models which should be flexible to support newer services that can be rendered by merging TE, VPN, and QoS technologies. We also examine performance, fault tolerance, and scalability issues that cannot be neglected when such systems are deployed in a real-world environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bicriteria optimization approach for robust OSPF routing

    Publication Year: 2003 , Page(s): 91 - 98
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (591 KB) |  | HTML iconHTML  

    For intra-domain routing, open shortest path first (OSPF) is the most commonly used protocol. In OSPF, traffic is routed using paths that are shortest with respect to a set of link costs. One problem is the optimization of OSPF link costs. The problem amounts to finding a set of link costs such that the total network congestion is minimized. We consider robust OSPF routing that takes into account the impact of link failures. The optimized link costs for the non-failure scenario do not necessarily minimize the congestion when a link failure occurs. An OSPF routing solution is robust if it not only leads to low congestion in the non-failure scenario, but also attempts to minimize the impact of link failures. To address this problem, we present a bicriteria optimization model, which simultaneously considers the congestion of the normal state and that of the failure states. Previously proposed methods for bicriteria optimization problems often involve weighting together the two objective functions. We propose a different approach using an artificial objective function. When embedded into a local search algorithm, the function guides the search towards Pareto-optimal solutions. These solutions can be used for analyzing the trade-off between the congestion of the normal state and that of the failure states. The proposed algorithm can therefore be used as an aid for implementing robust OSPF routing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IPv6 migration implications for network management - introducing the site transitioning framework (STF)

    Publication Year: 2003 , Page(s): 39 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (600 KB) |  | HTML iconHTML  

    The paper outlines the need to supplement the current work on network management for IPv6 with a system specifically to support IP transitioning. As something that is likely to play a major role in any IPv6 network for the considerable future, support for managing the transitioning aspects of managed networks is vital in terms of their infrastructure and service provision. While there is work being carried out within the IETF and other bodies on the management of IPv6 networks, the management aspects relating to transitioning require special attention as they are likely to be among the more dynamic over the period of IPv4/IPv6 interoperation and, importantly, have yet to be fully addressed. The paper introduces the site transitioning framework, which unifies a site's transitioning infrastructure under a single architecture in order to simplify its management and operation. We outline its design and operation, highlighting the advantages that this method would introduce. Finally, the STF concept is demonstrated using a case study of an IPv6 site based interoperation scenario. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data clustering algorithm for mining patterns from event logs

    Publication Year: 2003 , Page(s): 119 - 126
    Cited by:  Papers (23)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (615 KB) |  | HTML iconHTML  

    Today, event logs contain vast amounts of data that can easily overwhelm a human. Therefore, mining patterns from event logs is an important system management task. The paper presents a novel clustering algorithm for log file data sets which helps one to detect frequent patterns from log files, to build log file profiles, and to identify anomalous log file lines. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A QoS specification proposal for IP virtual private networks

    Publication Year: 2003 , Page(s): 85 - 90
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (404 KB) |  | HTML iconHTML  

    Demand for virtual private networks (VPN) are on the increase as enterprises opt for secure cost effective data networking solutions with specific quality of service (QoS) guarantees. The advantages of the Internet Protocol (IP) have made it the primary network layer protocol of choice for the future as well. Nevertheless, the concept of service differentiation and how to specify and guarantee it in IP VPN are rather difficult and often fuzzy. We propose a class of service (CoS) classification with an associated QoS parameter set for IP virtual private networks in the wide area. We study various scenarios and, in each case, we derive the conditions under which appropriate QoS can be guaranteed for each CoS by policing the aggregate arrival rates of each class from each VPN access interface into the IP network, thereby eliminating the difficulties associated with accurately estimating the end-to-end traffic profiles. In addition to simplifying the specifications, our proposal enables the users to exploit fully the potential of service differentiation in connectionless networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing IPv4-to-IPv6 transition process in cellular networks and introducing new peer-to-peer services

    Publication Year: 2003 , Page(s): 31 - 37
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (573 KB) |  | HTML iconHTML  

    The paper describes the acute problems with the current Internet Protocol (IPv4), especially from the IP-based cellular network point of view. As a solution to the problem, the document proposes the use of the new Internet Protocol (IPv6). Its adequate address space is clearly needed to enable new type of peer-to-peer services in mobile networks. Transition from IPv4 to IPv6 is a challenging task. Hence, this paper analyzes how the transition process in Third Generation Partnership Project (3GPP) cellular networks can be efficiently handled. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic balancing via smart packets

    Publication Year: 2003 , Page(s): 15 - 21
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (433 KB) |  | HTML iconHTML  

    The World Wide Web (WWW) has caught people's attention since its inception and today is a major source of traffic in the Internet. WWW traffic is typically asymmetric: servers receive small requests but answer with large number of packets. To ensure good service, WWW servers require a large egress bandwidth to the Internet. We propose an innovative approach to connect Web servers to the Internet via many outgoing connections. We employ cognitive packet networks to make packets learn which link provides the best quality for each client so as to balance the WWW traffic effectively. Egress bandwidth can easily be increased by increasing the number of links to the Internet. The paper describes our traffic engineering approach, an implementation model, a testbed platform in the context of the Linux kernel, and measurement data; these indicate the usefulness of our proposal. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) [front matter]

    Publication Year: 2003 , Page(s): i - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (302 KB)  
    Freely Available from IEEE
  • Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) (IEEE Cat. No.03EX764)

    Publication Year: 2003
    Save to Project icon | Request Permissions | PDF file iconPDF (538 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2003 , Page(s): 142
    Save to Project icon | Request Permissions | PDF file iconPDF (27 KB)  
    Freely Available from IEEE