http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
오늘 본 자료
Power tail asymptotic results of a discrete time queue with long range dependent input
황강욱,Khosrow Sohraby 대한수학회 2003 대한수학회지 Vol.40 No.1
In this paper, we consider a discrete time queueing systemfed by a superposition of an ON and OFF source with heavy tail ON periods andgeometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process).We study the tail behavior of the queue length distribution andboth infinite and finite buffer systems are considered. In the infinitebuffer case, we show that the asymptotic tail behavior of the queue length of thesystem is equivalent to that of the same queueing system with the D-BMAP being replaced bya batch renewal process.In the finite buffer case (of buffer size K), we deriveupper and lower bounds of the asymptoticbehavior of the loss probability as K rightarrow infty.
Flow-Aware Link Dimensioning for Guaranteed-QoS Services in Broadband Convergence Networks
Lee, Hoon,Sohraby, Khosrow The Korea Institute of Information and Commucation 2006 Journal of communications and networks Vol.8 No.4
In this work, we propose an analytic framework for dimensioning the link capacity of broadband access networks which provide universal broadband access services to a diverse kind of customers such as patient and impatient customers. The proposed framework takes into account the flow-level quality of service (QoS) of a connection as well as the packet-level QoS, via which a simple and systematic provisioning and operation of the network are provided. To that purpose, we first discuss the necessity of flow-aware network dimensioning by reviewing the networking technologies of the current and future access network. Next, we propose an analytic model for dimensioning the link capacity for an access node of broadband convergence networks which takes into account both the flow and packet level QoS requirements. By carrying out extensive numerical experiment for the proposed model assuming typical parameters that represent real network environment, the validity of the proposed method is assessed.
POWER TAIL ASYMPTOTIC RESULTS OF A DISCRETE TIME QUEUE WITH LONG RANGE DEPENDENT INPUT
Hwang, Gang-Uk,Sohraby, Khosrow Korean Mathematical Society 2003 대한수학회지 Vol.40 No.1
In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail behavior of the queue length of the system is equivalent to that of the same queueing system with the D-BMAP being replaced by a batch renewal process. In the finite buffer case (of buffer size K), we derive upper and lower bounds of the asymptotic behavior of the loss probability as $K\;\longrightarrow\;\infty$.