• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12B
• /
• pp.2003-2015
• /
• 2000

본 논문에서는 ATM 망을 구성하고 있는 노드(node) 간의 셀(cell) 전송시에 출력 링크(output link)로 전송된 셀이 수신 노드에서 수행하는 UPC/NPC에 의해 손실되지 않는 트래픽 정형화기(shaper)를 제안한다. 제안한 정형화기는 비실시간 가변비트율(nrt-VBR) 트래픽을 대상으로 한 것으로 각 ATM 연결(connection)에 대해 독립된 큐(queue)를 할당하였으며, 출력 링크로 전송할 셀을 저장하고 있는 큐를 선정하기 위해 모든 큐에 대해 Generic Cell Rate Algorithm(GCRA)를 수행하여 큐의 상태를 결정하고, 그 결과 전송 가능 상태에 있는 모든 큐들을 대상으로 본 논문에서 제안한 시간의존 확률적 스케줄링(time-dependent probability scheduling) 알고리즘을 적용하여 특정 큐를 선택하여 셀을 전송한다. 제안한 정형화기의 성능평가를 위해 WRR(Weighted Round Robin) 스케줄링 알고리즘을 사용한 정형화기 및 WFQ(Weighted Fair Queueing) 스케줄링 알고리즘을 적용한 정형화기에 대한 모의실험을 하였으며, 그 결과 제안한 정형화기는 비실시간 가변비트율(nrt-VBR) 트래픽의 정형화(shaping)에 우수한 성능을 나타냄을 확인하였다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.10a
• /
• pp.147-150
• /
• 1998

ATM 환경의 다양한 QOS를 갖는 트래픽의 우선순위제어를 위해, ATM 스위치의 출력 버퍼에 저장되는 셀의 큐메카니즘을 제안하였다. 제안한 큐 방식은 가변큐공유(VQS4 : Variable Queue Sharing with 4 queue)방식으로서 기존의 고정 큐 방식의 문제점인 버스트 트래픽으로 인한 큐 오버플로우의 문제점을 개선하기 위해 CBR 큐, VBR-rt큐, VBR_nrt 큐, ABR 큐의 영역을 가변적으로 공유하여 큐 자원의 이용율을 최대화시킴으로써 순간 버스트 트래픽 유입으로 인한 셀손실율을 최소화시킬 수 있는 특성을 제공한다. VQS4 방식의 성능을 평가하기 위해 버스트 특성이 강한 트래픽 패턴을 이용하여 고정 큐를 이용한 HOL과 제안 방식인 VQS4의 셀손실률 및 평균 지연률을 비교하였으며 시뮬레이터는 Visual Slam 2.0(AweSim)을 이용하여 작성했다.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.27-30
• /
• 2000

In this paper, we propose a new dynamic bandwidth allocation and call admission control method for the VBR video sources with QoS constraints to provide user's quality of service requirements and at the same time to achieve an efficient resource management in networks. The proposed mechanism dynamically adjusts the necessary bandwidth by the networks based on the provided quality of service satisfaction degree of each connection in respect to the user's requirements in terms of loss ratio and average delay Simulation results show that our proposed dynamic method is able to provide the desired level of quality of service and high utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2218-2229
• /
• 2015

Recently Wi-Fi Alliance defined Wi-Fi direct, which can communicate through a direct connection between the mobile device anytime, anywhere. In Wi-Fi direct, all devices are categorized by group of owner (GO) and client. Since portability is emphasized in Wi-Fi direct devices, it is essential to control the energy consumption of a device very efficiently. In order to avoid unnecessary power consumed by GO, Wi-Fi direct standard defines two power management schemes: Opportunistic power saving scheme and Notice Of Absence (NOA) scheme. But, these two schemes do not consider the traffic pattern, so we cannot expect high energy efficiency. In this paper, we suggest an algorithm to enhance the energy efficiency of Wi-Fi direct power saving, considering the characteristics of multimedia video traffic. Proposed algorithm utilizes the statistical distribution for the size of video frames and adjusts the length of awake interval dynamically. Also, considering the inter-dependency among video frames, the proposed algorithm assigns priorities to video frames and ensures that a video frame with high priority is transmitted with higher probability than other frames with low priority. Simulation results shows that the proposed method outperforms the traditional NOA in terms with average delay and energy efficiency.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3011-3018
• /
• 2000

On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.1
• /
• pp.1-13
• /
• 2001

In this paper, we propose a new dynamic bandwidth allocation and call admission control for VBR video sources with QoS constraints to support an efficient resource management and at the same Lime to satisfy the user's quality or service requirements. For the dynamic bandwidth allocation, first the next amount of traffic is predicted using a modified adaptive linear prediction method that considers abrupt scene change effects. And then, we dynamically allocate the necessary bandwidth to each connection based on the currently provided quality degree by the network with respect to the user's QoS requirements in terms of average delay and loss ratio. For the admission control, we determine the acceptance or rejection or a new connection based on the quality satisfaction degrees of the existing connections. Simulation results show that our proposed dynamic schemes are able to provide a stable service, which well meets the user's quality requirements.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.80-91
• /
• 2002

A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.17-32
• /
• 1996

In this paper, a model for two-layered video traffic is proposed. The performance analysis of the proposed model and the effects of two-layer coding scehemes in ATM networks are also studied. ATM-based networks give the possibility to support image codingat variable bit rate(VBR). Two layer coding is one of the very promising methods among many proposed methods to compensate the cell loss, the major drawback in ATM networks. From the experimental data of the 2-layer coded video traffics, it is observed that traffic patterns of base layer and enhanced layer are highly correlate to each other, when constant image quality is kept. With this observation, coded two layered video traffic can be modeled as 2-dimensional Markov chain. The model well fit the real experimental data. The model was used for the analysis of the performance of statistical multiplexer with priorites in ATM networks.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.325-329
• /
• 2007

The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.