An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

/pdf/dynamic-source-routing-in-ad-hoc-wireless-networks-4xwr15u0ve.pdf

Dynamic Source Routing in Ad Hoc Wireless Networks

In both e-business and e-science, we often need to integrate services across distributed, heterogeneous, dynamic “virtual organizations” formed from the disparate resources within a single enterprise and/or from external resource sharing and service provider relationships. This integration can be technically challenging because of the need to achieve various qualities of service when running on top of different native platforms. We present an Open Grid Services Architecture that addresses these challenges. Building on concepts and technologies from the Grid and Web services communities, this architecture defines a uniform exposed service semantics (the Grid service); defines standard mechanisms for creating, naming, and discovering transient Grid service instances; provides location transparency and multiple protocol bindings for service instances; and supports integration with underlying native platform facilities. The Open Grid Services Architecture also defines, in terms of Web Services Description Language (WSDL) interfaces and associated conventions, mechanisms required for creating and composing sophisticated distributed systems, including lifetime management, change management, and notification. Service bindings can support reliable invocation, authentication, authorization, and delegation, if required. Our presentation complements an earlier foundational article, “The Anatomy of the Grid,” by describing how Grid mechanisms can implement a service-oriented architecture, explaining how Grid functionality can be incorporated into a Web services framework, and illustrating how our architecture can be applied within commercial computing as a basis for distributed system integration—within and across organizational domains. This is a DRAFT document and continues to be revised. The latest version can be found at http://www.globus.org/research/papers/ogsa.pdf. Please send comments to foster@mcs.anl.gov, carl@isi.edu, jnick@us.ibm.com, tuecke@mcs.anl.gov Physiology of the Grid 2

/pdf/the-physiology-of-the-grid-an-open-grid-services-5cyc22jnqc.pdf

The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration

This document describes an updated version of the "Security
Architecture for IP", which is designed to provide security services
for traffic at the IP layer. This document obsoletes RFC 2401
(November 1998). [STANDARDS-TRACK]

/pdf/security-architecture-for-the-internet-protocol-1x2l107p1d.pdf

Security Architecture for the Internet Protocol

This memo discusses a proposed extension to the Internet architecture and protocols to provide integrated services, i.e., to support real- time as well as the current non-real-time service of IP. This extension is necessary to meet the growing need for real-time service for a variety of new applications, including teleconferencing, remote seminars, telescience, and distributed simulation.

Integrated Services in the Internet Architecture: an Overview

This memo describes version 1 of RSVP, a resource reservation setup protocol designed for an integrated services Internet. RSVP provides receiver-initiated setup of resource reservations for multicast or unicast data flows, with good scaling and robustness properties.

/pdf/resource-reservation-protocol-rsvp-version-1-functional-23f52q50an.pdf

Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification

A resource reservation protocol (RSVP), a flexible and scalable receiver-oriented simplex protocol, is described. RSVP provides receiver-initiated reservations to accommodate heterogeneity among receivers as well as dynamic membership changes; separates the filters from the reservation, thus allowing channel changing behavior; supports a dynamic and robust multipoint-to-multipoint communication model by taking a soft-state approach in maintaining resource reservations; and decouples the reservation and routing functions. A simple network configuration with five hosts connected by seven point-to-point links and three switches is presented to illustrate how RSVP works. Related work and unresolved issues are discussed. >

/pdf/rsvp-a-new-resource-reservation-protocol-ew2ul3cri4.pdf

RSVP: a new resource ReSerVation Protocol

/pdf/rsvp-a-new-resource-reservation-protocol-5gd2s89bth.pdf

RSVP: a new resource reservation protocol

This chapter tries to make the general design of RSVP relatively independent of the architectural components. Clearly, a particular implementation of RSVP is tied quite closely to the flowspec and interfaces used by the routing and admission control algorithms. However, the general protocol design should be independent of these. In particular, the protocol should be capable of establishing reservations across networks that implement different routing algorithms, such as IP unicast routing, IP multicast routing, the recently proposed core based tree (CBT) multicast routing, or some future routing protocols. This design goal makes RSVP deployable in many contexts. For optimally efficient routing decisions, however, routing selection and resource reservation should be integrated—so the choice of route can depend on the quality of service requested, and the stability of the route can be maintained over the duration of the reservation. The first RSVP design is verified by a detailed simulation and preliminary implementation. Much testing remains to be done in the context of larger scale simulations, as well as in real prototype networks, such as DARTnet.

/pdf/rsvp-a-new-resource-reservation-protocol-novel-design-5r4othynrg.pdf

RSVP: A New Resource ReSerVation Protocol: Novel design features lead to an Internet protocol that is flexible and scalable.

We are developing a distributed architecture for massively-multiplayer games. In this paper, we focus on designing a low-latency event ordering protocol, called NEO, for this architecture. Previous event ordering protocols prevent several types of cheats at the expense of operating at the latency of the slowest player. We broaden the definition of cheating to include four common protocol level cheats and demonstrate how NEO prevents these cheats. At the same time, NEO has a playout latency independent of network conditions and adapts to network congestion to optimize performance.

/pdf/low-latency-and-cheat-proof-event-ordering-for-peer-to-peer-133hyyyiw9.pdf

Low latency and cheat-proof event ordering for peer-to-peer games

Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distributed computing. Our system, Cluster Computing on the Fly, seeks to harvest cycles from ordinary users in an open access, non-institutional environment. CCOF encompasses all activities involved in the management of idle cycles: overlay construction for hosts donating cycles, resource discovery within the overlay, application-based scheduling, local scheduling on the host node, and meta-level scheduling among a community of application-level schedulers. In this paper, we identify four important classes of cycle-sharing applications, each requiring its own scheduling strategy: workpile, workpile with deadlines, tree-based search, and point-of-presence. We describe a Wave Scheduler for workpile tasks that exploits idle night-time cycles using a geographic-based overlay. The scheduler incorporates a quizzing mechanism to check the correctness of results and determine trust ratings for the hosts. We also propose a Point-of-Presence Scheduler to discover and schedule hosts that meet application-specific requirements for location, topological distribution, and available resources.

/pdf/cluster-computing-on-the-fly-p2p-scheduling-of-idle-cycles-2al6qvgoqq.pdf

Daniel Zappala

Papers

RSVP: a new resource ReSerVation Protocol

RSVP: a new resource reservation protocol

RSVP: A New Resource ReSerVation Protocol: Novel design features lead to an Internet protocol that is flexible and scalable.

Low latency and cheat-proof event ordering for peer-to-peer games

Cluster computing on the fly : P2P scheduling of idle cycles in the internet