Papers should be addressed to the Managing Editor, IEE Proceedings-Computers and Digital Techniques, Publishing Depart ment, Institution of Electrical Engineers, Michael Faraday House, Six Hills Way, Stevenage, Herts.

The adaptive algorithms based on Duato's theory [6] do not satisfy this, since they require the message in the above exam ple to rechoose a channel, to avoid deadlocks, after waiting for a finite amount of time.

Case 2: If Mis a message on an f-ring, it is routed using the virtual channel and orientation shown in Table 1 until it reaches the other parallel side of the f-ring such that current host and destination match ind' (see Fig. 3).

Our algorithms are deadlock and livelock free and correctly deliver messages between any pair of nonfaulty nodes in a connected component of the network even in the presence of multiple faulty blocks.

To study the performance issues, we have taken a fully-adaptive wormhole algorithm, NHop, developed originally for routing in fault-free networks, and forti fied it with extra virtual channels and the fault-tolerant logic described in this paper.

- Account Info - Help Welcome, Guest yc-discuss · Yallcast Discussion Group Description General discussion group for yallcast technical issues.

Privacy Policy - Terms of Service - Guidelines - Help Register - Sign In [ Join This Group! ]

You are not recognized as a member of this group.

If you are already a member, you may have joined with an email address not linked to this Yahoo!

[ Join ] Group Info Members: 23 Founded: Dec 15, 1999 Language: English Group Settings · Not listed in directory · Open membership · Unmoderated · All members may post · Public archives · Email attachments are permitted

It allows a group of hosts that are receiving/sending content to dynamically self-organize themselves into a distribution topology tunneled over unicast and, where available, multicast IP.

So organized, the hosts can efficiently distribute content synchronously (as with the mbone) or asynchronously (as with netnews).

The first and enduring goal of this project is to create an open-source software base upon which a wide range of content distribution applications can be built.

The second goal is to use the knowledge gained from the software to create IETF standards for content distribution.

We envision these standards as being positioned as "lower-middleware"---above TCP/UDP but below other middleware such as messaging, mail, channels, etc. Yoid Software Yoid Documentation Related Projects Mailing Lists People Yoid is a continuation of the Yallcast project started at the NTT Software Labs in Tokyo.

Lenny Sheet, Lock/reed Martin Session 9 Modeling and Slmulation Chair Dr. Eric Chris tensen, Motorola Virtual Proto typing for Mobile Distributed Wireless Terrestrial Communications Systems and Network .. ................ 329

Gretchen Bive11s, Rome Laboralory, Charles Hammond, Stanford Telecom, Max Williams, Stanford Telecom, and Mnrli11 Katz, Scie11ce Applications /11temntio11nl Corpora/ion High Quality ATM Operation over Military and Commercial Satellites ........................................................................... .475 Anil Agarwal, COMSAT Laboratories, R. Mnlghn11 , COMSAT Laboratories, Hnri Bezwada, United States Anny Commu nicatio11s and Electronic Co111111n11d, 1111d Lawrrnce E. Ki11gsley, United States Army Communications and Electronic Command Performance of Integrated Inter LAN Telephony Service Over an ATM Network ............................................................ 481

Bums, United States Naval Reserve, and Jo/zn E. Hurthcre, NCCOSC, ROTE Session 32 DoD Communications Advances Chair Wayne Bosner, Rome Laboratory Standards,Requirements, and Recommendations Development for Multiband, Multimode Radio Systems ............ 1184

Do11ald C. rlmore, Lockheed Martm Tactical Dcfe11sc Systems 1111d Terry R. H11rd, Harris Corporntio11 Bro;idband Line of Sig ht Wircll'!>S WAN Using Multibe;im Phased Arrays and High Capacity Tnmk Ratlios .......... 1453

Performances of the DRP and PIM are compared in various aspects: control traffic overhead in managing the CRPs, number of steps of building up and extending a RP tree, and efficiency of the RP-trees in distributing user data to the members and non-member sending to the group.

Organizing Committee Referees Message from General Chair Message from Program Co-Chairs Message from Sigmetrics Chair ... Keynote Address: The Internet and Its Future Leonard Kleinrock, Chairman and Founder, Nomadic Inc., Professor, Department of Computer Science, UCLA Session 1: Network Architecture and Protocols A Case for End System Multicast....: Yang-hua Chu, Sanjay Rao, Hui Zhang, Carnegie Mellon University PLM: Fast Convergence for Cumulative Layered Multicast Transmission Schemes Amaud Legout, Ernst W. Biersack, Institut EURECOM On Achievable Service Differentiation with Token Bucket Marking for TCP Sambit Sahu, University of Massachusetts, Philippe Nain, INRIA Sophia Antipolis, Don Towsley, University of Massachusetts, Christophe Diot, Sprint ATL, Victor Firiou, Nortel Networks in vn Session 2: File and Storage Systems Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs William J. Bolosky, John R. Douceur, Microsoft Research, David Ely, University of Washington, Marvin Theimer, Microsoft Research Comparing Random Data Allocation and Data Striping in Multimedia Servers Jose Renato Santos, Richard Muntz, UCLA, Berthier Ribeiro-Neto, Universidade Federal de Minas Gerais Modeling and Performance of MEMS-Based Storage Devices John Linwood Griffin, Steven W. Schlosser, Gregory R. Ganger, David F.Nagle, Carnegie Mellon University.

Lui, The Chinese University of Hong Kong Using the Exact State Space of a Markov Model to Compute Approximate Stationary Measures 207 Andrew S Miner, Gianfranco Ciardo, College of William and Mary, Susanna Donatelli, Universita di Torino AMVA Techniques for High Service Time Variability.

Such a minimalist approach is probably the single most important technical reason for the Internet's growth from a small research network into a global, commercial infras­ tructure with heterogeneous technologies, applications, and administrative authorities.

The extreme case where the mesh is chosen to be the Complete Virtual Graph incurs all the overhead of rout­ ing with none of its benefits as the resulting shortest path spanning trees degenerates to naive unicast transmission.

Even for group sizes of 128 members, the 90 percentile RDP is less Figure 16 shows the overlay spanning tree that Narada pro­ duced, which was used to route data from the source (CMUl) to other recipients, for a typical experiment.