By Topic

Selected Areas in Communications, IEEE Journal on

Issue 1 • Date Jan. 2004

Filter Results

Displaying Results 1 - 25 of 28
  • Table of contents

    Publication Year: 2004 , Page(s): 0_1
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • IEEE Journal on Selected Areas in Communications Society Information

    Publication Year: 2004 , Page(s): 0_2
    Save to Project icon | Request Permissions | PDF file iconPDF (34 KB)  
    Freely Available from IEEE
  • Guest Editorial Recent Advances in Service Overlay Networks

    Publication Year: 2004 , Page(s): 1 - 5
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | PDF file iconPDF (160 KB) |  | HTML iconHTML  
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lightweight, robust P2P system to handle flash crowds

    Publication Year: 2004 , Page(s): 6 - 17
    Cited by:  Papers (13)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (416 KB) |  | HTML iconHTML  

    An Internet flash crowd (also known as hot spots) is a phenomenon that results from a sudden, unpredicted increase in an on-line object's popularity. Currently, there is no efficient means within the Internet to deliver Web objects scalably under hot spot conditions to all clients that desire the object. We present peer-to-peer (P2P) randomized overlays to obviate flash-crowd symptoms (PROOFS), a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction of locality-aware overlay network: mOverlay and its performance

    Publication Year: 2004 , Page(s): 18 - 28
    Cited by:  Papers (43)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (456 KB) |  | HTML iconHTML  

    There are many research interests in peer-to-peer (P2P) overlay architectures. Most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. Structured overlay networks based on distributed hash tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. An important aspect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QRON: QoS-aware routing in overlay networks

    Publication Year: 2004 , Page(s): 29 - 40
    Cited by:  Papers (96)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (352 KB) |  | HTML iconHTML  

    Recently, many overlay applications have emerged in the Internet. Currently, each of these applications requires their proprietary functionality support. A general unified framework may be a desirable alternative to application-specific overlays. We introduce the concept of overlay brokers (OBs). We assume that each autonomous system in the Internet has one or more OBs. These OBs cooperate with ea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tapestry: a resilient global-scale overlay for service deployment

    Publication Year: 2004 , Page(s): 41 - 53
    Cited by:  Papers (527)  |  Patents (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (432 KB) |  | HTML iconHTML  

    We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, location-independent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and routing applications programming interface using a self-repairing, soft-state-based routing layer. The paper presents ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and evaluation of a distributed scalable content discovery system

    Publication Year: 2004 , Page(s): 54 - 66
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (376 KB) |  | HTML iconHTML  

    A content discovery system (CDS) allows nodes in the system to discover contents published by some other nodes in the system. Existing CDS systems have difficulties in achieving both scalability and rich functionality. We present the design and evaluation of a distributed and scalable CDS. Our system uses rendezvous points (RPs) for content registration and query resolution, and can accommodate fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing the unmeasured: an algebraic approach to Internet mapping

    Publication Year: 2004 , Page(s): 67 - 78
    Cited by:  Papers (8)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    Distance estimation is important to many Internet applications. It can aid a World Wide Web client when selecting among several potential candidate servers or among candidate peer-to-peer servers. It can also aid in building efficient overlay or peer-to-peer networks that react dynamically to changes in the underlying Internet. One of the approaches to distance (i.e., time delay) estimation in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overlay networks of in situ instruments for probabilistic guarantees on message delays in wide-area networks

    Publication Year: 2004 , Page(s): 79 - 90
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB) |  | HTML iconHTML  

    Messages transported over wide-area networks are subject to various delays at the hosts and intermediate nodes. In addition to bandwidth limits, the delays have an apparent "random" component due to the complicated dynamics of the network traffic. We consider that the messages sent over the network are subjected to three types of delays: 1) propagation delays along the links; 2) delays due to band... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • oStream: asynchronous streaming multicast in application-layer overlay networks

    Publication Year: 2004 , Page(s): 91 - 106
    Cited by:  Papers (98)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (536 KB) |  | HTML iconHTML  

    Although initially proposed as the deployable alternative to Internet protocol multicast, the application-layer overlay network actually revolutionizes the way network applications can be built, since each overlay node is an end host and is able to carry out more functions than simply forwarding packets. The paper addresses the on-demand media distribution problem in the context of an overlay netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast with network coding in application-layer overlay networks

    Publication Year: 2004 , Page(s): 107 - 120
    Cited by:  Papers (52)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (496 KB) |  | HTML iconHTML  

    All of the advantages of application-layer overlay networks arise from two fundamental properties: 1) the network nodes in an overlay network, as opposed to lower-layer network elements such as routers and switches, are end systems and have capabilities far beyond basic operations of storing and forwarding; 2) the overlay topology, residing above a densely connected Internet protocol-layer wide-ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A peer-to-peer architecture for media streaming

    Publication Year: 2004 , Page(s): 121 - 133
    Cited by:  Papers (133)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (776 KB) |  | HTML iconHTML  

    Given that the Internet does not widely support Internet protocol multicast while content-distribution-network technologies are costly, the concept of peer-to-peer could be a promising start for enabling large-scale streaming systems. In our so-called Zigzag approach, we propose a method for clustering peers into a hierarchy called the administrative organization for easy management, and a method ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On expiration-based hierarchical caching systems

    Publication Year: 2004 , Page(s): 134 - 150
    Cited by:  Papers (4)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (456 KB) |  | HTML iconHTML  

    Caching is an important means to scale up the growth of the Internet. Weak consistency is a major approach used in Web caching and has been deployed in various forms. The paper investigates some fundamental properties and performance issues associated with an expiration-based caching system. We focus on a hierarchical caching system based on the time-to-live expiration mechanism and present a basi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks

    Publication Year: 2004 , Page(s): 151 - 163
    Cited by:  Papers (36)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (376 KB) |  | HTML iconHTML  

    We study a fundamental tradeoff issue in designing a distributed hash table (DHT) in peer-to-peer (P2P) networks: the size of the routing table versus the network diameter. Observing that existing DHT schemes have either 1) a routing table size and network diameter both of O(log2n), or 2) a routing table of size d and network diameter of O(n1d/), S. Ratnasamy et al. (2001) as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of architectures for reliable server pooling in wired and wireless environments

    Publication Year: 2004 , Page(s): 164 - 175
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (480 KB) |  | HTML iconHTML  

    Reliable server pooling (RSP) allows a pool of redundant information sources to be viewed as a single transport endpoint and, therefore, it is able to provide persistent connections and balanced traffic for different applications. The Internet Engineering Task Force RSerPool Working Group has proposed an architecture to implement the RSP; it defines an overlay network providing an upper layer prot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SOS: an architecture for mitigating DDoS attacks

    Publication Year: 2004 , Page(s): 176 - 188
    Cited by:  Papers (48)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (320 KB) |  | HTML iconHTML  

    We propose an architecture called secure overlay services (SOS) that proactively prevents denial of service (DoS) attacks, including distributed (DDoS) attacks; it is geared toward supporting emergency services, or similar types of communication. The architecture uses a combination of secure overlay tunneling, routing via consistent hashing, and filtering. We reduce the probability of successful a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resilient self-organizing overlay networks for security update delivery

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

    Rapid and widespread dissemination of security updates throughout the Internet will be invaluable for many purposes, including sending early-warning signals, updating certificate revocation lists, distributing new virus signatures, etc. Notifying a large number of machines securely, quickly, and reliably is challenging. Such a system must outpace the propagation of threats, handle complexities in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Journal on Selected Areas in Communications Mobile Computing and Networking

    Publication Year: 2004 , Page(s): 203
    Save to Project icon | Request Permissions | PDF file iconPDF (121 KB)  
    Freely Available from IEEE
  • IEEE Journal on Selected Areas in Communications Nanotechnologies for Communications

    Publication Year: 2004 , Page(s): 204
    Save to Project icon | Request Permissions | PDF file iconPDF (108 KB)  
    Freely Available from IEEE
  • IEEE Journal on Selected Areas in Communications Differential and Noncoherent Wireless Communications

    Publication Year: 2004 , Page(s): 205
    Save to Project icon | Request Permissions | PDF file iconPDF (110 KB)  
    Freely Available from IEEE
  • IEEE Journal on Selected Areas in Communications Wireless Overlay Networks Based on Mobile IPv6

    Publication Year: 2004 , Page(s): 206
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB)  
    Freely Available from IEEE
  • IEEE Journal on Selected Areas in Communications Security in Wireless Ad-Hoc Networks

    Publication Year: 2004 , Page(s): 207
    Save to Project icon | Request Permissions | PDF file iconPDF (143 KB)  
    Freely Available from IEEE
  • Proceedings of the IEEE celebrating 92 years of in-depth coverage on emerging technologies

    Publication Year: 2004 , Page(s): 208
    Save to Project icon | Request Permissions | PDF file iconPDF (319 KB)  
    Freely Available from IEEE
  • IEEE Member Digital Library [advertisement]

    Publication Year: 2004 , Page(s): 209
    Save to Project icon | Request Permissions | PDF file iconPDF (179 KB)  
    Freely Available from IEEE

Aims & Scope

IEEE Journal on Selected Areas in Communications focuses on all telecommunications, including telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Muriel Médard
MIT