Results 1 - 10 of 456

The Packet Filter: An Efficient Mechanism for User-level Network Code

by Jeffrey C. Mogul, Richard F. Rashid, Michael J. Accetta - IN PROCEEDINGS OF THE ELEVENTH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , 1987
"... Code to implement network protocols can be either inside the kernel of an operating system or in user-level processes. Kernel-resident code is hard to develop, debug, and maintain, but user-level implementations typically incur significant overhead and perform poorly. The performance of user-level ..."
Abstract - Cited by 222 (7 self) - Add to MetaCart
network code depends on the mechanism used to demultiplex received packets. Demultiplexing in a user-level process increases the rate of context switches and system calls, resulting in poor performance. Demultiplexing in the kernel eliminates unnecessary overhead. This paper describes the packet filter

Network Coding for Large Scale Content Distribution

by Christos Gkantsidis, Pablo Rodriguez Rodriguez
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract - Cited by 493 (7 self) - Add to MetaCart
of the original file) and, also, to schemes in which only the source is allowed to generate and transmit encoded packets. We study the performance of network coding in heterogeneous networks with dynamic node arrival and departure patterns, clustered topologies, and when incentive mechanisms to discourage free

Proof-Carrying Code

by George C. Necula , 1997
"... This paper describes proof-carrying code (PCC), a mechanism by which a host system can determine with certainty that it is safe to execute a program supplied (possibly in binary form) by an untrusted source. For this to be possible, the untrusted code producer must supply with the code a safety proo ..."
Abstract - Cited by 1240 (27 self) - Add to MetaCart
briefly discuss how we use proof-carrying code to develop network packet filters that are faster than similar filters developed using other techniques and are formally guaranteed to be safe with respect to a given operating system safety policy.

Tempest and Typhoon: User-level Shared Memory

by Steven K. Reinhardt, James R. Larus, David A. Wood - In Proceedings of the 21st Annual International Symposium on Computer Architecture , 1994
"... Future parallel computers must efficiently execute not only hand-coded applications but also programs written in high-level, parallel programming languages. Today’s machines limit these programs to a single communication paradigm, either message-passing or shared-memory, which results in uneven perf ..."
Abstract - Cited by 309 (27 self) - Add to MetaCart
-programmable, user-level processor in the network interface. We demonstrate the utility of Tempest with two examples. First, the Stache protocol uses Tempest’s finegrain access control mechanisms to manage part of a processor’s local memory as a large, fully-associative cache for remote data. We simulated Typhoon

Maté: A Tiny Virtual Machine for Sensor Networks

by Philip Levis, David Culler , 2002
"... Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopu-late. ..."
Abstract - Cited by 510 (21 self) - Add to MetaCart
for sensor networks. Mat~'s high-level in-terface allows complex programs to be very short (under 100 bytes), reducing the energy cost of transmitting new programs. Code is broken up into small capsules of 24 instructions, which can self-replicate through the network. Packet sending and reception

Safe Kernel Extensions Without Run-Time Checking

by George C. Necula, Peter Lee - Proc. of OSDI'96
"... Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a safety policy and makes it public. Then, using this policy, an application can provide binaries i ..."
Abstract - Cited by 429 (20 self) - Add to MetaCart
. If the validation succeeds, the code is guaranteed to respect the safety policy without relying on run-time checks. The main practical difficulty of PCC is in generating the safety proofs. In order to gain some preliminary experience with this, we have written several network packet filters in hand-tuned DEC Alpha

Efficient Implementation of High-Level Languages on User-Level Communication Architectures

by Wilson C. Hsieh, Kirk L. Johnson, M. Frans Kaashoek, Deborah A. Wallach, William E. Weihl - Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '95 , 1994
"... User-level communication architectures --- parallel architectures that give user code direct but protected access to the network --- provide communication performance that is an order of magnitude higher than previous-generation message-passing architectures. Unfortunately, in order to take advantag ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
User-level communication architectures --- parallel architectures that give user code direct but protected access to the network --- provide communication performance that is an order of magnitude higher than previous-generation message-passing architectures. Unfortunately, in order to take

Network Coding for Efficient Communication in Extreme Networks

by Jörg Widmer , 2005
"... Some forms of ad-hoc networks need to operate in extremely performance-challenged environments where end-to-end connectivity is rare. Such environments can be found for example in very sparse mobile networks where nodes ”meet ” only occasionally and are able to exchange information, or in wireless s ..."
Abstract - Cited by 128 (3 self) - Add to MetaCart
algorithms, making it a suitable building block for a delay-tolerant network architecture. Our forwarding scheme is based on network coding. Nodes do not simply forward packets they overhear but may send out information that is coded over the contents of several packets they received. We show by simulation

Efficient Packet Demultiplexing for Multiple Endpoints and Large Messages

by Masanobu Yuhara, Brian N. Bershad, Chris Maeda, J. Eliot B. Moss - IN PROCEEDINGS OF THE 1994 WINTER USENIX CONFERENCE , 1994
"... This paper describes a new packet filter mechanism that efficiently dispatches incoming network packets to one of multiple endpoints, for example address spaces. Earlier packet filter systems iteratively applied each installed filter against every incoming packet, resulting in high processing overhe ..."
Abstract - Cited by 114 (8 self) - Add to MetaCart
This paper describes a new packet filter mechanism that efficiently dispatches incoming network packets to one of multiple endpoints, for example address spaces. Earlier packet filter systems iteratively applied each installed filter against every incoming packet, resulting in high processing

Reducing Waiting Costs in User-Level Communication

by Stefanos Damianakis Yuqun, Stefanos N. Damianakis, Yuqun Chen, Edward W. Felten - In 11th International Parallel Processing Symposium , 1997
"... This paper describes a mechanism for reducing the cost of waiting for messages in architectures that allow user-level communication libraries. We reduce waiting costs in two ways: by reducing the cost of servicing interrupts, and by carefully controlling when the system uses interrupts and when it u ..."
Abstract - Add to MetaCart
This paper describes a mechanism for reducing the cost of waiting for messages in architectures that allow user-level communication libraries. We reduce waiting costs in two ways: by reducing the cost of servicing interrupts, and by carefully controlling when the system uses interrupts and when
Results 1 - 10 of 456