This paper presents an approximate analysis of the maximum throughput of an HDLC-based data link protocol for a bridged network. To model an end-to-end data link connection, which is connected across multiple transmission lines and bridge processors, a specific server, denoted as a bottleneck server
Queuing network modeling for performance analysis of hdlc based protocols
โ Scribed by Takashi Ikegawa
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 694 KB
- Volume
- 76
- Category
- Article
- ISSN
- 8756-6621
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper presents a BCMP-type closed queuing network which models the error recovery defined as HDLC based protocols such as LAPB, LAPD, and LLC type 11. Throughput and average end-toend delay against the I-frame loss probability owing to bit errors are obtained by using the queuing network. With the I-frame length independence assumption, agreement between analytical and simulation results is shown to be fairly li!ood.
๐ SIMILAR VOLUMES
In this paper we analyze the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of loca
Nowadays, backplane bus-based multiprocessor systems often utilize the standard network protocol such as TCP/IP for communication between processors on the backplane bus. In such systems, it is common for the backplane bus to emulate the standard MAC protocols such as CSMA/CD. This paper aims to ana
Rapid advances of the handheld devices and the emergence of the demanding wireless applications require the cellular networks to support the demanding user needs more effectively. The cellular networks are expected to provide these services under a limited bandwidth. Efficient management of the wire