By Topic

Next Generation Internet Networks, 2008. NGI 2008

Date 28-30 April 2008

Filter Results

Displaying Results 1 - 25 of 50
  • [Title page]

    Publication Year: 2008
    Save to Project icon | Request Permissions | PDF file iconPDF (216 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008 , Page(s): ii
    Save to Project icon | Request Permissions | PDF file iconPDF (35 KB)  
    Freely Available from IEEE
  • Chair Message

    Publication Year: 2008 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (219 KB)  
    Freely Available from IEEE
  • TCP Message

    Publication Year: 2008 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (241 KB)  
    Freely Available from IEEE
  • Committees

    Publication Year: 2008 , Page(s): v
    Save to Project icon | Request Permissions | PDF file iconPDF (215 KB)  
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2008 , Page(s): vi
    Save to Project icon | Request Permissions | PDF file iconPDF (211 KB)  
    Freely Available from IEEE
  • Designing Two-Level IP Networks Including the Points of Presence

    Publication Year: 2008 , Page(s): 1 - 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (189 KB) |  | HTML iconHTML  

    In this paper, we propose a heuristic algorithm based on the tabu search principle for the topological design problem of two-level Internet protocol (IP) networks including the design of the points of presence. This global problem consists in selecting the number of routers and their types to install in each point of presence, selecting the interface card types to install in each router, finding t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource Efficient Grooming Policy in Groomable WDM Mesh Networks

    Publication Year: 2008 , Page(s): 9 - 14
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (248 KB) |  | HTML iconHTML  

    This paper addresses the traffic grooming problem in wavelength-division multiplexing (WDM) mesh networks. We first introduce a transceiver saving auxiliary graph model, in which various grooming policies can easily be achieved by assigning weight values for various edges. Then we propose a resource efficient grooming policy (REGP) based on the graph model, which take into account the wavelength c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing Installation Costs of Survivable DWDM-Mesh Networks: A Heuristic Approach

    Publication Year: 2008 , Page(s): 15 - 22
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (372 KB) |  | HTML iconHTML  

    The cost function for the capacity of optical links follows a step function. That means, the support of one more lightpath might require a costly upgrade of an optical cross connect (OXC), but then additional lightpaths can be supported at almost no further cost. This should be considered when lightpaths are routed through an optical network. In this paper we optimize the routing of the lightpaths... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transit Price Negotiation: Decentralized Learning of Optimal Strategies with Incomplete Information

    Publication Year: 2008 , Page(s): 23 - 30
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (514 KB) |  | HTML iconHTML  

    We present a distributed learning algorithm for optimising transit prices in a negotiation problem in the inter-domain routing framework. We present a combined game theoretic and distributed algorithmic analysis, where the notion of Nash equilibrium with the first approach model meets the notion of stability in the second. We show that minimum cost providers can learn how to strategically set thei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path Generation for a Class of Survivable Network Design Problems

    Publication Year: 2008 , Page(s): 31 - 38
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (153 KB) |  | HTML iconHTML  

    In this paper we address link dimensioning and routing problems related to the area of resilient network design. We present two network design problems that assume different flow restoration schemes used to cope with network failures. In both cases we allow bifurcation of traffic flows in the normal (failure-less) network state. In the case of a failure, we assume that affected primary flows (i.e.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Loop-Free Interface-Based Fast Reroute Technique

    Publication Year: 2008 , Page(s): 39 - 44
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (115 KB) |  | HTML iconHTML  

    Nowadays, providing reliable network services is getting more and more important. However, traditional failure recovery methods in IP networks are typically reactive, therefore restoration often takes a long time. One of the most interesting solutions is interface-based fast rerouting, where not only the destination address but the incoming interface too is taken into consideration during forwardi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing Low Cost Access Networks with IPTV Performance Constraints

    Publication Year: 2008 , Page(s): 45 - 52
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (151 KB) |  | HTML iconHTML  

    In this paper, we propose to tackle the global problem of designing an access network in order to have enough bandwidth to offer high definition television (HDTV) over the Internet protocol (IPTV). Two important access network architectures are considered: the fiber-to-the-node (FTTN) and the fiber- to-the-premises (FTTP) architectures. An integer mathematical programming model is proposed for thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trend Based Bandwidth Provisioning: An Online Approach for Traffic Engineered Tunnels

    Publication Year: 2008 , Page(s): 53 - 60
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1112 KB) |  | HTML iconHTML  

    In this paper, a novel dynamic bandwidth provisioning scheme for traffic engineered tunnels is proposed. The mechanism uses information from the traffic trend to make resizing decisions and is designed to lower signaling and computational overhead while meeting QoS constraints. The traffic trend is observed using a slope estimator and a memory moderator unit. The slope estimator periodically analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three Methods for Optimizing Single-Shortest Path Routing

    Publication Year: 2008 , Page(s): 61 - 68
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (193 KB) |  | HTML iconHTML  

    Intra-domain routing in IP networks is based on the shortest path principle by assigning administrative weights (costs) to links. The resulting least-cost paths determine routes between pairs of routers. If several such equal-cost paths exist between a pair of routers, it may not be clear which of them is actually used to route traffic. This makes it difficult to predict the network traffic flow d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust and Reactive Traffic Engineering for Dynamic Traffic Demands

    Publication Year: 2008 , Page(s): 69 - 76
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1514 KB) |  | HTML iconHTML  

    Traffic engineering (TE) has become a challenging mechanism for network management and resources optimization due to uncertain and difficult to predict traffic patterns. Recent works have proposed robust optimization techniques to cope with uncertain traffic, computing a stable routing configuration that is immune to demand variations within certain uncertainty set. However, using a single routing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Flushing Mechanism for MBAC in Flow-Aware Networks

    Publication Year: 2008 , Page(s): 77 - 83
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (235 KB) |  | HTML iconHTML  

    The paper describes the flushing mechanism as an enhancement proposed for the measurement based admission control (MBAC) block in flow-aware networks (FAN). It focuses on periodical cleaning of the contents of protected flow list (PFL) in the congestion state. The mechanism is discussed and performance evaluation results are presented. The paper shows the motivation for FAN networks and presents s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Analysis of Flow Aware Load Balancing Mechanisms for Multi-Service Networks

    Publication Year: 2008 , Page(s): 84 - 91
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (231 KB) |  | HTML iconHTML  

    Ethernet technology is being deployed in metro and wide area networks. However, despite recent evolutions, Ethernet cannot be considered a carrier class technology due mainly to the lack of facilities for efficient traffic engineering (TE). In this article, we propose a Flow-aware TE approach for carrier class Ethernet networks providing services like those defined by the Metro Ethernet Forum. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Routing Architecture (HRA)

    Publication Year: 2008 , Page(s): 92 - 99
    Cited by:  Papers (4)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (183 KB) |  | HTML iconHTML  

    Some recent research activities from IETF and IRTF Routing Research Group (RRG) are to explore a new routing and addressing architecture to meet those challenges that current Internet are facing, especially in scalability. An identifier/locator split idea has been widely recognized as an architectural solution to the routing scalability issue. This paper describes a new routing and addressing arch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OSN-IX: A Novel Internet eXchange (IX) Architecture based on Overlaid-Star Networks

    Publication Year: 2008 , Page(s): 100 - 107
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (664 KB) |  | HTML iconHTML  

    We propose a novel Internet Exchange (IX) architecture, namely OSN-IX, which adopts an overlaid-star network (OSN) as an IX. OSN can be considered as a "distributed" switch, which combines the advantages of the network and switch. Compared to other IX architectures, e.g., LAN-based IX, MPLS IX, Photonic IX, etc., OSN-IX has good properties of scalability, resilience, and widely distributed access ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An IPv6 Test-Bed Implementation for a Future Source Address Validation Architecture

    Publication Year: 2008 , Page(s): 108 - 114
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (828 KB) |  | HTML iconHTML  

    Since the Internet uses destination-based packet forwarding, malicious attacks have been launched using spoofed source addresses. In an effort to enhance the Internet with IP source address validation, we prototyped an implementation of the IPv6 source address validation architecture (SAVA) and conducted the evaluation on an IPv6 test-bed. This paper reports our prototype implementation and the te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Underlay Abstraction in the Spontaneous Virtual Networks (SpoVNet) Architecture

    Publication Year: 2008 , Page(s): 115 - 122
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (229 KB) |  | HTML iconHTML  

    Overlay-based services are a popular approach for providing functions like multicast, quality of service or security in the Internet without requiring infrastructure support. This paper presents the Underlay Abstraction Layer in the Spontaneous Virtual Networks (SpoVNet) architecture that enables easy and flexible creation of such services. Also building on an overlay approach, the Underlay Abstra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Protocol for Event Distribution in Next-Generation Dynamic Networks

    Publication Year: 2008 , Page(s): 123 - 130
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (288 KB) |  | HTML iconHTML  

    With the increasing number of devices carried by users and the emergence of more dynamic network scenarios, new solutions have to be developed to support ubiquitous communications. The need for dynamic and transparent auto-configuration and adaptation of applications, devices and networks of devices to a wide variety of events is one of the major challenges. This paper presents a protocol to be us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource Adaptation for Continuous Profit Optimization in Overlay and Virtual Networks

    Publication Year: 2008 , Page(s): 131 - 138
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (317 KB) |  | HTML iconHTML  

    Virtual networks and service overlay networks lease bandwidth from Internet autonomous systems to offer end to end quality of service at competitive costs. In this paper, we propose a novel network resource management approach, based on an economic model, which allows continuous optimizing of the network profit, while keeping acceptable grade of service. The proposal integrates leased link capacit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP Limit: A Streaming Friendly Transport Protocol

    Publication Year: 2008 , Page(s): 139 - 145
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (215 KB) |  | HTML iconHTML  

    In this paper we propose a simple enhancement to TCP (called TCP Limit) which significantly improves the utilization, delay, and jitter characteristics of standard TCP versions. TCP Limit requires only a small sender-side modification and can be applied on top of any TCP versions. Its main advantage is that it can be multiplexed with non-elastic streaming traffic without any router or protocol sup... View full abstract»

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