intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Queueing delay

Xem 1-12 trên 12 kết quả Queueing delay
  • Nutrition and health counselling (NHC) was usually conducted in hospital settings with groups of mothers. Barriers to counselling were long queues and delays, long distances and high travel costs, the inapplicability of the counselling content, lack of spousal support, and a high domestic workload.

    pdf14p vishanshan 27-06-2024 1 1   Download

  • In this paper, we propose a distributed traffic-balancing routing protocol for large-scale wireless sensor networks to distribute traffic from sources to sinks effectively by utilizing the number of hops and the current queue size at one- and two-hop next neighbors to make routing decisions.

    pdf7p vidoctorstrange 06-05-2023 2 2   Download

  • Chapter 8 - Timeliness: Scheduling and project management. After reading the material in this chapter, you should be able to: Explain the effect time has on each profitability measure, describe the impact of feedback delay on quality, explain the common time reduction strategies, construct a Gantt chart, Sequence orders using the traditional sequencing rules, describe the physical features of queues and describe how they affect queue performance,...

    ppt66p lovebychance05 30-05-2021 21 1   Download

  • In order to more contribution to the next-generation network, these routing protocols should be more flexible, saving energy, and performance achievable. In this paper, we propose a multi-metric on-demand routing protocol based on three parameters: queue length, route quality, and hops number to improve the MANET performance. Base on the working conditions of the network system. One or more routing metrics will be integrated into the cost function. Besides, we also performance evaluation of the MM-AODV compared with traditional routing protocols such as AODV and DSR.

    pdf6p chauchaungayxua11 23-03-2021 16 2   Download

  • In a cognitive radio network (CRN), a preempted secondary user (SU) is placed in a call level queue to wait for accessing another free channel. If the availability of channels is transparent to SUs, packets will be generated during their waiting time and the performance of the CRN will be influenced by which way to handle these packets. In this paper, the call level queue is departed into two parts, delay queue and discard queue.

    pdf9p vivalletta2711 11-01-2020 15 1   Download

  • It is important in data communication settings to be able to characterise the delay that individual packets are subjected to in their sojourn through the system. Delays can be traced to four main causes: Processing delay, propagation delay, transmission delay, queueing delay.

    pdf75p kexauxi4 01-10-2019 18 1   Download

  • The following will be discussed in this chapter: Delay in packet networks, introduction to queueing theory, review of probability theory, the poisson process, little’s theorem, proof and intuitive explanation.

    pdf37p kexauxi4 01-10-2019 26 2   Download

  • This paper considers a discrete-time bulk-service queue with infinite buffer space and delay multiple working vacations. Considering a late arrival system with delayed access (LAS-AD), it is assumed that the inter-arrival times, service times, vacation times are all geometrically distributed.

    pdf17p vinguyentuongdanh 19-12-2018 17 2   Download

  • But an RTGS structure may incentivise free-riding. A bank may find it convenient to delay its outgoing payments (placing it in an internal queue) and wait for incoming funds, in order to avoid the burden of acquiring expensive liquidity in the first place. As banks fail to ‘internalise’ the systemic benefits of acquiring liquidity, RTGS systems may suffer from inefficient liquidity underprovision. Inefficiencies may also emerge for a second reason.

    pdf20p machuavo 19-01-2013 44 3   Download

  • Such central queues are called ‘liquidity-saving mechanisms’ (LSMs). There are a number of studies on plain RTGS systems, but only a few on RTGS systems augmented with LSMs. Our work contributes to this line of research. We first model a benchmark system, ie a plain RTGS system where each bank decides: (i) the amount of liquidity to use; (ii) which payments to delay in an internal queue (payments are made as banks randomly receive payment orders, which need be executed with different ‘urgency’).

    pdf28p machuavo 19-01-2013 57 3   Download

  • THE QUEUEING BEHAVIOUR OF PACKETS IN AN IP ROUTER BUFFER In Chapters 7 and 8, we investigated the basic queueing behaviour found in ATM output buffers. This queueing arises because multiple streams of cells are being multiplexed together; hence the need for (relatively short) buffers. We developed balance equations for the state of the system at the end of any time slot, from which we derived cell loss and delay results.

    pdf24p huggoo 20-08-2010 93 8   Download

  • COMBINING THE BURST AND CELL SCALES The finite-capacity buffer is a fundamental element of ATM where cells multiplexed from a number of different input streams are temporarily stored awaiting onward transmission. The flow of cells from the different inputs, the number of inputs, and the rate at which cells are served determine the occupancy of the buffer and hence the cell delay and cell loss experienced. So, how large should this finite buffer be? In Chapters 8 and 9 we have seen that there are two elements of queueing behaviour: the cell-scale and burst-scale components. ...

    pdf18p huggoo 20-08-2010 76 7   Download

CHỦ ĐỀ BẠN MUỐN TÌM

ADSENSE

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2