• Title/Summary/Keyword: Queueing Delay

Search Result 169, Processing Time 0.022 seconds

Access delay and packet delay of EDCA in IEEE 802.11e wireless network (IEEE 802.11e EDCA 무선랜의 매체 접속 지연 시간 및 정상 상태에서의 패킷 지연 분석)

  • Lee, Yu-Tae;Jang, Jong-Min;Lee, Key-Sang;Kim, Dong-Il;Kim, Chang-Kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1420-1426
    • /
    • 2008
  • This paper derives medium access delay of each AC(Access Category) in a stationary station using inter-departure time of IEEE 802.11e WLAN(Wireless LAN). Inter-departure time of IEEE 802.11e WLAN is obtained using saturation throughput of IEEE 802.11e WLAN which was the topic of our prior work. By using a simple queueing model, we evaluate mean queue length and mean delay for each AC on stationary condition. We calculate performance of each AC using this simple model and validate results using simulation.

A Task Scheduling Strategy in Cloud Computing with Service Differentiation

  • Xue, Yuanzheng;Jin, Shunfu;Wang, Xiushuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5269-5286
    • /
    • 2018
  • Task scheduling is one of the key issues in improving system performance and optimizing resource management in cloud computing environment. In order to provide appropriate services for heterogeneous users, we propose a novel task scheduling strategy with service differentiation, in which the delay sensitive tasks are assigned to the rapid cloud with high-speed processing, whereas the fault sensitive tasks are assigned to the reliable cloud with service restoration. Considering that a user can receive service from either local SaaS (Software as a Service) servers or public IaaS (Infrastructure as a Service) cloud, we establish a hybrid queueing network based system model. With the assumption of Poisson arriving process, we analyze the system model in steady state. Moreover, we derive the performance measures in terms of average response time of the delay sensitive tasks and utilization of VMs (Virtual Machines) in reliable cloud. We provide experimental results to validate the proposed strategy and the system model. Furthermore, we investigate the Nash equilibrium behavior and the social optimization behavior of the delay sensitive tasks. Finally, we carry out an improved intelligent searching algorithm to obtain the optimal arrival rate of total tasks and present a pricing policy for the delay sensitive tasks.

Multi-hop Transmission Scheme for Delay-Sensitive Information in Wireless Sensor Networks (무선 센서 네트워크에서 지연에 민감한 정보의 다중 홉 전송 기법)

  • Cha, Jae-Ryong;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.876-884
    • /
    • 2012
  • This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE PRIORITY CLASSES

  • Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.1 no.1
    • /
    • pp.55-74
    • /
    • 1994
  • We consider an M/G/1 queueing system with multiple priority classes of jobs. Considered preemptive rules are the preemptive-resume preemptive-repeat-identical, and preemptive-repeat-different policies. These three preemptive rules will be analyzed in parallel. The key idea of analysis is based on the consideration of a busy period as composite of delay cycle. As results we present the exact Laplace-Stieltjecs(L.S) transforms of residence time and completion time in the system.

Performance Analysis of Dynamic TDMA and Fixed TDMA in Tactical Data Link (전술데이터링크의 동적 TDMA와 정적 TDMA 성능 분석)

  • Lee, Jong-Kwan
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.4
    • /
    • pp.489-496
    • /
    • 2018
  • In this paper, a performance comparison of dynamic TDMA and fixed TDMA in tactical data link system is conducted. The performance metric include: delay, queue size and system throughput. To perform comparison of two TDMA schemes, we adopt the modified M/D/1 queueing model. Computer simulation is also performed to verify conducted analytical results.

Approximation to GPH Distributions and Its Application

  • Baek, Jang-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.3
    • /
    • pp.687-705
    • /
    • 2006
  • In this paper we consider GPH distribution that is defined as a distribution for sum of random number of random variables following exponential distribution. We establish approximation process of general distributions to GPH distributions and offer numerical results for various cases to show the accuracy of the approximation. We also propose analysis method of delay distribution of queueing systems using approximation to GPH distributions and offer numerical results for various queueing systems to show applicability of GPH approximation.

  • PDF

A Call Admission Control Scheme to Guarantee a Required Delay in the Wireless Mesh Networks (무선메쉬네트워크에서 지연 성능 보장을 위한 호 접속 제어 방안)

  • Jeong, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1174-1185
    • /
    • 2012
  • This paper proposes a call admission control scheme for delay guarantee in the wireless mesh networks. The admission of a new call is determined based on the expected delay inferred from the class level available bandwidth at nodes on the path. All nodes under the effects of the new call are considered in designing the call admission control scheme to maintain the delay guarantee of the pre-existing traffic. An effective technique for estimating the available bandwidth of the neighbor nodes is proposed with no addition of message interchanges. The class-level delay control is mainly performed by the queueing discipline while keeping the MAC operation simple. Simulations are performed to show the validity of the proposals. We observe acceptable performances in delay expectation with the addition of new calls. We also show that the proposed call admission control is helpful in guaranteeing the delay performances.

Study on the dynamic bandwidth allocation over Ethernet Passive Optical Network (이더넷 수동형 광가입자망에서의 동적 대역폭 할당에 관한 연구)

  • Joo, Jung-Min;Byun, Hee-Jung;Nam, Gi-Wook;Lim, Jong-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.663-665
    • /
    • 2004
  • Ethernet-based passive optical network(EPON) technology is being considered as a promising solution for next-generation broadband access network. It must have the property of high efficiency, low cost, and support quality of service(QoS). A major feature for this new architecture is the use of a shared transmission media between all connected optical network unit(ONU). Hence, medium access control(MAC) arbitration mechanisms are essential for the successful implementation of EPON. In this paper we propose a simple dynamic bandwidth allocation(DBA) algorithm that improves the performance of network and supports IP-based multimedia applications with the bursty data traffic. In addition, we introduce analytic models of proposed algorithms and prove the system based on our algorithm to be asymptotically stable. Simulation results show the new DBA algorithm provides high bandwidth efficiency and low queueing delay of ONU in EPON.

  • PDF

Design of High-speed Pointer Switching Fabric (초고속 포인터 스위칭 패브릭의 설계)

  • Ryu, Kyoung-Sook;Choe, Byeong-Seog
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.161-170
    • /
    • 2007
  • The proposed switch which has separated data plane and switching plane can make parallel processing for packet data storing, memory address pointer switching and simultaneously can be capable of switching the variable length for IP packets. The proposed architecture does not require the complicated arbitration algorithms in VOQ, also is designed for QoS of generic output queue switch as well as input queue. At the result of simulations, the proposed architecture has less average packet delay than the one of the memory-sharing based architecture and guarantees keeping a certain average packet delay in increasing switch size.

  • PDF

Performance Analysis of Dual-Plane Nonblocking Switches under Burst Traffic (버스트 트래픽 환경에서의 이중 평면 패킷 스위치의 성능 분석)

  • 이현태;손장우
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.05a
    • /
    • pp.142-145
    • /
    • 1999
  • In this paper, delay performances are evaluated and compared for three dual-plane switch architectures; dual input queue/dual switching plane (DQDP The terms of DQDP, DQDP-PS and DQDP-GQ were not used in [Turner88], [Lee96] and [Son97]. All these tern are designated in this letter for convenience.) switch, DQDP with plane selector (DQDP-PS) switch and DQDP based on output group queueing (DQDP-OGQ) switch. We show that under random traffic these switches give almost identical delay performances to that of the output queueing switch but under bursty traffic only the DQDP-PS and the DQDP-OGQ switches ran do.

  • PDF