QTNA

Considering the memoryless property of user initiated packet arrivals in wireless broadband metropolitan networks, we present a sleep-delay scheme for the conventional power saving class type III in the IEEE 802.16e. In this paper, a discrete-time ...

A content-delivering service within a large-scaled company in Taiwan has been proposed to use 40 servers to meet user requirements on the previous study. The managers of the case company want to use resources as few as possible. From previous study [19--...

Energy saving is an important issue in wireless sensor networks for majority of sensor nodes equipped with non-rechargeable batteries. For increasing the lifetime of sensor networks, each node must conserve energy as much as possible. To prolong the ...

In wireless networks, guard channel based Call Admission Control (CAC) schemes are widely used to protect handoff calls for seamless wireless services. However, the introduction of the guard channels in wireless networks results in the increase in the ...

Traditional Internet telephony systems heavily rely upon central servers, especially during call initiations. The absence of these servers in Peer-to-Peer (P2P) implementations results in a significant increase in delay during the user search process. ...

We consider a production system that can be modeled by a two-station tandem queues. Products requested by demands have to go through station 1 then station 2 for processing; however, in order to reduce the response time, we may stock some semi-finished ...

Software testing is one of the most important lifecycle step. In spite of multiple existing test approaches, no test process guarantees a total absence of errors; so planning a fault tolerance mechanism becomes a necessity. Our work, in this context, is ...

We consider a two dimensional reflected random walk on the nonnegative integer quadrant. This random walk is assumed to be skip free in the direction to the boundary, and referred to as a double M/G/1-type process. We are interested in tail asymptotic ...

We consider a queueing model with c (≥ 2) heterogeneous servers, where each server has its own queue with infinite capacity. Customers arrive according to a Markovian arrival process and join the shortest queue. Service times at each server are assumed ...

We formulate and analyze a model for the resequencing buffer of the Selective Repeat protocol over a general class of transmission channels. Thanks to its efficiency, Selective Repeat is a ubiquitous error control mechanism in many different settings, ...

The extended real time polling service(ErtPS) algorithm is added to IEEE 802.16e-2005 standards for VoIP service to use uplink resources efficiently by considering on/off characteristic of voice source. The IEEE 802.16e standard employs adaptive ...

As modeling for the behavior of each satellite node in a hub network with central node, we consider an M/G/1 queue with preemption of urgent jobs, in which the inter-arrival time of urgent jobs or the arrival rate are easily controllable by setting the ...

This paper studies an M/M/1 queue with working vacations and possible additional non-zero switching times in order to model a cyclic service system in WDM-based access networks with reconfiguration delay. Different from the assumption that the server ...

We consider an M/M/m retrial queue and investigate the tail asymptotics for the joint distribution of the number of customers in the orbit and the number of busy servers in the steady state. In addition, we illustrate the tail asymptotic behavior ...

In this paper, we investigate mean sojourn times in multiclass queues with feedback and their application to packet scheduling in communication networks.

We first analyze the feedback queues with J groups of customers and a single server. The server ...

This paper studies a single-server non-preemptive priority queue with two traffic classes in order to model Expedited Forwarding Per-Hop Behaviour in the Differentiated Services (DiffServ) architecture. Generally, queueing models assume infinite queue ...

This paper considers a state-dependent M/M/c/c + r retrial queue with Bernoulli abandonment, where the number of servers is equal to c, the capacity of the buffer is equal to r and that of the virtual waiting room for retrial customers is infinite. We ...

Providing a photonic alternative to the current electronic switching in the backbone, optical packet switching (OPS) and optical burst switching (OBS) require optical buffering. Optical buffering exploits delays in long optical fibres; an optical buffer ...

The paper deals with the continuous-time BMAP/G/1 queue with multiple vacations and with its application to IEEE 802.16e sleep mode. The lengths of the vacation periods have general distribution and they depend on the number of preceding vacations (...

In this paper, we study a two-server Markovian network system with balking and a Bernoulli schedule under a single vacation policy where servers have different service rates. After every service, only one server may take a vacation or continue to stay ...

Recently, there has been much progress in understanding the connection between optimization and control of queueing networks. In this talk, we will focus on two applications to wireless networks. One application is to a network whose traffic consists of ...

With the advent of mobile computing and Internet convergence, more and more new mobile services become feasible and popular. Among them is context-aware services. In this talk we shall present context computing as a key technology enabling context-aware ...