Results 1 - 10 of 2,180

Scalable Application Layer Multicast

by Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy , 2002
"... We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data deliv ..."
Abstract - Cited by 731 (21 self) - Add to MetaCart
We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data

A Digital Fountain Approach to Reliable Distribution of Bulk Data

by Michael Luby, et al. , 1998
"... The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain a ..."
Abstract - Cited by 492 (19 self) - Add to MetaCart
The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain

RSVP: A New Resource Reservation Protocol

by Lixia Zhang, Stephen Deering, Deborah Estrin, Scott Shenker, et al. , 1993
"... Whe origin of the RSVP protocol can be traced back to 1991, when a team of network researchers, including myself, started playing with a number of packet scheduling algorithms on the DARTNET (DARPA Testbed NETwork), a network testbed made of open source, workstation-based routers. Because scheduling ..."
Abstract - Cited by 1005 (25 self) - Add to MetaCart
that could support both unicast and many-to-many multicast applications. That effort led to the birth of RSVP. As a signaling protocol designed specifically to run over IP, RSVP distinguishes itself from previous signaling protocols in several fundamental ways. The most profound ones include a soft

An algebraic approach to network coding

by Ralf Koetter, Muriel Médard - IEEE/ACM TRANSACTIONS ON NETWORKING , 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract - Cited by 858 (88 self) - Add to MetaCart
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary

WAVE: A New Multicast Routing Algorithm for Static and

by Dynamic Multicast Groups, Ernst Biersack Jrg Nonnenmacher - Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video , 1995
"... We present a new multicast algorithm called WAVE for establishing source-specific multicast trees. WAVE meets multiple quality of service requirements (constraints) such as delay, cost, and available bandwidth, simultaneously. Simulation results show that WAVE performs very good in terms of delay ..."
Abstract - Add to MetaCart
We present a new multicast algorithm called WAVE for establishing source-specific multicast trees. WAVE meets multiple quality of service requirements (constraints) such as delay, cost, and available bandwidth, simultaneously. Simulation results show that WAVE performs very good in terms

XORs in the air: practical wireless network coding

by Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft - In Proc. ACM SIGCOMM , 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract - Cited by 548 (20 self) - Add to MetaCart
This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our

Towards an Active Network Architecture

by David L. Tennenhouse, David J. Wetherall - Computer Communication Review , 1996
"... Active networks allow their users to inject customized programs into the nodes of the network. An extreme case, in which we are most interested, replaces packets with "capsules" -- program fragments that are executed at each network router/switch they traverse. Active architectures permit ..."
Abstract - Cited by 497 (7 self) - Add to MetaCart
a massive increase in the sophistication of the computation that is performed within the network. They will enable new applications, especially those based on application-specific multicast, information fusion, and other services that leverage network-based computation and storage. Furthermore

Network information flow

by Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung - IEEE TRANS. INFORM. THEORY , 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract - Cited by 1967 (24 self) - Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information

MNet – a new multicast approach for the future Internet

by Jorge Sá Silva, Sérgio Duarte, Edmundo Monteiro, O Boavida - In Proceedings of the 10th Intern. Conference on Telecommunications , 2003
"... Abstract – Multicast communication in the Internet has deserved an increasing attention in the last few years. Nowadays, there are more and more applications that require communication systems with multipoint communication capabilities. Multicast communication reduces both the time it takes to send ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Internet Service. This paper presents a new multicast proposal that is being developed at Laboratory of Communication and Telematics of the Informatics Engineering Department of the University of Coimbra. The approach explores the use of Multicast Servers in conjunction with the SSM protocol, addressing

WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups

by Ernst Biersack, Jörg Nonnenmacher, Ernst Biersack Jrg Nonnenmacher - Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video , 1995
"... We present a new multicast algorithm called WAVE for establishing source-specific multicast trees. WAVE meets multiple quality of service requirements (constraints) such as delay, cost, and available bandwidth, simultaneously. Simulation results show that WAVE performs very good in terms of delay ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
We present a new multicast algorithm called WAVE for establishing source-specific multicast trees. WAVE meets multiple quality of service requirements (constraints) such as delay, cost, and available bandwidth, simultaneously. Simulation results show that WAVE performs very good in terms
Results 1 - 10 of 2,180