نتایج جستجو برای: controllable queue

تعداد نتایج: 27141  

In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...

2002
Chen-Khong Tham Yuming Jiang

11 Differentiated services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and 12 flexible design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this 13 paper, we extend the average delay analysis of the probabilistic priority (PP) scheduling discipline first proposed in 14 [Proc. 2001 IEEE Worksho...

Journal: :Computer Networks 2002
Chen-Khong Tham Qi Yao Yuming Jiang

Differentiated services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this paper, we extend the average delay analysis of the probabilistic priority (PP) scheduling discipline first proposed in [Proc. 2001 IEEE Workshop on High Pe...

2011
Thomas Meyer Christian Tschudin

Classical queueing disciplines are work conserving: From the allocated channel’s perspective this makes sense as the full bandwidth is exploited by sending packets back-to-back. But formally and traffic engineering wise, the resulting network dynamics is difficult to handle. In this report, we show that deviating from this fundamental queuing assumption leads to much more controllable and analy...

Journal: :Wireless Communications and Mobile Computing 2015
Hatem Abou-zeid Hossam S. Hassanein Stefan Valentin Mohamed Fathy Feteiha

In current cellular networks, schedulers allocate wireless channel resources to users based on instantaneous channel gains and short-term moving averages of user rates and queue lengths. By using only such short-term information, schedulers ignore the users’ service history in previous cells and, thus, cannot guarantee long-term Quality of Service (QoS) when users traverse multiple cells with v...

Journal: :Operations Research 1994
Michael H. Veatch Lawrence M. Wein

A manufacturing facility consisting of two stations in tandem operates in a maketo-stock mode: after production, items are placed in a finished goods inventory that services an exogenous demand. Demand that cannot be met from inventory is backordered. Each station is modelled as a queue with controllable production rate, and the problem is to control these rates to minimize inventory holding an...

2000
Richard Carter Ludmila Cherkasova

A Web server’s listen queue capacity is often set to a large value to accommodate bursts of traffic and to accept as many client requests as possible. We show that, under certain overload conditions, this results in a significant loss of server performance due to the processing of so-called “dead requests”: timed-out client requests whose associated connection has been closed from the client si...

2015
Roman Talyansky Ewnetu Bayuh Lakew Cristian Klein Francisco Hernandez-Rodriguez Erik Elmroth Eliezer Levy

Cloud storage is increasingly adopted by users due to simplified storage systems compared to on-premise storage. These systems are mostly presented as Object Storage Systems (OSSs), hiding issues, such as redundancy, from users. As new industries are considering adopting clouds for storage, OSSs have to evolve to support new needs. Among the most challenging is assuring guaranteed performance. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید