• Title/Summary/Keyword: queueing delay

Search Result 169, Processing Time 0.025 seconds

A Linear System Approach to Serving Gaussian Traffic in Packet-Switching Networks (패킷 교환망에서 가우스 분포 트래픽을 서비스하는 선형 시스템 접근법)

  • Chong, Song;Shin, Min-Su;Chong, Hyun-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.553-561
    • /
    • 2002
  • We present a novel service discipline, called linear service discipline, to serve multiple QoS queues sharing a resource and analyze its properties. The linear server makes the output traffic and the queueing dynamics of individual queues as a linear function of its input traffic. In particular, if input traffic is Gaussian, the distributions of queue length and output traffic are also Gaussian with their mean and variance being a function of input mean and input power spectrum (equivalently, autocorrelation function of input). Important QoS measures including buffer overflow probability and queueing delay distribution are also expressed as a function of input mean and input power spectrum. This study explores a new direction for network-wide traffic management based on linear system theories by letting us view the queueing process at each node as a linear filter.

A Call Admission Control Using Markovian Queueing Model for Multi-services Cognitive Radio Networks (멀티 서비스 무선 인지 망을 위한 마르코프 큐잉모델을 이용한 호 수락 제어)

  • Lee, Jin-Yi
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.4
    • /
    • pp.347-352
    • /
    • 2014
  • In this paper, we propose a Markovian queueing model(M/M/1)-based call admission control to reduce forced terminating rate of non-real secondary user's call for Multi-services Cognitive Radio Networks. A existing control has a problem that the forced terminating rate increases because of adopting a policy of spectrum priority allocation to real calls. In our scheme the rate can be reduced as the call that has no useful spectrum waits in a queue until getting an available spectrum. Our scheme use a neural-net based prediction of primary user's reappearance. Through the simulation, we analysis the call forced terminating rate, access delay and spectrum utilization efficiency, and then show that our scheme can more reduce the forced terminating rate of the call, compared to that of the existing algorithm.

A Data Burst Assembly Algorithm in Optical Burst Switching Networks

  • Oh, Se-Yoon;Hong, Hyun-Ha;Kang, Min-Ho
    • ETRI Journal
    • /
    • v.24 no.4
    • /
    • pp.311-322
    • /
    • 2002
  • Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

  • PDF

Implementation of Class-Based Low Latency Fair Queueing (CBLLFQ) Packet Scheduling Algorithm for HSDPA Core Network

  • Ahmed, Sohail;Asim, Malik Muhammad;Mehmood, Nadeem Qaisar;Ali, Mubashir;Shahzaad, Babar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.473-494
    • /
    • 2020
  • To provide a guaranteed Quality of Service (QoS) to real-time traffic in High-Speed Downlink Packet Access (HSDPA) core network, we proposed an enhanced mechanism. For an enhanced QoS, a Class-Based Low Latency Fair Queueing (CBLLFQ) packet scheduling algorithm is introduced in this work. Packet classification, metering, queuing, and scheduling using differentiated services (DiffServ) environment was the points in focus. To classify different types of real-time voice and multimedia traffic, the QoS provisioning mechanisms use different DiffServ code points (DSCP).The proposed algorithm is based on traffic classes which efficiently require the guarantee of services and specified level of fairness. In CBLLFQ, a mapping criterion and an efficient queuing mechanism for voice, video and other traffic in separate queues are used. It is proved, that the algorithm enhances the throughput and fairness along with a reduction in the delay and packet loss factors for smooth and worst traffic conditions. The results calculated through simulation show that the proposed calculations meet the QoS prerequisites efficiently.

Performance study of the priority scheme in an ATM switch with input and output queues (입출력 큐를 갖는 ATM 스위치에서의 우선순위에 관한 성능 분석)

  • 이장원;최진식
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.2
    • /
    • pp.1-9
    • /
    • 1998
  • ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

  • PDF

Performance Analysis of Traffic Shaper for an MPEG Video Source (MPEG 비디오원을 대상으로 한 트래픽 쉐이퍼의 성능 분석)

  • Lee, S.C.;Lee, M.Y.;Hong, J.S.;Lie, C.H.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.1
    • /
    • pp.23-37
    • /
    • 1997
  • In this paper, performance analysis of video traffic shaper for Motion Picture Experts Group (MPEG) video traffic in on ATM network are investigated. Traffic shaping for MPEG video traffic is proposed as a traffic control function in ATM networks. The proposed shaper smoothes video traffics by controling the output rate of the buffer, which is placed in an MPEG source, according to I,B,P frame sequences of MPEG. In performance analysis of an video traffic shaper, a periodic botch arrival model is suggested to describe cell streams in a frame of MPEG video traffic. The queueing model which has periodic independent botch arrival and periodic deterministic service time is used to obtain the cell loss ratio, the mean cell delay, and the measure of smoothing effect. Simulation results are used to validate this queueing model. The cell loss performance of ATM multiplexer is measured by simulation study with real MPEG-1 data. From the viewpoint of traffic load, the cell loss ratio is observed to be considerably high, which is considered to result from the burstiness of MPEG video traffic. As a result, it is shown that the shaping decreases cell loss ratio of multiplexer. The results of this paper can be employed to establish a basic guideline in the implementation of a traffic control scheme and the design of ATM multiplexer for MPEG video traffic.

  • PDF

A Reserved Band-Based Probabilistic Cell Scheduling Algorithm for Input Buffered ATM Switches (입력 단 저장 방식 ATM 스위치의 예약 대역폭에 기반 한 셀 스케쥴링 알고리듬)

  • 이영근;김진상;김진상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.114-121
    • /
    • 2000
  • The problem of an input-buffered switch is the HOL(head-of-line) blocking which limits the maximum throughput but it is easy to implement in hardware. However, HOL blocking can be eliminated using aVOQ(virtual-output-queueing) technique. 0 this paper, we propose a new cell-scheduling algorithm for aninput-buffered ATM switch. The proposed algorithm, called PPIM(Probabilistic Parallel Iterative Matching), imposesa weight to every request based on the reserved bandwidth. It is shown that the input-buffered ATM switch withthe proposed PPIM algorithm not only provides high throughput and low delay but it also reduces the jitter,compared with the existing WPIM(Weighted PIM).

  • PDF

Developing Smart Grids Based on GPRS and ZigBee Technologies Using Queueing Modeling-Based Optimization Algorithm

  • de Castro Souza, Gustavo Batista;Vieira, Flavio Henrique Teles;Lima, Claudio Ribeiro;de Deus, Getulio Antero Junior;de Castro, Marcelo Stehling;de Araujo, Sergio Granato;Vasques, Thiago Lara
    • ETRI Journal
    • /
    • v.38 no.1
    • /
    • pp.41-51
    • /
    • 2016
  • Smart metering systems have become widespread around the world. RF mesh communication systems have contributed to the creation of smarter and more reliable power systems. This paper presents an algorithm for positioning GPRS concentrators to attain delay constraints for a ZigBee-based mesh network. The proposed algorithm determines the number and placement of concentrators using integer linear programming and a queueing model for the given mesh network. The solutions given by the proposed algorithm are validated by verifying the communication network performance through simulations.

Performance Analysis of an Integrated Voice/Data Packet Communication Network with Window Flow Control (Window Flow 제어기능을 가진 음성/데이타 패킷통신망의 성능해석)

  • 손수현;은종관
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.4
    • /
    • pp.227-236
    • /
    • 1986
  • In this paper, an integrated voice/data packet network with window flow control is modeled by a colsed multichain queueing system, and its performance is analyzed by the mean value analysis method. Particularly, for the analysis of a packet network having various kinds of messages with different priority classes, we introduce an approach based on the mean value analysis and the concept of effective capacity. By the mathematical analysis and computer simulation, we obtain the following network statistics in the steady state: Mean buffer occupancy at each node, utilization of link throughput of a virtual channel, and mean delay time of each message. Our iterative analysis method can predict the link data status in most cases within about 10 percent of accurady, and the statistics of voice messages and external data within 5 percent as compared to simulation results.

  • PDF

Analysis of the Traffic Characteristics for MAP Network Management System (MAP 네트워크 관리 시스템의 트래픽 분석)

  • 김중규;이용두;이상배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.3
    • /
    • pp.434-441
    • /
    • 1994
  • In this paper, performance of MAP management system traffic is analyzed, to realize the network management function in automated manufacturing network mini-MAP. The network management system, which controls and supervises the network resources in the communication network, is the function that is necessarily required in this network. Since the real time response must be required in the Mini-MAP network, the delay performance of the network needs to be analyzed. By means of both analytical method and simulation for cyclic queueing model, the delay time distributions due to the increasement of transmission data are obtained in the implemented management network where SLAM II package is used for simulation. In addition, the parameters of the management function affecting the transmission delay are considered so that these parameters can be used to implement network management system.

  • PDF