Semaphore queues: modeling multilayered window flow control mechanisms

Fdida, Serge; Perros, Harry G.; Wilk, Andrzej

doi:10.1109/26.48888

Cited by 29 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of these studies assume infinite buffering. Last, FJQN/Bs have been used to model problems in error control [Bhargava et al 1988;Caseau and Pujolle 1979] and flow control [Fdida et al 1990] There may be some servers for which there are no incoming edges. Each such server is referred to as a source, and it is assumed that there are an infinite number of jobs available to the source so that it is never starved.…”

Section: Symmetry Propertiwmentioning

confidence: 99%

Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking

Dallery

Liu

Towsley

1994

J. ACM

View full text Add to dashboard Cite

In this paper, we study quantitative as well as qualitative properties of Fork-Join Queuing Networks with Blocking (FJQN/Bs). Specifically, we prove results regarding the equivalence of the behavior of a FJQN/B and that of its duals and a strongly connected marked graph. In addition, we obtain general conditions that must be satisfied by the service times to guarantee the existence of a long-term throughput and its independence on the initial configuration. We also establish conditions under which the reverse of a FJQN/B has the same throughput as the original network. By combining the equivalence result for duals and the reversibility result, we establish a symmetry property for the throughput of a FJQN/B. Last, we establish that the throughput is a concave function of the buffer sizes and the initial marking, provided that the service times are mutually independent random variables belonging to the class of PERT distributions that includes the Erlang distributions. This last result coupled with the symmetry property can be used to identify the initial configuration that maximizes the long-term throughput in closed series-parallel networks.

show abstract

Section: Symmetry Propertiwmentioning

confidence: 99%

Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking

Dallery

Liu

Towsley

1994

J. ACM

View full text Add to dashboard Cite

show abstract

“…In order to represent the window flow control in a simple manner, we make use of the tollowing two symbols 1111111'-' 1111111111-+ join split (We note that these symbols are similar to those used in Fdida, Perras. and Wilk [19]). The join symbol depicts the following operation: when both queues contain a customer each.…”

Section: A Model For Nested Layers Of Slidingmentioning

confidence: 97%

Nested sliding window protocols with packet fragmentation

Shapiro

Perros²

1993

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

A single-hop OSI structured network with multiple layers of sliding window flow control and packet fragmentation between layers is analyzed. An approximation algorithm is presented to hierarchically reduce the network to a single queue whose performance characteristics represent the original network. Network transmission characteristics are restricted to Erlang distributions. Validation against exact and simulation results showed that the approximation algorithm has a satisfactory error level.

show abstract

“…For this reason, it is necessary to model the HDLC-type protocol error recovery, namely, REJ detection, and check pointing detection for I-frame loss and go-back-n retransmission. Queing network models of HDLC error recovery are discussed in [19] and [20]. The authors of [19] and [20] chose a model that does not use go-back-n retransmission and has one-way I-frame loss detection.…”

Section: Introductionmentioning

confidence: 99%

Queuing network modeling for performance analysis of hdlc based protocols

Igarashi

1993

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

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. acknowledgement time and consequently the throughput characteristics of a wide window size are not examined. These performance evaluation methods are not sufficient to evaluating the performance of communications networks such as LAN and satellite networks that are multiaccess and contain many virtual circuits.The queuing network in which a constant number of customers cycle through such as the closed-type queuing network and the finite population queuing network is an analysis model which sufficiently expresses the characteristics of window control. Depending on the queuing network used, the performance analysis of multiaccess communication networks is possible [ 16-18]. There are many classes of window control analysis [ 19, 201 and the performance analysis of networks with many virtual circuits [15, 17, 211 is possible.Each of these performance analysis methods has certain advantages. This paper proposes another method of performance analysis for the HDLC-type protocols.

show abstract

Semaphore queues: modeling multilayered window flow control mechanisms

Cited by 29 publications

References 18 publications

Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking

Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking

Nested sliding window protocols with packet fragmentation

Queuing network modeling for performance analysis of hdlc based protocols

Contact Info

Product

Resources

About