Research: An estimation of traffic parameters for VBR services in ATM networks

Authors:
J. Paek;C. Oh;K. Kim
Affiliations:
Department of Information and Communications, Kwang-Ju Institute of Science and Technology (K-JIST), Kwangju, South Korea;Department of Information and Communications, Kwang-Ju Institute of Science and Technology (K-JIST), Kwangju, South Korea;Department of Information and Communications, Kwang-Ju Institute of Science and Technology (K-JIST), Kwangju, South Korea
Venue:
Computer Communications
Year:
2001

Citing 7
Cited 0

Traffic descriptors for VBR video teleconferencing over ATM networks

IEEE/ACM Transactions on Networking (TON)
On characterizing an ATM source via the sustainable cell rate traffic descriptor

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Call admission control schemes: a review

IEEE Communications Magazine
Bandwidth allocation and call admission control in high-speed networks

IEEE Communications Magazine
Equivalent capacity and its application to bandwidth allocation in high-speed networks

IEEE Journal on Selected Areas in Communications
Traffic management for B-ISDN services

IEEE Network: The Magazine of Global Internetworking
B-ISDN/ATM traffic and congestion control

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

In order to guarantee a proper operation of both UPC/NPC and CAC functions in ATM networks, the intrinsic traffic characteristics of connections should first be adequately described by a set of standardized traffic parameters. The most significant traffic descriptors for the VBR service are SCR (Sustainable Cell Rate) and MBS (Maximum Burst Size). In this paper, we work on traffic parameters estimation from VBR source modeling in ATM networks. We propose a new method of traffic parameters estimation from the VBR ON/OFF source model, which satisfies the quality of service (QoS) requirements with the least cost.