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

We consider a single-server retrial queue with a Poisson arrival process and exponential service times, where the server is unreliable. Assume there is no waiting space in front of the server and the customer who finds the server unavailable joins an orbit to access the server some time later. We discuss two types of customers' retrial behavior. One is that each customer in the orbit seeks for services independently and the total retrial rate of the system depends on the number of customers in the orbit. The other type of retrial discipline is called constant retrial policy and it arises from some situations in the computer and communication network where the retrial rate may be controlled by automatic mechanisms. An announced price charged by the server is imposed on customers joining the system and the actual demands for services depend on the price via a decreasing function. We investigate the system characteristics and study how the manager, whose goal is to maximize its own profit, determines the price charging joining customers. Finally, we present an application example to illustrate the obtained results and make comparisons between the two retrial policies from the perspective of customers' expected waiting time.

Optimal Pricing Analysis of Computer Networks Based on a Queueing System With Retrial Mechanism