Flow control schemes and delay/loss tradeoff in ATM networks

Ohnishi, Hiroyuki; Okada, Takashi; Noguchi, K.

doi:10.1109/49.12888

Cited by 110 publications

(17 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a flow requests real-time service, it must characterize its traffic so that the network can make its admission control decision. Typically, sources are described by either peak and average rates [FV90] or a filter like a token bucket [OON88]; these descriptions provide upper bounds on the traffic that can be generated by the source. The traditional real-time service provides a hard or absolute bound on the delay of every packet; in [FV90], [CSZ92], this service model is called guaranteed service.…”

mentioning

confidence: 99%

A measurement-based admission control algorithm for integrated services packet networks

Jamin

Danzig

Shenker

et al. 1995

SIGCOMM Comput. Commun. Rev.

100

147

View full text Add to dashboard Cite

Abstract-Many designs for integrated services 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 longrange dependence, both in themselves and in their aggregation. Our simulation results suggest that measurement-based approach combined with the relaxed service commitment of predictive service enables us to achieve a high level of network utilization while still reliably meeting delay bound. I. BOUNDED DELAY SERVICES AND PREDICTIVE SERVICEThere have been many proposals for supporting real-time applications in packet networks by proSugih Jamin was supported in part by the Uniforum Research Award and by the Office of Naval Research Laboratory under contract N00173-94-P-1205. At USC, this research is supported by AFOSR award number F49620-93-1-0082, by the NSF small-scale infrastructure grant, award number CDA-9216321, and by equipment loan from Sun Microsystems, Inc. viding some form of bounded delay packet delivery service. When a flow requests real-time service, it must characterize its traffic so that the network can make its admission control decision. Typically, sources are described by either peak and average rates [FV90] or a filter like a token bucket [OON88]; these descriptions provide upper bounds on the traffic that can be generated by the source. The traditional real-time service provides a hard or absolute bound on the delay of every packet; in [FV90], [CSZ92], this service model is called guaranteed service. Admission control algorithms for guaranteed service use the a priori characterizations of sources to calculate the worst-case behavior of all the existing flows in addition to the incoming one. Network utilization under this model is usually acceptable when flows are smooth; when flows are bursty, however, guaranteed service inevitably results in low utilization [ZF94].Higher network utilization can be achieved by weakening the reliability of the delay bound. For instance, the probabilistic service described in [ZK94] does not provide for the worst-case scenario, instead it guarantees a bound on the rate of lost/late packets based on statistical characterization of traffic. In this approach, each flow is allotted an effective bandwidth that is larger than its average rate but less than its peak rate. In most cases the equivalent bandwidth is computed based on a statistical model [Hui88], [SS91] or on a fluid flow approximation [GAN91], [Kel91]) of traffic. 1 If one can precisely characterize traffic a prior...

show abstract

mentioning

confidence: 99%

A measurement-based admission control algorithm for integrated services packet networks

Jamin

Danzig

Shenker

et al. 1995

SIGCOMM Comput. Commun. Rev.

100

147

View full text Add to dashboard Cite

show abstract

“…In data transmission, the traffic profile of the source is usually expressed as some combination of peak and average rates, maximum burst length, token bucket filter rate, etc. [39,43]. Performance requirements, on the other hand, are usually specified in delay bounds, acceptable loss rates, etc.…”

Section: Service Specificationmentioning

confidence: 99%

“…These standards specify the different service classes and the service guarantees available to network applications. The realization of these schemes requires advances in traffic specification [39,43], resource reservation [44], resource mapping [45][46][47] and admission control [48,49], scheduling algorithms 4 [39,[51][52][53][54] and queue management [55], along with various other control and management mechanisms such as traffic policing. Pricing design for multi-service networks has also witnessed a flurry of research activity [56][57][58][59][60][61][62][63][64][65].…”

Section: Transmission-based Qosmentioning

confidence: 99%

Distributed network storage service with quality-of-service guarantees

Chuang

Sirbu

2000

Journal of Network and Computer Applications

View full text Add to dashboard Cite

This paper envisions a distributed network storage service with Quality-ofService (QoS) guarantees, and describes its architecture and key mechanisms. When fully realized, this service architecture would be able to support, in one integrated framework, network storage services ranging from best-effort caching to replication with performance guarantees. Content owners could, through the use of standardized protocols, reserve network storage resources to satisfy their application-specific performance requirements. They would be able to specify either the number and/or placement of the replicas, or higher-level performance goals based on access latency, bandwidth usage or data availability. The network storage provider would then optimally allocate storage resources to meet the service commitments, using leftover capacity for best-effort caching. Content consumers would then retrieve the nearest copy of the data object, be it from a replica, cache, or the original source, in a completely transparent manner. Furthermore, a distributed network storage infrastructure should be integrated with the existing transmission-based QoS framework so that applications can select the optimal combination of storage and transmission resources to satisfy their performance requirements.This work identifies and discusses key research areas and problems that need to be tackled, including those in service specification, resource mapping, admission control, resource reservation and real-time storage management. The paper establishes a QoS framework upon which community discussion on this vision can proceed.

show abstract

“…As with Internet, the mechanism suggested for ATM is based upon end-to-end error detection and correction at the transport layer [14,26,27]. While this mode is certainly feasible, it is highly questionable whether it is capable of enabling the wide QOS range that users have come to expect in LAN systems.…”

Section: Error Controlmentioning

confidence: 99%

“…A recent paper [12J does consider an ATM -FDDI gateway but provides only minimal user support. Second, while BISDN networks are suppose to support a wide range of services, it is not clear that all services will be provided by the interconnecting network itself as no<ed for frame relays [7] and discussions of ATM systems [14]. Third, BISDN packet and protocol header size lead to considerable bandwidth inefficiency for connecting net\vorks which do not maintain its format but must incorporate its packets [12].…”

Section: Introductionmentioning

confidence: 99%

High Performance Interconnection Between High Data Rate Networks

Foudriat

Maly

Overstreet

et al.

[1992] Proceedings International Workshop on Advanced Communications and Applications for High Speed Networks

View full text Add to dashboard Cite

A rjc tm Ct , [13] are becoming a reality. This paper investigates TJie paper discusses the bridge/gateway system needed \ syslsms required to interconnecting high data rate netto mterconnect a wide range of computer networks to ', works Spedal attcntion ^ directed toward providing support a wide range of user quality-of-service require-suppon for a wide variety of applications which are imments. Vie bridge/gateway must handle a wide range of plied by multimedia applications. message types including synchronous and asynchronous traffic, large, bursty messages, short, self-contained messages, time critical messages, etc. TJte paper shows that messages can be classified into three basic classes, synchronous and large and small asynchronous messages. TJie first two require call setup so that packet identification, buffer handling, etc. can be supported in the bridge/ gateway. Identification enalbes resequencing of messages at the bridge/gateway which supports interconnection between networks having large differences in packet size. Tlie third class is for messages which do not require call setup. Resequencing hardware is presented in the paper based to handle two types of resequencing problems. TJie first is for virtual parallel circuitwhich can scramble Present network interfacing supports service, between connectionless networks usually via bridges or gateways [L]. Tthe major interconnection problems has been routing. Gateways, such as in Internet, provide a compatible protocol at the network layer which forwards packets to toward their destination on the selected "best route" and, where necessary, breaks up the packet to conform to any lower layer packet length restrictions [1,2]. Thus, all stations must implement the same network layer protocol.To over come the problem of common network layer, especially where not needed the transparent bridge approach is used. Bridges generally implement some form of spanning tree algorithm which eventually gets the packet to its destination but some times via a "non-shortest" route channel bytes. Vie secondsystem is effective in handling ri> 2 , 3> 4]. Packet reformatting in bridges is minimal at both synchronous and asynchronous traffic between networks with highly differing packet sizes and data rates. Vie two other major needs for the bridge/gateway are congestion and error control. Vie paper presents a new dynamic, lossless congestion control scheme which can easily support effective error correction. Results indicate that the congestion control scheme provide close to optimal capacity under congested conditions. Under conditions where error may develop due to intewening networks which are not lossless, intermediate error recovery and correction takes 1/3 less time than equivalent end-co-end error correction under similar conditions.

show abstract

Flow control schemes and delay/loss tradeoff in ATM networks

Cited by 110 publications

References 2 publications

A measurement-based admission control algorithm for integrated services packet networks

A measurement-based admission control algorithm for integrated services packet networks

Distributed network storage service with quality-of-service guarantees

High Performance Interconnection Between High Data Rate Networks

Contact Info

Product

Resources

About