Results 1 - 10 of 3,921

The BSD Packet Filter: A New Architecture for User-level Packet Capture

by Steven Mccanne, Van Jacobson , 1992
"... Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can be m ..."
Abstract - Cited by 568 (2 self) - Add to MetaCart
Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can

The BSD Packet Filter: A New Architecture for User-level Packet Capture

by Steven Mccanney, Van Jacobsony , 1992
"... Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose work-stations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can be ..."
Abstract - Add to MetaCart
Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose work-stations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can

Abstract The BSD Packet Filter: A New Architecture for User-level Packet Capture 3

by unknown authors
"... Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can be m ..."
Abstract - Add to MetaCart
Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can

Abstract The BSD Packet Filter: A New Architecture for User-level Packet Capture

by unknown authors
"... Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can be m ..."
Abstract - Add to MetaCart
Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can

Explicit Allocation of Best-Effort Packet Delivery Service

by David D. Clark, et al. , 1998
"... This paper presents the “allocated-capacity” framework for providing different levels of best-effort service in times of network congestion. The “allocatedcapacity” framework—extensions to the Internet protocols and algorithms—can allocate bandwidth to different users in a controlled and predictable ..."
Abstract - Cited by 467 (2 self) - Add to MetaCart
This paper presents the “allocated-capacity” framework for providing different levels of best-effort service in times of network congestion. The “allocatedcapacity” framework—extensions to the Internet protocols and algorithms—can allocate bandwidth to different users in a controlled

Wide-area Internet traffic patterns and characteristics

by Kevin Thompson, Gregory J. Miller, Rick Wilder - IEEE NETWORK , 1997
"... The Internet is rapidly growing in number of users, traffic levels, and topological complexity. At the same time it is increasingly driven by economic competition. These developments render the characterization of network usage and workloads more difficult, and yet more critical. Few recent studies ..."
Abstract - Cited by 518 (0 self) - Add to MetaCart
The Internet is rapidly growing in number of users, traffic levels, and topological complexity. At the same time it is increasingly driven by economic competition. These developments render the characterization of network usage and workloads more difficult, and yet more critical. Few recent

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

A Measurement Study of Peer-to-Peer File Sharing Systems

by Stefan Saroiu , P. Krishna Gummadi, Steven D. Gribble , 2002
"... The popularity of peer-to-peer multimedia file sharing applications such as Gnutella and Napster has created a flurry of recent research activity into peer-to-peer architectures. We believe that the proper evaluation of a peer-to-peer system must take into account the characteristics of the peers th ..."
Abstract - Cited by 1254 (15 self) - Add to MetaCart
Napster and Gnutella. In particular, our measurement study seeks to precisely characterize the population of end-user hosts that participate in these two systems. This characterization includes the bottleneck bandwidths between these hosts and the Internet at large, IP-level latencies to send packets

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

User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks

by Sem Borst , 2003
"... Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algorithms has mostl ..."
Abstract - Cited by 216 (9 self) - Add to MetaCart
mostly been explored at the packet level for a static user population, often assuming infinite backlogs. In the present paper, we focus on the performance at the flow level in a dynamic setting with random finite-size service demands. We show that in certain cases the user-level performance may
Results 1 - 10 of 3,921