By Topic

Computer Communications, 2003. CCW 2003. Proceedings. 2003 IEEE 18th Annual Workshop on

Date 20-21 Oct. 2003

Filter Results

Displaying Results 1 - 25 of 34
  • SCTP: state of the art in research, products, and technical challenges

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

    The stream control transmission protocol (SCTP) is being standardized by IETF as a reliable transport protocol to address a number of limitations of TCP. Due to its attractive features, such as multi-streaming and multi-homing, SCTP has received much attention from the research community and industry. The paper serves as a tutorial by introducing the main features of SCTP, and discussing the state... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improvement to HOME based Internet caching protocol

    Publication Year: 2003 , Page(s): 159 - 165
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (286 KB) |  | HTML iconHTML  

    An efficient inter-cache communication protocol is one of the key techniques to win better cache performance. ICP (Internet caching protocol) and its extensions - CARP (cache array routing protocol) and HOME (home-based cooperative cache array protocol) - are well-known existing cache array protocols. However, ICP may cause a lot of Internet messages and could have many duplicated objects in cache... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible service creation node architecture and its implementation

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

    With the spread of always-on forms of broadband-access, such as ADSL and FTTH, new content-delivery services have appeared. However, conventional network nodes are not capable of providing rapid content provision, because they have poor scalability and a lack of reliability. We propose a flexible service-creation node architecture, based on the following concepts. Scalability is achieved by insert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coverage-aware self-scheduling in sensor networks

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

    One important measurement of a sensor network's performance is how well the sensor network can monitor a covered area, namely network coverage. We propose a scheme to improve the network coverage of a sensor network. We assume that each sensor can probabilistically detect a nearby event, and build a probabilistic model of network coverage by considering the data correlation among neighboring senso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characteristics of resource allocation using pricing

    Publication Year: 2003 , Page(s): 59 - 65
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (282 KB) |  | HTML iconHTML  

    We consider pricing of network resources in a reservation-based QoS architecture. The pricing policy implements a distributed resource allocation to provide guaranteed bounds on packet loss and end-to end delay for real-time applications. Distributed pricing roles are assigned to each user, each network node, and an arbitrager in between the user and the network. We explore the characteristics of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed power controlled medium access control for ad-hoc wireless networks

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

    We develop and investigate a new medium access control (MAC) algorithm and protocol for ad-hoc wireless networks that employs power control spatial-reuse scheduling techniques. We. introduce a novel interference graph (the power-based interference graph), whose independence and chromatic numbers provide fundamental bounds for the integrated scheduling-power control problem. Based on the properties... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probability and average occupancy calculations in RED algorithm

    Publication Year: 2003 , Page(s): 148 - 153
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (438 KB) |  | HTML iconHTML  

    We present several improvements to the RED (random early detection) algorithm. These improvements include simplified, faster calculations of discard probability, and a new "double-weight" method of average calculations. In this method, the RED algorithm reacts to changes of queue occupancy more "intelligently", providing better values of its average. Our findings are supported by simulation result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Securing mobile networks in an operational setting

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

    The paper describes a network demonstration and three month field trial of mobile networking using Mobile-IPv4. The network was implemented as part of the US Coast Guard operational network which is a ".mil" network and requires stringent levels of security. The initial demonstrations took place in November 2002 and a three month field trial took place from July through September of 2003. The mobi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SCTP over satellite networks

    Publication Year: 2003 , Page(s): 112 - 116
    Cited by:  Papers (5)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (282 KB) |  | HTML iconHTML  

    The stream control transmission protocol (SCTP) has recently been standardized as a new transport layer protocol in the IP suite. In addition to the core features of TCP, SCTP incorporates a number of advanced and unique features which are not available in TCP. The paper investigates the suitability of SCTP for data communications over satellite links. We describe SCTP features that allow SCTP to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A media streaming protocol for heterogeneous wireless networks

    Publication Year: 2003 , Page(s): 30 - 33
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (383 KB) |  | HTML iconHTML  

    We propose a protocol for media streaming in wireless IP-capable mobile multi-homed hosts. Next generation wireless networks, like 3G, 802.11a WLAN, and Bluetooth, are the target underlying technologies for the proposed protocol. Operation at the transport layer guarantees TCP-friendliness, error resilience, and independence from-the inner workings of the access technology. Furthermore, compatibil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Code generating routers: a network-centric approach to mobile code

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

    Inexpensive wireless networks have transformed once autonomous mobile devices into nodes of large distributed systems. However, existing approaches to executing mobile code do not fully exploit the available networking infrastructure. We present an infrastructure-based network computing approach. Instead of embedding a JIT compiler component into every mobile device, we shift the mobile code optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid indirect transmissions (HIT) for data gathering in wireless micro sensor networks with biomedical applications

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

    Sensor networks have many potential applications in biology, physics, medicine, and the military. One major challenge is to maximize network life under the constraint of an extremely limited power supply. This is especially true for biomedical applications, which require large numbers of nodes that may be implanted in a subject; frequent battery changes are impractical. The paper proposes a new da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Smooth handoff scheme for stream media with bandwidth disparity in wireless cells

    Publication Year: 2003 , Page(s): 9 - 16
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (420 KB) |  | HTML iconHTML  

    Multimedia applications, such as streaming media, will become very popular in future heterogeneous wireless networks. There are two main reasons for difficulties in the smooth transmission of a streaming media application during user movement: (1) packets may get lost due to the re-routing caused by. handoffs; (2) due to the disparity in the amount of available bandwidth among wireless cells, hand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The case for delay-based congestion control

    Publication Year: 2003 , Page(s): 99 - 104
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (298 KB) |  | HTML iconHTML  

    We argue that, in the absence of explicit feedback, delay-based algorithms become the preferred approach for end-to-end congestion control as networks scale up in capacity. Their advantage is small at low speed but decisive at high speed. The distinction between packet-level and flow-level problems of the current TCP exposes the difficulty of loss-based algorithms at large congestion windows. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to facilitating real-time multicast & memory-replication channels and using them in TMO-structured multimedia applications

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

    Structuring real-time distributed computing systems in the form of networks of real-time objects has become a research and development field of steady growth in the past decade. In addition to the conventional remote method invocation mechanism for facilitating interactions among real-time objects, a multicast support mechanism has been recognized as an attractive supplement. One of the most power... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed discovery using preference for query hits

    Publication Year: 2003 , Page(s): 210 - 216
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (528 KB) |  | HTML iconHTML  

    We consider peer-to-peer and distributed networks where a large number of objects (such as users, information and applications) are distributed and they move dynamically. In such a distributed network environment, the ability to discover objects that match given query criteria, such as a set of keywords, is highly desirable. We propose a discovery mechanism that is scalable, adaptable and robust t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Networks of queues: myth and reality

    Publication Year: 2003 , Page(s): 154 - 158
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (238 KB) |  | HTML iconHTML  

    Networks of queues are basic models for the analysis and design of computer networks, and represent, in their own right, an important research field, originated by the seminal work of J.R. Jackson (see Operations Research, vol.5, no.4, p.518-21, 1957; vol.50, no.1, p.112-13, 2002). Various networks of queues, proposed after Jackson, are different generalizations or variations of a class of fundame... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context management with programmable mobile networks

    Publication Year: 2003 , Page(s): 217 - 223
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (430 KB) |  | HTML iconHTML  

    We show that the use of context information can significantly improve the services of mobile networking systems. We present an architecture for context management which addresses the specific requirements of mobile networks. Context information is collected at different locations in the network, and then preprocessed before transmitting to the mobile device. Our context management framework clearl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LARK: a light-weight, resilient application-level multicast protocol

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

    Application-level multicasting (ALM) has attracted a significant amount of attention, as it is a convincing alternative over traditional IP multicasting. We present a simple, light-weight, yet scalable, ALM protocol, called. LARK, that allows the formation and maintenance of overlay topologies in a completely distributed fashion while maintaining only O(1) state at each node and ensuring robustnes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive techniques for minimizing middleware memory footprint for distributed, real-time, embedded systems

    Publication Year: 2003 , Page(s): 54 - 58
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (387 KB) |  | HTML iconHTML  

    In order for middleware to be widely useful for distributed, real-time, and embedded systems, it should provide a full set of services and be easily customizable to meet the memory footprint limitations of embedded systems. We examine a variety of techniques used to reduce the memory footprint in middleware. We find that combining aspect-oriented programming with code shrinkers and obfuscators red... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A protocol for rapid symbol duration adaptation and feedback in CDMA networks

    Publication Year: 2003 , Page(s): 40 - 46
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (425 KB) |  | HTML iconHTML  

    We present a closed-loop architecture and protocols for rapid dynamic spreading gain adaptation and fast feedback between a transmitter and a receiver communicating with each other in CDMA networks. This protocol does not require the transfer of an explicit control message indicating the change of CDMA spreading gain from transmitter to receiver. Also, according to this protocol, the transmitter c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of realistic optical time division multiplexed wavelength routed networks

    Publication Year: 2003 , Page(s): 134 - 138
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (241 KB) |  | HTML iconHTML  

    Application of optical time division multiplexing (OTDM) in wavelength routed optical networks greatly enhances the flexibility of bandwidth assignment because OTDM provides time division sub-channels in a wavelength to match the processing speed of electronic devices. Different types of such OTDM wavelength-routed (OTDM-WR) networks, assuming different levels of sophistication of the OTDM technol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A paracasting model for concurrent access to replicated content

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

    We propose a framework to study how to download effectively a copy of the same document from a set of replicated servers. A generalized application-layer anycasting, known as paracasting, has been proposed to advocate concurrent access of a subset of replicated servers to satisfy cooperatively a client's request. Each participating server satisfies the request in part by transmitting a subset of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting mobility in large scale ad hoc wireless networks

    Publication Year: 2003 , Page(s): 34 - 39
    Cited by:  Papers (4)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (289 KB) |  | HTML iconHTML  

    Mobility is generally viewed as a major impediment in the control and management of large scale wireless networks. However, researchers have recently looked at mobility in a different way, trying to take advantage of it instead of protecting from it. In the literature, mobility is generally modeled as independent random moves by each node. However, in reality, mobile nodes tend to show some degree... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An end-to-end QoS framework with on-demand bandwidth reconfiguration

    Publication Year: 2003 , Page(s): 66 - 74
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (450 KB) |  | HTML iconHTML  

    The paper proposes a new QoS framework, called on-demand QoS path (ODP), which provides end-to-end QoS guarantees to individual flows with minimal overhead, while keeping the scalability characteristic of DiffServ. ODP exercises per-flow admission control and end-to-end bandwidth reservation at the edge of the network and only differentiates service types in the core of the network. In addition, t... View full abstract»

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