By Topic

2007 Next Generation Internet Networks

21-23 May 2007

Filter Results

Displaying Results 1 - 25 of 43
  • Covers

    Publication Year: 2007, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (65 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2007, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (110 KB)
    Freely Available from IEEE
  • NGI 2007 Contents

    Publication Year: 2007, Page(s):iii - v
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Freely Available from IEEE
  • Message from the Chairman

    Publication Year: 2007, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (94 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Technical Program Chairmen

    Publication Year: 2007, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (96 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organization-Executive Committee

    Publication Year: 2007, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2007, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2007, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (91 KB)
    Freely Available from IEEE
  • IETF: The Next Generation - what is a generation, anyway?

    Publication Year: 2007, Page(s): xv
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (121 KB)

    The term "generation" is used heavily, usually with the idea that there can be fundamental changes to the way in which things work. Some fundamental changes have happened, and caused great upheavals in the way we manage our daily lives - other things that have been labelled "next generation" have vanished without a trace. This talk focuses on how standards processes interact with the concept of ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trends towards Next Generation Internet

    Publication Year: 2007, Page(s):xvi - xvii
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (186 KB) | HTML iconHTML

    In recent years we can witness a new wave of activities and projects to explore different paths towards Next Generation Internet. After the decade where the Internet Protocol becomes mainstream in communication networks integrating and carrying all new types of services with increasing traffic volume and complexity, there are rising concerns whether the aging Internet protocol architecture with it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Architecture Evolution: towards "All-IP"

    Publication Year: 2007, Page(s):xviii - xix
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (130 KB)

    New services, new applications, new profiles of clients, new networking technologies and new forms of communications, such as peer-to-peer, and media/content-to-person, are all driving the need for a converged all-IP network that can provide an "agnostic" layer between the service and transport layers. Designing and realizing such an IP-based network architecture require a through understanding no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accuracy Evaluation of Application-Level Performance Measurements

    Publication Year: 2007, Page(s):1 - 5
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    In many cases, application-level measurements can be the only way for an application to evaluate and adapt to the performance offered by the underlying networks. Applications perceive heterogeneous networking environments spanning over multiple administrative domains as "black boxes" being inaccessible for lower-level measurement instrumentation. However, application-level measurements can be inac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relying on randomness PlanetLab experiments with distributed file-sharing protocols

    Publication Year: 2007, Page(s):6 - 13
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (498 KB) | HTML iconHTML

    In this paper we present and evaluate a fully distributed file-sharing system architecture. Initially, a seeder node splits a large file into moderate-sized chunks and offers it for download. The seeder and all peers interested in downloading the file join a Chord-based overlay and contact each other randomly for chunk transfers. We report and discuss PlanetLab tests on this system as well as on o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and development of a DS-TE experimental testbed with Point-to-Multipoint LSP support

    Publication Year: 2007, Page(s):14 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (675 KB) | HTML iconHTML

    Nowadays, many IP backbone networks adopt separate control and forwarding planes for unicast and multicast traffic flows. Indeed, while MPLS (multiprotocol label switching) is widely deployed for unicast traffic, IP multicast is the only available solution for the delivery of "one-to-many" traffic flows. With P2MP LSPs (Point-to-Multipoint Label Switched Paths) support, a unified control and forwa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Web Prefetching by Making Predictions at Prefetch

    Publication Year: 2007, Page(s):21 - 27
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    Most of the research attempts to improve Web prefetching techniques have focused on the prediction algorithm with the objective of increasing its precision or, in the best case, to reduce the user's perceived latency. In contrast, to improve prefetching performance, this work concentrates in the prefetching engine and proposes the Prediction at Prefetch (P@P) technique. This paper explains how a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generic approximate transient analysis applied to a priority queue

    Publication Year: 2007, Page(s):28 - 35
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (202 KB) | HTML iconHTML

    In this paper, we develop an efficient method to approximate the transient behavior of queueing systems. More precisely, it is shown how singularity analysis of a known transform function of a transient sequence leads to an approximation of this sequence. To illustrate our approach, the transient system contents of both classes in a two-class discrete-time priority queue are investigated. By means... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks

    Publication Year: 2007, Page(s):36 - 39
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (137 KB) | HTML iconHTML

    The use of Vickrey-Clarke-Groves (VCG) auction mechanisms is gaining popularity in the networking community, where it seems compulsory to incentivize selfish nodes (in ad hoc networks) or domains (in inter-domain communications) to forward the traffic of their peers. Indeed, VCG auctions are known to both be efficient and produce proper incentives. In this note, we argue that, in fact, VCG auction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time ARQ Protocol for Improved Impulsive Noise Robustness of ADSL Systems

    Publication Year: 2007, Page(s):40 - 47
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    Impulsive noise robustness is one of the major challenges for the support of new kinds of services like video transmission via ADSL access networks. This paper investigates the application of a real-time ARQ protocol at the ADSL physical layer as an alternative to standardised forward error correction in combination with interleaving. Simulation results based on an impulsive noise model derived fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protocol stack and capacity modeling for WLAN

    Publication Year: 2007, Page(s):48 - 55
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB) | HTML iconHTML

    Queuing theoretical modeling is a commonly used method for load/capacity analyses of computer networks. This work presents a model for WLAN. In contrast to other works that offer analytical models aiming at general insights to WLAN MAC properties (e.g. [6-9]), an empirical model for capacity analysis under concrete load conditions was developed. The model accounts for relevant communication proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Seamless Connectivity in WLAN and Cellular Networks with Multi Criteria Decision Making

    Publication Year: 2007, Page(s):56 - 63
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    The evolution of today's wireless and mobile technologies and personalized hand-held devices has increased the challenge to handle the trade-off between mobility, performance and cost. The user simply needs to be Always Best Connected (ABC). To make this happen, different types of criteria reflecting relevant characteristics of wireless and mobile access networks such as WLAN, UMTS and GPRS have t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Resource Management by Access Points and Stations for Fair and Efficient Sharing of Wireless LANs

    Publication Year: 2007, Page(s):64 - 71
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1556 KB) | HTML iconHTML

    The future network will consist of heterogeneous ones, and wireless networks will play a more important role there in providing pervasive services. Our major concern is to develop a way of achieving efficient and fair share of resources in the wireless network, which is built of various equipments. In this regard, one of the significant issue for each station (STA) is how to select an appropriate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Survivable Routing of Unicast and Anycast Flows in MPLS Networks

    Publication Year: 2007, Page(s):72 - 79
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB) | HTML iconHTML

    Most of previous research in anycasting has been focused on best-effort networks and IP networks. In contrast, we propose a QoS-based routing of anycast demands in connection-oriented MPLS network. Since in real networks different kinds of flows are transmitted over the same links, we assume that both unicast and anycast requests must be served in the network. Survivability of the network is one o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying OD Cycles to Multi-domain, Multi-service Survivable Networks

    Publication Year: 2007, Page(s):80 - 87
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    The origin-destination (OD) cycles approach is applied in this paper to heterogeneous networks, with regard to topologies and services. Decomposition of these networks is performed through gateways that are consequently part of OD cycles associated with inter-domain survivable traffic. Route-diverse cycle parts, called Y and X, are defined to establish cross-domain OD cycles for cases where two ga... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing the file availability and download time in a P2P file sharing system

    Publication Year: 2007, Page(s):88 - 95
    Cited by:  Papers (3)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (202 KB) | HTML iconHTML

    In this paper we study the performance of P2P file sharing systems. We are especially interested in how the division of the file into chunks as well as the used chunk selection policy influence on two performance metrics, named the availability and mean download time of the file. We propose a detailed Markov chain model that allows estimating the mean lifetime of the system and comparing different... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relationship between the algebraic connectivity and graph's robustness to node and link failures

    Publication Year: 2007, Page(s):96 - 102
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB) | HTML iconHTML

    We study the algebraic connectivity in relation to the graph's robustness to node and link failures. Graph's robustness is quantified with the node and the link connectivity, two topological metrics that give the number of nodes and links that have to be removed in order to disconnect a graph. The algebraic connectivity, i.e. the second smallest eigenvalue of the Laplacian matrix, is a spectral pr... View full abstract»

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