Voice packetization and compression in broadband ATM networks

Sriram, Kotikalapudi; McKinney, Randy; Sherif, Mostafa Hashem

doi:10.1109/49.76627

Cited by 69 publications

(23 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea is to reduce packet (cell) transmission time in case of congestion, while maintaining satisfactory quality of service. Kotikalapudi Sriram et al (1991) [6] have developed the bit dropping method as a congestion control in Broadband network. They utilized simulation studies for analyzing the performance of the network.…”

Section: Load Dependent Dynamic Allocation Of Bandwidth For Wireless mentioning

confidence: 99%

“…This algorithm converges to a socially optimal bandwidth allocation. Iftekhar Hussain et al (2015) [5] proposed a QoS aware dynamic bandwidth allocation sheme to mitigate congestion problem in gateway based multi hop WiFi based long distance networks and thereby enhance QoS guarantees for real time traffic, Amulya Sakhamuru, Varun Manchikalaudi (2015) [6] presented fair share algorithm in which bandwidth is fairly distributed in order to avoid the packet losses in terms of data transfer in the channel dynamic allocation. Efficiency affected by some factors like throughput, packet transmission and latency.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Bandwidth Management for Wireless Ad hoc Networks for Two Zones under Homogeneous Conditions

Yadav¹,

Rao²,

Varma³

2017

IJCA

View full text Add to dashboard Cite

Wireless communication networks, in particular ad hoc networks have revolutionized the field of Networking with increasing number of commercial and military applications. Establishing communication through portable devices without the dependence on or constraints of any central infrastructural id possible through ad hoc networks. Wireless ad hoc networks models play a predominant role in performance evaluation of many communication systems. In this paper a two zones (single hop) wireless ad hoc network model with homogeneous Poisson arrivals of packets having dynamic bandwidth allocation is introduced for performance evaluation and monitoring of several commercial applications and military applications. The system performance measures of the wireless ad hoc networks are derived explicitly.

show abstract

Section: Load Dependent Dynamic Allocation Of Bandwidth For Wireless mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Dynamic Bandwidth Management for Wireless Ad hoc Networks for Two Zones under Homogeneous Conditions

Yadav¹,

Rao²,

Varma³

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…For both D / G /1 and M / G /1 queue, once the a n 's are computed, the response-time distribution F u (t) can be obtained from (12). We remark that by use of recursion in (19), F u (t) as expressed in terms of Laguerre functions in (12) is easy to compute for any given argument.…”

Section: Response Time and Probability Of Grades Of Servicementioning

confidence: 99%

“…The models are motivated by the bit dropping methods (e.g., [12]) as a congestion control in broadband networks. The idea there is to reduce packet (cell) transmission time in case of congestion, while maintaining satisfactory quality of service.…”

Section: Introductionmentioning

confidence: 99%

“…Let these models be referred to as the D / G /1 and M / G /1 queue in the following. These models are motivated by bit dropping methods (e.g., [6], [11], [12]) used as a congestion control for continuousbit-rate (CBR) traffic in broadband networks. For CBR services such as packetized voice, voice samples of a conversation are taken periodically and transmitted over the communication channel.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Load-dependent service queues with application to congestion control in broadband networks

Leung

2002

Performance Evaluation

View full text Add to dashboard Cite

Abstract:We analyze D / G /1 and M / G /1 queues where the service time for an arrival depends on the amount of work in the system upon arrival. The models are motivated by the bit dropping methods (e.g., [12]) as a congestion control in broadband networks. The idea there is to reduce packet (cell) transmission time in case of congestion, while maintaining satisfactory quality of service.To study the load-dependent-service queues, we first derive a functional equation that characterizes the response time for an arbitrary arrival. Then, we employ and extend a technique based on Laguerre functions in [8] to solve the equation. A new recursion is developed in this paper, which significantly simplifies and enhances the applicability of the technique, and makes it easy to program on computers. Numerical examples for packetized voice in a broadband network are included. The enhanced technique is also applicable to other communication and computer systems that can be characterized by similar functional equations.

show abstract