Results 1 - 10
of
702
Integrated services in the internet architecture: an overview (RFC
, 1633
"... This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This memo discusses a proposed extension to the Internet architecture and protocols to provide integrated services, i.e., to support real-ti ..."
Abstract
-
Cited by 737 (24 self)
- Add to MetaCart
This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This memo discusses a proposed extension to the Internet architecture and protocols to provide integrated services, i.e., to support real-time as well as the current non-real-time service of IP. This extension is necessary to meet the growing need for real-time service for a variety of new applications, including teleconferencing, remote seminars, telescience, and distributed simulation. This memo represents the direct product of recent work by Dave Clark,
Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks
- Proceedings of the IEEE
, 1995
"... While today’s computer networks support only best-effort service, future packet-switching integrated-services networks will have to support real-time communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, ..."
Abstract
-
Cited by 609 (4 self)
- Add to MetaCart
(Show Context)
While today’s computer networks support only best-effort service, future packet-switching integrated-services networks will have to support real-time communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, and loss rate. An important issue in providing guaranteed performance service is the choice of the packet service discipline at switching nodes. In this paper, we survey several service disciplines that are proposed in the literature to provide per-connection end-to-end peqormance guarantees in packet-switching networks. We describe their mechanisms, their similarities and differences, and the performance guarantees they can provide. Various issues and tradeoffs in designing service disciplines for guaranteed performance service are discussed, and a general framework for studying and comparing these disciplines are presented. I.
Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism
, 1992
"... This paper considers the support of real-time applications in an ..."
Abstract
-
Cited by 573 (26 self)
- Add to MetaCart
(Show Context)
This paper considers the support of real-time applications in an
Fundamental Design Issues for the Future Internet
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1995
"... The Internet has been a startling and dramatic success. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the technical foundations of the Internet. In this paper we address some of the fundamental architectural d ..."
Abstract
-
Cited by 471 (3 self)
- Add to MetaCart
The Internet has been a startling and dramatic success. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the technical foundations of the Internet. In this paper we address some of the fundamental architectural design issues facing the future Internet. In particular, we discuss whether the Internet should adopt a new service model, how this service model should be invoked, and whether this service model should include admission control. These architectural issues are discussed in a nonrigorous manner, through the use of a utility function formulation and some simple models. While we do advocate some design choices over others, the main purpose here is to provide a framework for discussing the various architectural alternatives.
A Control-Theoretic Approach to Flow Control
, 1991
"... This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a ne ..."
Abstract
-
Cited by 454 (8 self)
- Add to MetaCart
(Show Context)
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a network of such switches. These models motivate the Packet-Pair rate probing technique, and a provably stable rate-based flow control scheme. A Kalman state estimator is derived from discrete-time state space analysis, but there are difficulties in using the estimator in practice. These difficulties are overcome by a novel estimation scheme based on fuzzy logic. We then present a technique to extract and use additional information horn the system to develop a continuous-time system model. This is used to design a wuisnt of the control law that is also provably stable, and, in addition, takes control action as rapidly as possible. Finally, practical issues such as correcting parameter drift and cmmlination with window flow control are described.
Hierarchical Packet Fair Queueing Algorithms
- IEEE/ACM Transactions on Networking
, 1997
"... In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H-GPS ..."
Abstract
-
Cited by 341 (7 self)
- Add to MetaCart
In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H-GPS by using one-level variable-rate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variable-rate servers. We develop techniques to analyze delay and fairness properties of variable-rate and hierarchical PFQ servers. We demonstrate that in order to provide tight delay bounds with an H-PFQ server, it is essential for the one-level PFQ servers to have small Worst-case Fair Indices (WFI). We propose a new PFQ algorithm called WF 2 Q+ that is the first to have all the following three properties: (a) providing the tightest...
A measurement-based admission control algorithm for integrated services packet networks
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... 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 control mainly focused on algorithms that compute the ..."
Abstract
-
Cited by 338 (9 self)
- Add to MetaCart
(Show Context)
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 control mainly focused on algorithms that compute the worst case theoretical queueing delay to guarantee an absolute delay bound for all packets. In this paper we describe a measurement-based admission control algorithm for predictive service, which allows occasional delay violations. We have tested our algorithm through simulations on a wide variety of network topologies and driven with various source models, including some that exhibit long-range dependence, both in themselves and in their aggregation. Our simulation results suggest that, at least for the scenarios studied here, the measurement-based approach combined with the relaxed service commitment of predictive service enables us to achieve a high
Providing Guaranteed Services Without Per Flow Management
"... Existing approaches for providing guaranteed services require routers to manage per flow states and perform per ow operations [9, 21]. Such a stateful network architecture is less scalable and robust than stateless network architectures like the original IP and the recently proposed Diffserv [3]. Ho ..."
Abstract
-
Cited by 303 (4 self)
- Add to MetaCart
Existing approaches for providing guaranteed services require routers to manage per flow states and perform per ow operations [9, 21]. Such a stateful network architecture is less scalable and robust than stateless network architectures like the original IP and the recently proposed Diffserv [3]. However, services provided with current stateless solutions, Diffserv included, have lower exibility, utilization, and/or assurance level as compared to the services that can be provided with per flow mechanisms. In this paper, we propose techniques that do not require per flow management (either control or data planes) at core routers, but can implement guaranteed services with levels of exibility, utilization, and assurance similar to those that can be provided with per flow mechanisms. In this way we can simultaneously achieve high quality of service, high scalability and robustness. The key technique we use is called Dynamic Packet State (DPS), which provides a lightweight and robust mechanism for routers to coordinate actions and implement distributed algorithms. We present an implementation of the proposed algorithms that has minimum incompatibility with IPv4.
Internet QoS: A Big Picture
, 1999
"... In this article we present a framework for the emerging Internet quality of service (QoS). All the important components of this framework --- integrated services, RSVP, differentiated services, multiprotocol label switching (MPLS), and constraintbased routing --- are covered. We describe what integr ..."
Abstract
-
Cited by 290 (2 self)
- Add to MetaCart
(Show Context)
In this article we present a framework for the emerging Internet quality of service (QoS). All the important components of this framework --- integrated services, RSVP, differentiated services, multiprotocol label switching (MPLS), and constraintbased routing --- are covered. We describe what integrated services and differentiated services are, how they can be implemented, and the problems they have. We then describe why MPLS and constraint-based routing have been introduced into this framework, how they differ from and relate to each other, and where they fit into the differentiated services architecture. Two likely service architectures are presented, and the end-to-end service deliveries in these two architectures are illustrated. We also compare ATM networks to router networks with differentiated services and MPLS. Putting all these together, we give the readers a grasp of the big picture of the emerging Internet QoS. 12 IEEE Network . March/April 1999 9 and differenti...
Client Requirements For Real-Time Communication Services
- IEEE Communications Magazine
, 1990
"... A real-time communication service provides its clients with the ability to specify their performance requirements and to obtain guarantees about the satisfaction of those requirements. In this paper, we propose a set of performance specifications that seem appropriate for such services; they include ..."
Abstract
-
Cited by 246 (13 self)
- Add to MetaCart
(Show Context)
A real-time communication service provides its clients with the ability to specify their performance requirements and to obtain guarantees about the satisfaction of those requirements. In this paper, we propose a set of performance specifications that seem appropriate for such services; they include various types of delay bounds, throughput bounds, and reliability bounds. We also describe other requirements and desirable properties from a client's viewpoint, and the ways in which each requirement is to be translated to make it suitable for lower levels in the protocol hierarchy. Finally, we present some examples of requirements specification, and discuss some of the possible objections to our approach. ############### This research has been supported in part by AT&T Bell Laboratories, the University of California under a MICRO grant, and the International Computer Science Institute. The views and conclusions in this document are those of the author and should not be interpreted as rep...
