Thumbnail
Access Restriction
Subscribed

Author Osogami, Takayuki ♦ Raymond, Rudy
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Semidefinite programming ♦ G/g/1 queue ♦ Bounds ♦ Duality ♦ Moments ♦ Occupation measure ♦ Transient
Abstract We derive an upper bound on the tail distribution of the transient waiting time for the GI/GI/1 queue from a formulation of semidefinite programming (SDP). Our upper bounds are expressed in closed forms using the first two moments of the service time and the interarrival time. The upper bounds on the tail distributions are integrated to obtain the upper bounds on the corresponding expectations. We also extend the formulation of the SDP, using the higher moments of the service time and the interarrival time, and calculate upper bounds and lower bounds numerically.
Description Affiliation: IBM Research - Tokyo, Yamato-shi, Japan (Osogami, Takayuki; Raymond, Rudy)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2014-01-10
Publisher Place New York
Journal ACM SIGMETRICS Performance Evaluation Review (PERV)
Volume Number 38
Issue Number 1
Page Count 2
Starting Page 363
Ending Page 364


Open content in new tab

   Open content in new tab
Source: ACM Digital Library