Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Date Nov. 27 2006-Dec. 1 2006

Filter Results

Displaying Results 1 - 25 of 1013
  • Copyright - Globecom 2006

    Publication Year: 2006 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (63 KB)  
    Freely Available from IEEE
  • Welcome Messages - Globecom 2006

    Publication Year: 2006 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (278 KB)  
    Freely Available from IEEE
  • Executive Committee-Globecom 2006

    Publication Year: 2006 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (104 KB)  
    Freely Available from IEEE
  • Sponsors - Globecom 2006

    Publication Year: 2006 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (104 KB)  
    Freely Available from IEEE
  • Committees - Globecom 2006

    Publication Year: 2006 , Page(s): 1 - 15
    Save to Project icon | Request Permissions | PDF file iconPDF (186 KB)  
    Freely Available from IEEE
  • CAM01-1: A Customized TCAM Architecture for Multi-Match Packet Classification

    Publication Year: 2006 , Page(s): 1 - 5
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (224 KB) |  | HTML iconHTML  

    Most conventional packet classifiers find the highest priority filter that matches the packet. However, new networking applications such as network intrusion detection systems (NIDS) and load balancers require all (or the first few) matching results in packet classification. A TCAM -based architecture optimized for multiple match search is introduced in this paper. We propose a renovated TCAM design that can find all or the first r matches in a packet filter set. Our scheme partitions the filter set and performs the multi-match search on one partition only. A VLSI implementation of our classifier in 0.18 mum technology can achieve speed that is 1-2 order of magnitude higher than software based approaches. Power consumption is reduced by 40% which is far better than the conventional hardware based multi-match designs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM01-2: Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers

    Publication Year: 2006 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (219 KB) |  | HTML iconHTML  

    In this paper, we analyze the throughput of interconnection networks, viewed as multi-stage queueing networks with infinite input queues, but finite internal cross-stage ones. We find that for very general arrival processes and arbitrarily fixed network topology, the stability region with finite internal buffers is identical to that for the corresponding network with infinite internal buffers, and is achievable via special scheduling policies. In particular, we define and study a class of throughput maximizing policies, known as projective cone scheduling (PCS) algorithms, which activate a set of concurrent service rates to all queues in the network based on observed backlog levels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM01-3: Connection Preemption in Multi-Class Networks

    Publication Year: 2006 , Page(s): 1 - 6
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (181 KB) |  | HTML iconHTML  

    We address the problem of connection preemption in a multi-class network environment. Our objective is: (i) to minimize the number of preempted connections, and (ii) to minimize the total preempted bandwidth, in that order. We show that this problem is NP-complete by reducing it to a well-known NP complete problem - the subset sum problem. Therefore, a known polynomial time algorithm, such as Minn.Conn [1], to solve this problem is suboptimal. We present an optimal algorithm with exponential complexity that can be used when the network load is light. We also present a fully polynomial time approximation algorithm that performs within a bounded factor from the optimal, and can be used in large networks having thousands of connections. We compare the performance of exact and approximate algorithms in a practical scenario by conducting simulations on a network representing twenty largest metros in the U.S. The simulations show that, on average, the approximate algorithm preempts bandwidth which is only a small fraction more as compared to that preempted by the exact algorithm, but is an order of magnitude more efficient in terms of execution time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM01-4: Bandwidth Requirement Estimates Based on Asymptotic Loss Performance Analysis with QoS Constraint

    Publication Year: 2006 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (178 KB) |  | HTML iconHTML  

    This paper deals with bandwidth requirement estimates in buffered statistical multiplexers with the underlying many sources asymptotics modeling framework. Within this multiplexer model refined approximation for buffered workload loss ratio is considered. Based on this direct and computationally feasible equivalent bandwidth requirement estimator is presented in full accordance with the corresponding QoS constraint. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM01-5: Low-Jitter Scheduling Algorithms for Deadline-Aware Packet Switches

    Publication Year: 2006 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (190 KB) |  | HTML iconHTML  

    We study low jitter-scheduler design for deadline-aware input-queued (IQ) packet switches. We consider scheduling of traffic streams associated with service profiles, which reflect the inter-packet deadlines between packets constituting the stream. To make the NP-hard problem of scheduling with strict deadlines tractable, we use soft deadlines as a modeling tool, and study the scheduling problem with soft deadlines in a dynamic programming (DP) framework. We establish the optimality of a myopic scheduling policy for the canonical 2times2 crossbar switch. For bigger switches, we develop low-complexity approximations to the myopic policy (which is near-optimal), one based on the notion of neighborhood search, and two others based on convex relaxations of an integer programming problem. We demonstrate the efficacy of the proposed policies via simulations, employing good put as a performance metric. A key feature of the proposed policies is that they do not require knowledge of traffic statistics (rate, periodicity etc.), rendering them robust and amenable to implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM01-6: Robust and Optimal Control of Packet Loss Probability

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

    QoS control and guarantees for IP/MPLS VPN services are increasingly important for network service providers. The dynamic control of QoS parameters is still an open issue. A control theory based packet loss control system is proposed to dynamic maintain the preset packet loss probability targets for instantiated VPN services in the core network, where the transducer and the dynamic packet loss model have been studied in the previous studies, respectively. However, the identified linear model contains time-varying and norm-bounded uncertain parameters. This paper will extend the previous research to design a robust and optimal controller for the complete QoS control system. Specially, a Linear Matrix Inequality (LMI) approach for designing the robust and optimal Proportional- Integral (PI) controller is studied. By adopting the LMI expression, a symmetric positive definite matrix P with guaranteed overall system's quadratic stability is determined. The matrix P finally infers the robust PI controller parameters. A number of experiments are devised on the live NCIT*net network to evaluate the performance of the controller. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM02-1: Time-Driven Early Discard (TED) to Improve the Fairness of TCP Congestion Control

    Publication Year: 2006 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (318 KB) |  | HTML iconHTML  

    This paper proposes a novel adaptive AQM (advanced queue management) approach called Time-Driven Early Discard (TED). The basic underlying idea is to set a deadline on packet service time in routers, beyond which packets are discarded. TED is shown to improve fairness among TCP connections sharing congested links when the deadline is chosen proportional to their round trip time (RTT). TED is adaptive in limiting the throughput of only those connections that traverse congested links. In fact, as demonstrated by the presented results, TCP connections traversing parts of the network with enough available capacity can achieve the maximum throughput enabled by their transmission window as corresponding packets do not reach their deadline . Finally, the paper shows how TED can be instrumental in enabling TCP to deploy shorter retransmission timeouts, which results in prompter reactivity to loss, hence improved performance overall in terms of achieved goodput. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM02-2: WB-RTO: A Window-Based Retransmission Timeout for TCP

    Publication Year: 2006 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (301 KB) |  | HTML iconHTML  

    We present a new timeout algorithm for TCP, based on the observation that TCP-RTO should not be solely based on RTT estimations. We argue that the design principles of the current timeout algorithm may lead to flow synchronization, unnecessary retransmission effort and unfair resource allocation. WB-RTO exhibits two major properties: (i) it cancels retransmission synchronization which dominates when resource demand exceeds by far resource supply and (ii) reschedules flows on the basis of their contribution to congestion. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM02-3: TERM: TCP Friendly Explicit Rate Congestion Control for MPLS Networks

    Publication Year: 2006 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (314 KB) |  | HTML iconHTML  

    In this paper we present a TCP friendly explicit rate congestion control mechanism for MPLS networks (TERM). The components of the TERM system include a method for using resource reservation protocol (RSVP) to signal explicit rate information, a weight proportional max-min (WPMM) algorithm that calculates weighted fair rates in O(l) time, and a priority based packet marking and queue management system. Simulations validate that, working in conjunction, TERM components increase throughput of TCP and LDP traffic while enforcing weighted fair rates. The unique TERM approach accomplishes this with minimal network and computational overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM02-4: Online Management of QoS Enabled Overlay Multicast Services

    Publication Year: 2006 , Page(s): 1 - 6
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1174 KB) |  | HTML iconHTML  

    More and more, content providers offer multimedia services such as Internet TV, multimedia conferencing and online gaming to their customers. These services are characterized by their high sensitivity to network delay and a multicast nature. An overlay network allows for supporting QoS by making reservations in the underlying networks and for multicasting the multimedia streams towards their targets at the overlay layer, without requiring multicast support from the underlying networks. This paper outlines the architecture of a dynamic QoS enabled multicast overlay network and also introduces a set of algorithms to determine an overlay distribution tree that connects a multimedia server to a number of clients. The algorithms construct a tree with a bounded end-to-end delay and minimize the bandwidth that is used. These algorithms are evaluated in terms of bandwidth cost, overlay cost and end-to-end delay. We show that one of our heuristics finds overlay multicast trees that approximate the optimal result in terms of cost and that have a small diameter and a low average delay. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM02-5: On the Number of MPLS LSPs using Multicast Tree Aggregation

    Publication Year: 2006 , Page(s): 1 - 5
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (147 KB) |  | HTML iconHTML  

    Multicast tree aggregation is an efficient proposition that can solve the multicast forwarding state scalability problem. Existing works on tree aggregation have focused on developing and simulating protocols that build trees dynamically. However, the underlying problem of the impact of the tree construction algorithm on the performance of the protocols remains untouched. In this paper, we propose a study on the number of trees that need to be configured in a domain depending on the tree construction algorithm. We ran extensive simulations on several real domains and with different tree construction algorithms. Our results show that for a given set of multicast groups, even when this set includes all the possible groups, the number of trees that need to be configured is small. This allows a network administrator to configure off-line all these trees in order to maintain a stable set of trees and to have knowledge of the routes used by the multicast packets. Knowing the set of all the possible trees is also useful to determine the best subset to configure and to give an upper bound of the number of different trees. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM02-6: Further Analysis of XCP Equilibrium Performance

    Publication Year: 2006 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (209 KB)  

    Low analyzes the equilibrium performance of the recently developed explicit control protocol (XCP) by applying the derived window-based dynamical model. However, Low's window-based dynamic model is too complicated to be used easily. In our previous works, a simple rate-based model is proposed for analyzing XCP's equilibrium performance. Most results that appeared in Low's paper can be easily reproduced by applying our simple dynamic model. Furthermore, we prove that the shuffling parameter 7 is no more than the parameter gamma to achieve high link utilization. In this paper, we derive stringent lower and upper bounds of link utilization provided with the new constraint gamma les alpha. Furthermore, to study the equilibrium performance of networks with the compensation policy, we use the simplest topology of two links in chains. The sufficient conditions of the compensation policy are proposed, and the link utilization with the compensation policy is derived as a root of a cubic equation. Simulation results are used to verify our results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM03-1: On the Suitability of Applications for GMPLS Networks

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

    After identifying that current GMPLS specifications only allow for the implementation of a call blocking mode of operation that handles immediate-request calls (not book-ahead calls), this paper addresses the question of suitability of different types of applications for such networks. Two types of applications are considered, ones in which the per-circuit bandwidth and mean call holding time are independent and ones in which they are dependent (file transfers). GMPLS networks are often cited for high-bandwidth applications and for large file transfers. This work, through analysis, reasons that GMPLS networks are not well suited both for applications in which the required per-circuit bandwidth is high, on the order of one-tenth the shared link capacity, or low, on the order of one-thousandth the shared link capacity. Ideal is the one-hundredth range. Further for file transfers, we show that the best range of operation to achieve high utilization and low call blocking rates with an acceptable number of ports on switches for traffic aggregation, requires call holding time to be small, in the range of seconds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM03-2: Cheetah Virtual Label Switch Router Design and Deployment in GMPLS Optical Networks

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

    In this paper, we describe the design and implementation of a GMPLS software engine that is used to enable non-GMPLS switches (e.g., Ethernet switches, routers and other cross-connects) to participate in the dynamic setup and release of end-to-end bandwidth guaranteed connections. We have deployed this engine in the experimental Cheetah optical network, and hence we call it the Cheetah Virtual Label Switching Router (CVLSR). It allows users to share the network resources dynamically and makes it possible to extend the connections across the local area network to the end-users. The CVLSR engine is also equipped with a function called dynamic network clustering which is needed to enable a broad range of applications such as remote visualization, grid computing and e-learning. We have successfully demonstrated the inter-operability of the CVLSR with commercially available GMPLS enabled SONET-based cross-connect switches. The purpose of this paper is to share our experience in designing and deploying the CVLSR in the Cheetah network. We believe that these and similar efforts will result in significant progress towards enabling connection-oriented high performance networking. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM03-3: Can Congestion Control and Traffic Engineering Be at Odds?

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

    In the Internet today, traffic engineering is performed assuming that the offered traffic is inelastic. In reality, end hosts adapt their sending rates to network congestion, and network operators adapt the routing to the measured traffic. This raises the question of whether the joint system of congestion control and routing is stable and optimal. Using established optimization models for TCP and traffic engineering as a basis, we find the joint system is stable and typically maximizes aggregate user utility through simulation. The joint system may deviate from this solution when the topology is not uniform. A modification to the joint system will guarantee stability and optimality for applications that are sufficiently elastic, but at the cost of robustness. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM03-4: Management of Time-Shifted IPTV Services through Transparent Proxy Deployment

    Publication Year: 2006 , Page(s): 1 - 5
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (310 KB) |  | HTML iconHTML  

    A recent important evolution in broadband access network design is the deployment of IP aware access network elements, which allow to introduce access network services beyond basic triple-play. The focus of this paper is on the management of time-shifted television (tsTV), an IPTV service which allows for watching the broadcast content at real-time or with a (small) time shift. An architecture for a large-scale tsTV service deployment is presented, using co-operating transparent diskless proxy caches in broadband access networks, with an implementation based on the IETF's real-time streaming protocol (RTSP). Caching algorithms have been designed to take into account content popularity and distance metrics. The algorithms make use of the sliding window concept and calculate the optimal trade-off between bandwidth usage efficiency and storage cost. A prototype implementation of a transparent tsTV proxy is presented and evaluated through performance measurements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM03-5: Influence of Label Stack Depth on the Performance of MPLS Networks

    Publication Year: 2006 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (220 KB) |  | HTML iconHTML  

    Multi-Protocol Label Switching (MPLS) is a connection-oriented paradigm suitable for metro-core networks wherein forwarding decisions in each node are based solely on a short label, much smaller than other packet headers (e.g. IP header). In order to scale and allow for hierarchical traffic aggregation, a Label stacking mechanism has been defined within Multi-Protocol Label Switching (MPLS) protocol. In this paper, label stacking is optimized for static MPLS networks and its impact on the packet processing performance is quantified in real network scenarios. Optimization is carried out by using an integer linear programming formulation and a polynomial time algorithm. Results indicate that the use of label stacking mechanism is recommended in some network scenarios. Moreover, the results evidence that a small size of label stack depth is sufficient to guarantee the performance improvement. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM03-6: AR-PIN/PDC: Flexible Advance Reservation of Intradomain and Interdomain Lightpaths

    Publication Year: 2006 , Page(s): 1 - 6
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (349 KB) |  | HTML iconHTML  

    A collection of Grid computing resources interconnected by an application-configurable network of lightpaths is called a LambdaGrid. It provides data-intensive applications with the needed deterministic network bandwidth to transport data between grid instruments, high-performance storage systems, compute clusters and visualization systems, that is often needed for real-time interactive scientific exploration. Advance reservation is needed to guarantee the availability of network resources. Flexible scheduling affords users greater convenience while also improving resource utilization and acceptance rate. In this paper we propose a unified flexible advance reservation model called FARM and apply this model to the cross-domain Routing and Wavelength Assignment problem. We will present the architecture and implementation of a coordinated Interdomain and Intradomain optical control plane, which is capable of flexible advance reservations. Our simulation results show that by just relaxing the reservation constraint and providing flexibility on the starting time, the network can carry 39% more load, and resource utilization can improve by 41%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM04-1: Admission Control in Self Aware Networks

    Publication Year: 2006 , Page(s): 1 - 5
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (234 KB) |  | HTML iconHTML  

    The worldwide growth in broadband access and multimedia traffic has led to an increasing need for Quality- of-Service (QoS) in networks. Real time network applications require a stable, reliable, and predictable network that will guarantee packet delivery under QoS constraints. Network self- awareness through on-line measurement and adaptivity in response to user needs is one way to advance user QoS when overall network conditions can change, while admission control (AC) is an approach that has been commonly used to reduce traffic congestion and to satisfy users' QoS requests. The purpose of this paper is to describe a novel measurement-based admission control algorithm which bases its decision on different QoS metrics that users can specify. The self-observation and self- awareness capabilities of the network are exploited to collect data that allows an AC algorithm to decide whether to admit users based on their QoS needs, and the QoS impact they will have on other users. The approach we propose finds whether feasible paths exist for the projected incoming traffic, and estimates the impact that the newly accepted traffic will have on the QoS of pre-existing connections. The AC decision is then taken based on the outcome of this analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAM04-2: A Congestion Control Method Jointly Utilizing Delay and Marking/Loss Feedback

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

    Depending upon the type of feedback that is utilized, network congestion control schemes can be classified into two categories: marking/loss based (e.g., TCP Reno) or delay based (e.g., TCP Vegas). Delay-based schemes have garnered much attention due to their higher network throughput than loss-based methods. Delay provides a much finer-grained measure of congestion than packet loss or packet marking feedback. However, when there are multiple bottleneck links or inadequate buffer sizes in the path between a source and destination, delay information alone is insufficient for revealing the incipient network congestion. In this paper, we consider the design of a congestion control scheme that transcends the two normal categories and instead jointly exploits both delay and marking/loss feedback. In particular, we introduce the concept of normalized queuing delay, and demonstrate how a controller based on joint feedback provides high throughput even under highly dynamic network conditions as evidenced by ns2 simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.