Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleOctober 1997
Scheduling of multicast traffic in tunable-receiver WDM networks with non-negligible tuning latencies
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 301–310https://doi.org/10.1145/263105.263182We consider the problem of supporting multipoint communication at the media access control (MAC) layer of broadcast-and-select WDM networks. We first show that bandwidth consumption and channel utilization arise as two conflicting objectives in the ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Iolus: a framework for scalable secure multicasting
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 277–288https://doi.org/10.1145/263105.263179As multicast applications are deployed for mainstream use, the need to secure multicast communications will become critical. Multicast, however, does not fit the point-to-point model of most network security protocols which were designed with unicast ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 249–262https://doi.org/10.1145/263105.263175In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed real-time services with decoupled delay (priority) and bandwidth allocation. We extend the service curve based QoS model, which ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
A framework for robust measurement-based admission control
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 237–248https://doi.org/10.1145/263105.263173Measurement-based Admission Control (MBAC) is an attractive mechanism to concurrently offer Quality of Service (QoS) to users, without requiring a-priori traffic specification and on-line policing. However, several aspects of such a system need to be ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
A flow-based approach to datagram security
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 221–234https://doi.org/10.1145/263105.263170Datagram services provide a simple, flexible, robust, and scalable communication abstraction; their usefulness has been well demonstrated by the success of IP, UDP, and RPC. Yet, the overwhelming majority of network security protocols that have been ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Consistent overhead byte stuffing
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 209–220https://doi.org/10.1145/263105.263168Byte stuffing is a process that transforms a sequence of data bytes that may contain 'illegal' or 'reserved' values into a potentially longer sequence that contains no occurrences of those values. The extra length is referred to in this paper as the ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
End-to-end Internet packet dynamics
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 139–152https://doi.org/10.1145/263105.263155We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyte transfer at both the sender and the receiver, the measurements allow us ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Dynamics of random early detection
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 127–137https://doi.org/10.1145/263105.263154In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as non-adaptive, fragile and robust, according to their responses to congestion. We point out that RED allows unfair bandwidth sharing when a ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Internet routing instability
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 115–126https://doi.org/10.1145/263105.263151This paper examines the network inter-domain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Active bridging
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 101–111https://doi.org/10.1145/263105.263149Active networks accelerate network evolution by permitting the network infrastructure to be programmable, on a per-user, per-packet, or other basis. This programmability must be balanced against the safety and security needs inherent in shared ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 89–100https://doi.org/10.1145/263105.263144We investigate a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications. We discuss the data fragmentation technique, the broadcasting strategy, and the client design. We also show the correctness of our ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Fast restoration of real-time communication service from component failures in multi-hop networks
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 77–88https://doi.org/10.1145/263105.263143For many applications it is important to provide communication services with guaranteed timeliness and fault-tolerance at an acceptable level of overhead. In this paper, we present a scheme for restoring real-time channels, each with guaranteed ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Fair scheduling in wireless packet networks
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 63–74https://doi.org/10.1145/263105.263141Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling algorithms because of two unique characteristics of wireless media: (a) bursty channel errors, ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Trace-based mobile network emulation
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 51–61https://doi.org/10.1145/263105.263140Subjecting a mobile computing system to wireless network conditions that are realistic yet reproducible is a challenging problem. In this paper, we describe a technique called trace modulation that re-creates the observed end-to-end characteristics of a ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Solutions to hidden terminal problems in wireless networks
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 39–49https://doi.org/10.1145/263105.263137The floor acquisition multiple access (FAMA) discipline is analyzed in networks with hidden terminals. According to FAMA, control of the channel (the floor) is assigned to at most one station in the network at any given time, and this station is ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
Scalable high speed IP routing lookups
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 25–36https://doi.org/10.1145/263105.263136Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup requires computing the best matching prefix, for which ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4 - ArticleOctober 1997
A simulation study of IP switching
SIGCOMM '97: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communicationPages 15–24https://doi.org/10.1145/263105.263135Recently there has been much interest in combining the speed of layer-2 switching with the features of layer-3 routing. This has been prompted by numerous proposals, including: IP Switching [1], Tag Switching [2], ARIS [3], CSR [4], and IP over ATM [5]. ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 27 Issue 4