English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

proposing a concrete CAC algorithm that is optimal This work focuses on connection admission control given a certain priority scheme. Hardly any paper (CAC) 2 of a single buffer with a two-type (high discusses the trade-off between the gain in performand low) priority management. 3 The quantity of ance and the increase in complexity by introducing interest for CAC is the maximum allowable load a priority scheme. Open issues in CAC providing a that a system can bear while still offering the certain QOS are discussed in a broader scope by requested quality of services (QOS). The QOS meaKurose, however, omitting the priority problem. sure considered here is the cell loss ratio. SpecifiThe latter topic is given a closer look in this paper. cally, subject to the required cell loss ratios for both Among cell loss priority management (CLPM) priorities, clrL and clrH, we determine the maximum methods 8, , the push-out buffer (POB) and the allowable traffic intensityrmax as a function of the partial buffer sharing (PBS) 21 are most well-known. priority mix a and the buffer sizeK, where a Although these priority schemes have been studied denotes the probability that an arriving cell has in the literature, the optimality of a priority scheme high priority. for various queue sizes and cell loss ratio requireThe literature abounds in suggestions to tackle the ments has not been discussed in detail. In a POB, CAC problem in asynchrous transfer mode (ATM) the push-out mechanism acts only if the buffer is switches. A smaller number of articles concentrates completely filled and a high priority cell arrives. If on a priority management. Most among those discuss there are low priority cells in the buffer, the arriving a particular priority scheme and then proceed to high priority cell pushes the low priority cell nearevaluate the performance of the priority algorithm est to the server out, all cells behind the pushedin a single buffer 3–13 or in a shared buffer, 14–18 for out low priority cell ripple through over one position which we further refer to our work. 19 Generally one towards the server, and the arriving high priority finds that the introduction of priorities enhances the cell takes place at the tail of the queue in order to number of customers that can be served adequately preserve cell sequence integrity. A PBS mechanism at the expense of an increased complexity of the is somewhat simpler: if the buffer occupancy is control algorithm. However, relatively few (e.g. below a thresholdT, both low and high priority

Performance of cell loss priority management schemes in a single server queue