• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.23-36
• /
• 2001

To support real-time multicast, the existing DS network may use the EF PHB for transmission, However, because of the dynamic characteristics of the multicast flow and the features of the EF PHB. it is very difficult to make a provision of resources or to manage the network when EF multicast flows increase, Also, the existing LBE PHB can not guarantee the transmission delay bounds required for the real-time multicast traffic, In this paper. a new concept of PHB. namely, low-delay multicast PHB, that may guarantee approximately the per-hop delay is proposed, For the low-delay multicast PHB, router architectures are devised, The queue management algorithm on a low-delay multicast queue and a scheduling method are also devised. This new architecture of the LDM AF class is simple to be implemented.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.447-458
• /
• 2021

The quality of experience (QoE) of video streaming is degraded by playback interruptions, which can be mitigated by the playout buffers of end users. To analyze the impact of playout buffer dynamics on the QoE of wireless adaptive hypertext transfer protocol (HTTP) progressive video, we model the playout buffer as a G/D/1 queue with an arbitrary packet arrival rate and deterministic service time. Because all video packets within a block must be available in the playout buffer before that block is decoded, playback interruption can occur even when the playout buffer is non-empty. We analyze the queue length evolution of the playout buffer using diffusion approximation. Closed-form expressions for user-perceived video quality are derived in terms of the buffering delay, playback duration, and interruption probability for an infinite buffer size, the packet loss probability and re-buffering probability for a finite buffer size. Simulation results verify our theoretical analysis and reveal that the impact of playout buffer dynamics on QoE is content dependent, which can contribute to the design of QoE-driven wireless adaptive HTTP progressive video management.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.490-492
• /
• 2000

기존의 인터넷 라우터는 Drop tail 방식으로 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인한 혼잡 상황으로 발생하는 패킷 손실을 해결할 수 없다. 이 문제를 해결하기 위해 IETF(Internet Engineering Task Force)에서는 RED(Random Early Detection)와 같은 능동적인 큐 관리 알고리즘을 제시하였다. 하지만 RED는 동적으로 변화하는 인터넷 트래픽에 대하여 단지 큐 크기의 변화 정보를 얻어 혼잡 상황을 제어하기 때문에 성능에 있어는 매우 비효율적이다. 본 논문에서는 기존의 RED를 개선한 MRED를 제안했다. MRED는 RED에 비하여 휴리스틱한 방법을 이용하여 폐기 확률 값을 계산하고, 이를 실험을 통하여 MRED의 성능을 검증하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1533-1536
• /
• 2001

This paper considers the TMN system for management of public ATM switching network which has the four-level hierarchical structure consisting of one network management system, a few element management system and several agent-ATM switch pairs, respectively. The effects of one TMN command on the local call processing performance of the component ATM switch an analyzed using Jackson's queueing model. The TMN command considered is the permanent virtual call connection, and the performance measures of ATM switch are the utilization, mean queue length and mean waiting time for the processor interfacing the subscriber lines and trunks directly, and the call setup delay of the ATM switch.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.381-390
• /
• 2002

We analyze the performance of a telecommunications management network (TMN) system using models of networks of queues, Jackson's theorem, and simulation. TMN systems for managing public asynchronous transfer mode (ATM) networks generally have a four-level hierarchical structure consisting of a network management system, a few element management systems (EMSs), and several pairs of agents and ATM switches. We construct a Jackson's queuing network and present formulae to calculate its performance measures: distributions of queue lengths and waiting times, mean message response time, and maximum throughput. We perform a numerical analysis and a simulation analysis and compare the results.

• Korean Management Science Review
• /
• v.25 no.3
• /
• pp.87-99
• /
• 2008

Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

• Management Science and Financial Engineering
• /
• v.15 no.1
• /
• pp.33-49
• /
• 2009

We examine the effectiveness of the conventional (Q, r) model in managing production-inventory systems with finite capacity, stochastic demand, and stochastic order processing times. We show that, for systems with finite production capacity, order replenishment lead times are highly sensitive to loading and order quantity. Consequently, the choice of optimal order quantity and optimal reorder point can vary significantly from those obtained under the usual assumption of a load-independent lead time. More importantly, we show that for a given (Q, r) policy the conventional model can grossly under or over-estimate the actual cost of the policy. In cases where a setup time is associated with placing a production order, we show that the optimal (Q, r) policy derived from the conventional model can, in fact, be infeasible.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.217-222
• /
• 2012

Group communication on the Internet is exploding in popularity. Video conferencing, Enterprise IM, desktop sharing, and numerous forms of e-commerce are but a few examples of the ways in which the Internet is being used for business. The growing use of group communication has highlighted the need for advances in security. There are several approaches to securing user identities and other information transmitted over the Internet. One of the foundations of secure communication is key management, a building block for encryption, authentication, access control, and authorization.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.859-862
• /
• 2002

In this paper, we consider a discrete-time two-phase queueing system. We derive the PCF of the system size and show that it is decomposed into two probabilty generating functions (PCFs), one of which is the PGF of the system size in the standard Ceo/G/1 queue. Based on this PGF, we present the performance measure of interest such as the mean number of customers In the system.

• Proceedings of the SAREK Conference
• /
• 2006.06a
• /
• pp.820-825
• /
• 2006

It is necessary to correspond to building users' claims rapidly as much as possible in order to satisfy user's need, because the final tarket of building maintenance service is user of building. This paper investigates the time taken for receiving users' claims and the time taken for the service organization to respond to the claims in the office building; types of claims and service responses are analysed, through which the response characteristics of the maintenance management organization are evaluated with respect to users' claims. Throughout extensive simulation analysis, important performance measures such as mean time to repair and utilization of maintenance personnels have been investigated.