• 한국정보통신학회논문지
• /
• 제12권8호
• /
• pp.1420-1426
• /
• 2008

본 논문은 IEEE 802.11e 무선랜 환경에서 단말 수에 따른 각 AC(Access Category)별 포화 상태의 시스템 처리율과 관련한 기존 결과에 기반을 두어, IEEE 802.11e 무선랜 네트워크에서의 패킷 전송시간 간격을 통해, 각 AC별 매체 접속 지연 시간을 유도한다. 이 매체 접속 지연 시간을 서비스시간으로 갖는 대기행렬모형을 이용하여, 정상 상태에서의 각 AC별 대 기열의 길이와 패킷 지연 시간을 유도한다. 또한, 수치 해석과 모의 실험을 통하여 모형의 정확성을 검증하고 각 AC별 성능을 분석한다.

• 한국통신학회논문지
• /
• 제32권3A호
• /
• pp.261-270
• /
• 2007

실시간과 비실시간 서비스 클래스의 각 QoS요구 사항을 만족하면서 전체 시스템 용량을 최대화하기 위하여 DTPQ스케줄링 알고리즘이 제안된 바 있다. 기존 DTPQ방식은 개별 서비스 클래스의 QoS를 만족하면서 전체 시스템의 평균 수율을 극대화하기 위해 실시간 서비스의 HOL 패킷의 지연 시간이 정해진 임계값을 넘는 경우에만 서비스하는 접근으로서, 이를 구현하기 위해서는 주어진 환경에서 적절한 지연 임계값을 설정할 수 있어야 한다. 본 논문에서는 실시간 사용자의 채널 상태와 지연 시간에 따라 지연 임계값을 적응적으로 적용하는 A-DTPQ 기반의 스케줄링 기법을 제안한다. 이는 기존의 DTPQ알고리즘과 달리 트래픽 부하 및 채널 특성 등에 따라 지연 임계값을 적응적으로 결정하는 방식이다. 시스템 레벨 시뮬레이션을 통해 제안 방식의 고정된 최적 임계값을 가지는 DTPQ방식보다 성능이 향상시킬 수 있음을 확인하였으며, 향후 연구에서는 다양한 서비스 클래스에 대해 이와 같은 개념을 일반화할 수 있을 것이다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제7권1호
• /
• pp.15-23
• /
• 2003

ATM networks provide the various kinds of service which require the different Quality of Services(QoS) such as loss and delay. By statistically multiplexing of traffics and the uncertainty and fluctuation of source traffic pattern, the congestion may occur. The leaky bucket scheme is a representative policing mechanism for preventive congestion control. In this paper, we analyze the HOL(Head-of-Line) priority leaky bucket scheme. That is, traffics are classified into real-time and nonreal-time traffic. The real-time traffic has priority over nonreal-time traffic for transmission. For proposed mechanism, we obtain the system state distribution, finally the loss probability and the mean waiting time of real-time and nonreal-time traffic. The simple numerical examples also are presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• 한국통신학회논문지
• /
• 제19권6호
• /
• pp.1158-1168
• /
• 1994

본 논문은 선로 장애에 대한 분산 제어 자체 치유 알고리즘을 제안한 것으로 복구시간을 향상시키는데 중점을 두었다. 복구를 위해 망에서 교환되는 제어 메시지의 개수를 작게 하고, 이웃 노드들에게 더 이상 복구에 사용된 예비채널이 없음을 이리 알리는 ASC_NULL(Available Spare Channel_NULL) 신호를 만들어 복구 경로 설정 과정에서 낭비되는 시간 지연을 줄임으로써 빠른 복구 시간을 얻을 수 있었다. 다른 여러 자체 치유 알고리즘들과의 객관적인 비교는 여러 조건들의 차이로 어려우므로 NETRATS(NETwork Restoration Algorithm for Telecommunication Systems)와의 비교만을 시뮬레이션 하였다. 시뮬레이션의 결과에서 제안된 알고리즘이 NETRATS보다 향상된 복구 시간을 가진다는 것을 알 수 있었다.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1998년도 학술발표대회 논문집 제17권 1호
• /
• pp.351.1-355
• /
• 1998

Network-based real-time multimedia applications require guaranteed performances of communication service. Also according to increased bandwidth and processing performance in the future high speed networks, it is possible to make multimedia real-time applications such as distributed real-time applications including video conference, medical imaging, and video education. These applications have characteristics of stringent performance requirements in terms of delay, delay jitter and maximum loss rate. This paper proposes a new delay control for Broadband networks with FCFS queueing. The delay control provides an alternative solution to a current problem in real-time communication; traffic distortion, which makes it difficult to meet such real-time requirements. In simulations, it shows that the proposed delay control can guarantee local and end-to-end delay.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.469-481
• /
• 2004

In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

• 대한산업공학회지
• /
• 제40권1호
• /
• pp.135-139
• /
• 2014

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

• 산업경영시스템학회지
• /
• 제46권2호
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• 한국경영과학회지
• /
• 제19권3호
• /
• pp.1-14
• /
• 1994

In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.