• 한국경영과학회지
• /
• 제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.

• 한국정보통신학회논문지
• /
• 제7권6호
• /
• pp.1168-1176
• /
• 2003

인터넷 전화 서비스는 저렴한 가격과 타 서비스와 통합 및 가치부가면에서 기존의 전화에 비해 많은 장점을 가지고 있으나, 상대적으로 낮은 음질로 인하여 사용자의 요구를 만족시키지 못하고 있다. 이것은 인터넷이 best-effort형 패킷 전달 서비스만을 제공하고 있기 때문에 지연, 패킷 손실 및 지터 등을 보장할 수 없기 때문이다. 본 논문에서는 인터넷 전화에서 전송지연으로 인한 패킷손실을 감소시키기 위해 수신 패킷을 사람이 인지 가능한 수준까지 확장하여 playout 시킬 수 있는 FEAPT 알고리즘을 제시한다.

• 한국멀티미디어학회논문지
• /
• 제20권7호
• /
• pp.1030-1037
• /
• 2017

Traffic flows of real-time multimedia services such as Internet phone and IPTV are bounded on the end-to-end delay. Packets violating their delay limits will be dropped at a router because of not useful anymore. Service providers promise the quality of their providing services in terms of SLA(Service Level Agreement), and they, especially, have to guarantee the packet loss rates listed in the SLA. This paper is about a method to guarantee the required packet loss rate of each traffic flow keeping the high network resource utilization as well. In details, it assures the required loss rate by adjusting adaptively the timestamps of packets of the flow according to the difference between the required and measured loss rates in the lossy Weighted Fair Queuing(WFQ) scheduler. The proposed method is expected to be highly applicable because of assuring the packet loss rates regardless of the fluctuations of offered traffic load in terms of quality of services and statistical characteristics.

• Journal of Communications and Networks
• /
• 제15권6호
• /
• pp.614-634
• /
• 2013

The proliferation of real-time multimedia services requires huge amounts of data transactions demanding strict quality-of-service (QoS) guarantees. Multicast transmission is a promising technique because of its efficient network resource utilization. However, high head-of-line (HOL) blocking probability and lack of service-specific QoS control should be addressed for practical implementations of multicast networks. In this paper, a topology aware fanout set division (TAFD) scheme is proposed to resolve these problems. The proposed scheme is composed of two techniques that reduce HOL blocking probability and expedite packet delivery for large-delay branches regarding multicast tree topology. Since management of global topology information is not necessary, scalability of the proposed scheme is guaranteed. Mathematical analysis investigates effects of the proposed scheme and derives optimal operational parameters. The evaluation results show that the TAFD scheme achieves significant delay reduction and satisfies required delay bounds on various multicast networks.

• 한국철도학회논문집
• /
• 제20권1호
• /
• pp.156-163
• /
• 2017

대도시 고밀도 도시철도에서는 상습 열차운행 지연과 혼잡으로 승객의 불편과 불만이 커지고 있다. 도시철도는 열차운행의 비정규성과 수요의 불확정성 등 지역간 철도와는 다른 특성을 가지고 있다. 도시철도 운영회사에서는 실적자료를 기반으로 열차운행품질과 혼잡도와 같은 서비스품질을 집계하여 관리하고 있다. 그러나 수요와 승객행태에 따라 열차운행이 동적으로 변하는 특성을 가지고 있어 실제 느끼는 서비스품질을 표현하기에는 한계가 있다. 본 논문에서는 승객 관점에서의 서비스품질을 계량화하고, 도시철도에서 수요에 따른 정차시분 및 열차운행상태의 동적변화를 예측할 수 있는 시뮬레이션 방법과 지연/혼잡 해소방안에 대한 실제 사례를 기반으로 운행서비스품질의 변화를 예측할 수 있는 방법론을 제시한다.

• Journal of Communications and Networks
• /
• 제10권3호
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• 한국통신학회논문지
• /
• 제34권5A호
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.225-227
• /
• 2004

A sensor networkis composed of a large number of sensor nodes, which are densely deployed either inside the phenomenon or very close to it. One of the most important constraints on sensor nodes is the low power consumption requirement. Sensor nodes carry limited, generally irreplaceable, power sources. Therefore, while traditional networks aim to achieve high quality of service (QoS) provisions, sensor network protocols must focus primarily on power conservation. This paper presents the characteristics of energy consuming, average delay in 802.11 MAC, S-MAC that is specifically designed for wireless sensor networks. We analyze the energy consuming state in the 802.11 MAC in the simulation topology nodes, and measure average delay in 802.11 and S-MAC. Energy efficiency is the primary goal in this protocol design. 802.11 MAC is more efficient than S-MAC in the average delay, throughput. However S-MAC is an energy efficient protocol, a tradeoff between energy efficiency and delay.

• ETRI Journal
• /
• 제28권1호
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

• 한국멀티미디어학회논문지
• /
• 제7권1호
• /
• pp.106-112
• /
• 2004

Global Internet에서 이동성을 위한 해결책으로 모바일 IP가 제시된 바 있다. 그러나 사용자가 증가하는 경우와 이동노드의 움직임이 많은 경우에는 서비스 지연이 발생하게 된다. 이러한 지연을 줄이기 위해 지역등 록을 사용한 모바일 IP가 제시되었다. 본 논문에서는 모바일 IP에서 등록지연을 최소로 하는 최적의 지역등록 관리 방법을 소개한다. 이산적 해석 모델을 통해 이동 노드의 움직임을 나타내며 제안한 방법을 통해 평균 패킷 도착률과 이동노드의 이동성을 고려한 경우의 네트워크의 크기에 따른 등록비용을 해석적으로 분석한다.