No abstract available.
A measurement-based admission control algorithm for integrated services packet networks
Many designs for integrated service networks offer a bounded delay packet delivery service to support real-time applications. To provide bounded delay service, networks must use admission control to regulate their load. Previous work on admission ...
Two issues in reservation establishment
This paper addresses two issues related to resource reservation establishment in packet switched networks offering real-time services. The first issue arises out of the natural tension between the local nature of reservations (i.e., they control the ...
Design, implementation, and evaluation of a software-based real-time Ethernet protocol
Distributed multimedia applications require performance guarantees from the underlying network subsystem. Ethernet has been the dominant local area network architecture in the last decade, and we believe that it will remain popular because of its cost-...
Pipelined memory shared buffer for VLSI switches
Switch chips are building blocks for computer and communication systems. Switches need internal buffering, because of output contention; shared buffering is known to perform better than multiple input queues or buffers, and the VLSI implementation of ...
aItPm: a strategy for integrating IP with ATM
This paper describes research on new methods and architectures that enable the synergistic combination of IP and ATM technologies. We have designed a highly scalable gigabit IP router based on an ATM core and a set of tightly coupled general-purpose ...
Hierarchical distance-vector multicast routing for the MBone
The exponential growth of the Multicast Back-bone (MBone) has resulted in increased routing overhead and processing costs. In this paper we propose a two-level hierarchical routing model as a solution to this problem. This approach involves partitioning ...
Performance of checksums and CRCs over real data
Checksum and CRC algorithms have historically been studied under the assumption that the data fed to the algorithms was entirely random. This paper examines the behavior of checksums and CRCs over real data from various UNIX® file systems. We show ...
Performance analysis of MD5
MD5 is an authentication algorithm proposed as the required implementation of the authentication option in IPv6. This paper presents an analysis of the speed at which MD5 can be implemented in software and hardware, and discusses whether its use ...
Software support for outboard buffering and checksumming
Data copying and checksumming are the most expensive operations when doing high-bandwidth network IO over a high-speed network. Under some conditions, outboard buffering and checksumming can eliminate accesses to the data, thus making communication less ...
Self-similarity through high-variability: statistical analysis of ethernet LAN traffic at the source level
A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is self-similar or long-range dependent in nature (i.e., bursty over a wide range of time ...
Modeling and simulation of self-similar variable bit rate compressed video: a unified approach
Variable bit rate (VBR) compressed video is expected to become one of the major loading factors in high-speed packet networks such as ATM-based B-ISDN. However, recent measurements based on long empirical traces (complete movies) revealed that VBR video ...
Performance bounds in communication networks with variable-rate links
In most network models for quality of service support, the communication links interconnecting the switches and gateways are assumed to have fixed bandwidth and zero error rate. This assumption of steadiness, especially in a heterogeneous internet-...
A system for constructing configurable high-level protocols
New distributed computing applications are driving the development of more specialized protocols, as well as demanding greater control over the communication substrate. Here, a network subsystem that supports modular, fine-grained construction of high-...
Protocol implementation using integrated layer processing
Integrated Layer Processing (ILP) is an implementation concept which "permit[s] the implementor the option of performing all the [data] manipulation steps in one or two integrated processing loops" [1]. To estimate the achievable benefits of ILP a file ...
Trading packet headers for packet processing
In high speed networks, packet processing is relatively expensive while bandwidth is cheap. Thus it pays to add information to packet headers to make packet processing easier. While this is an old idea, we describe several specific new mechanisms based ...
An automatic trace analysis tool generator for Estelle specifications
This paper describes the development of Tango, an automatic generator of backtracking trace analysis tools for single-process specifications written in the formal description language, Estelle. A tool generated by Tango automatically checks the validity ...
Evaluation of TCP Vegas: emulation and experiment
This paper explores the claims that TCP Vegas [2] both uses network bandwidth more efficiently and achieves higher network throughput than TCP Reno [6]. It explores how link bandwidth, network buffer capacity, TCP receiver acknowledgment algorithm, and ...
Experiences implementing a high performance TCP in user-space
The advantages of user-space protocols are well-known, but implementations often exhibit poor performance. This paper describes a user-space TCP implementation that outperforms a 'normal' kernel TCP and that achieves 80% of the performance of a 'single-...
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
Leave-in-Time is a new rate-based service discipline for packet-switching nodes in a connection-oriented data network. Leave-in-Time provides sessions with upper bounds on end-to-end delay, delay jitter, buffer space requirements, and an upper bound on ...
RCBR: a simple and efficient service for multiple time-scale traffic
Compressed video traffic is expected to be a significant component of the traffic mix in integrated services networks. This traffic is hard to manage, since it has strict delay and loss requirements, but at the same time, exhibits burstiness at multiple ...
Efficient fair queueing using deficit round robin
Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work ...
A mobile user location update and paging mechanism under delay constraints
A mobile user location management mechanism is introduced that incorporates a distance based location update scheme and a paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and ...
Authentication protocols for personal communication systems
Masquerading and eavesdropping are major threats to the security of wireless communications. To provide proper protection for the communication of the wireless link, contents of the communication should be enciphered and mutual authentication should be ...
Floor acquisition multiple access (FAMA) for packet-radio networks
A family of medium access control protocols for single-channel packet radio networks is specified and analyzed. These protocols are based on a new channel access discipline called floor acquisition multiple access (FAMA), which consists of both carrier ...
The conference control channel protocol (CCCP): a scalable base for building conference control applications
This paper presents the Conference Control Channel Protocol (CCCP), a new scheme intended for controlling conferences ranging from small, tightly coupled meetings, to extremely large loosely coupled seminars. We describe the requirements of such a ...
Locating nearby copies of replicated Internet servers
In this paper we consider the problem of choosing among a collection of replicated servers, focusing on the question of how to make choices that segregate client/server traffic according to network topology. We explore the cost and effectiveness of a ...
The case for persistent-connection HTTP
The success of the World-Wide Web is largely due to the simplicity, hence ease of implementation, of the Hypertext Transfer Protocol (HTTP). HTTP, however, makes inefficient use of network and server resources, and adds unnecessary latencies, by ...
Sharing the “cost” of multicast trees: an axiomatic analysis
Given the need to provide users with reasonable feedback about the "costs" their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the allocation of cost among users will play an important role in future ...
Log-based receiver-reliable multicast for distributed interactive simulation
Reliable multicast communication is important in large-scale distributed applications. For example, reliable multicast is used to transmit terrain and environmental updates in distributed simulations. To date, proposed protocols have not supported these ...
A reliable multicast framework for light-weight sessions and application level framing
This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very ...
Index Terms
- Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
SIGCOMM '16 | 231 | 39 | 17% |
SIGCOMM '15 | 242 | 40 | 17% |
SIGCOMM '14 | 242 | 45 | 19% |
SIGCOMM '13 | 246 | 38 | 15% |
SIGCOMM '11 | 223 | 32 | 14% |
SIGCOMM '03 | 319 | 34 | 11% |
SIGCOMM '02 | 300 | 25 | 8% |
SIGCOMM '01 | 252 | 23 | 9% |
SIGCOMM '00 | 238 | 26 | 11% |
SIGCOMM '99 | 190 | 24 | 13% |
SIGCOMM '98 | 247 | 26 | 11% |
SIGCOMM '97 | 213 | 24 | 11% |
SIGCOMM '96 | 162 | 27 | 17% |
SIGCOMM '95 | 143 | 30 | 21% |
SIGCOMM '94 | 141 | 29 | 21% |
Overall | 3,389 | 462 | 14% |