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

ATM forum defined several ATM oriented services such as ABR, VBR, CBR, UBR, and others. Among them, ABR service is considered as one of the most appropriate ones in the LAN environment. ABR controls network traffic by using RM cells according to ATM forum standard. In particular, the point-to-multipoint ABR service in general uses consolidation algorithms to solve feedback implosion at the branch point. Consolidation algorithms alleviate propagation delay and network congestion problem: thus, the efficiency of consolidation algorithm is closely related to the network performance. In this paper, we describe the limitation of existing consolidation algorithms based on thorough analysis, and then propose an algorithm that performs better than the existing algorithms. We show that the proposed algorithm improves network performance through a parametric simulation, In our simulation the performance measure is the cell rate which is controlled by exploiting the congestion depth. We also found that the proposed algorithm not only improves efficiency of network, but also eliminates the consolidation noise.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.1 no.2
• /
• pp.102-109
• /
• 2006

In this paper, we improve the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. For example, even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congestion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.55-62
• /
• 2014

This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1359-1371
• /
• 1999

In this paper, we propose an efficient explicit rate (ER) feedback switch algorithm for available bit rate (ABR) flow control. In order to improve the disadvantages of existing ER feedback switch algorithms with congestion avoidance, the proposed scheme adjusts the target utilization dynamically according to the queue length and its growth rate. also, we investigate the performance of the proposed switch algorithm and compare it with ERICA and NIST switches using simulation. Simulation results show that the proposed switch algorithm can control the cell emission rate of a source rapidly according to variations of available link bandwidth by using dynamic adaptation of target utilization. It also exhibits a better performance than the existing ER feedback switches in terms of queue length and link utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1116-1125
• /
• 1997

In this paper, the modified UPC(Usage Parameter Control) algorithm is proposed. The proposed UPC algorithm is based on Leakey Bucket algorithm and adds the characteristics of the jumping window algorithm for monitoring the average bit rate. The proposed algorithm let a cell, which is tagged by Leaky Bucket algorithm, pass through the network, if the network does not violate the average bit rate. The measuring method of window mechanism like jumping window. This paper supposes On/Off traffic source model of rthe performance evaluation and analysis of the proposed algorithm. Therefore, as simulation results, the proposed algorithm acquires more reduced results of the cell loss rate and bucket size than the Leaky Bucket algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.5
• /
• pp.125-132
• /
• 2017

Vehicular safety service reduces traffic accidents and traffic congestion by informing drivers in advance of threats that may occur while driving using vehicle-to-vehicle (V2V) communications in a wireless environment. For vehicle safety services, every vehicle must broadcasts a Basic Safety Message(BSM) periodically. In congested traffic areas, however, network congestion can easily happen, reduce the message delivery ratio, increase end-to-end delay and destabilize vehicular safety service system. In this paper, to solve the network congestion problem in vehicle safety communications, we approximate the relationship between channel busy ratio and the number of vehicles and use it to estimate the total network congestion. We propose a new context-aware transmit power control algorithm which controls the transmission power based on total network congestion. The performance of the proposed algorithm is evaluated using Qualnet, a network simulator. As a result, the estimation of total network congestion is accurately approximated except in specific scenarios, and the packet error rate in vehicle safety communication is reduced through transmit power control.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1223-1234
• /
• 2002

RTP payload must be encrypted for providing commercial VOD service or private video conference over the Internet. Encryption/decryption delay is minimized because there are constraints in transporting a multimedia data through the Internet. Therefore, encryption algorithm is changed with considering network traffic md load. During many users participate in the same multimedia service, an user who already left the service can receive and decrypt the RTP payload because of knowing the encryption key. In this paper, Security Control Protocol for RTP is designed and implemented for changing the encryption algorithm and the key.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.114-115
• /
• 2011

최근 애드혹 네트워크에서 신뢰성과 확장성을 고려하여 메쉬 라우팅의 지원이 요구되고 있으며 IEEE 802.15.5의 Low-rate WPAN Mesh 와 ZigBee alliance에서 AODV를 기반으로 한 메쉬 라우팅이 대표적이다. IEEE 802.15.5 Low-rate WPAN Mesh의 경우 메쉬 라우팅을 위해 hello command의 주기적인 브로드캐스팅이 필요한데 이는 네트워크를 구성하는 노드의 밀집도가 증가할 경우 그 부하가 기하급수적으로 증가하게 된다. 또한 ZigBee alliance의 AODV 기반 메쉬 라우팅 기법도 RREQ 메시지의 브로드캐스팅에 기반하고 있기 때문에 경로 설정을 위한 제어 트래픽의 부하가 매우 크다는 단점을 갖는다. 본 논문에서는 TDMA 네트워크에서 TDMA MAC의 특성과 토폴로지 기반으로 할당된 주소를 활용한 메쉬 라우팅 알고리즘의 설계를 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1485-1488
• /
• 2004

본 논문에서는 모바일 컴퓨팅 환경에서 자원 예약 때문에 발생하는 자원의 비효율적 사용을 개선시키기 위해서 자원 예약에 필요한 시점을 결정하는 알고리즘을 제안한다. 모바일 컴퓨팅 환경에서의 자원 예약은 향후 셀로 진입할 핸드오프 콜을 위해서 자원을 미리 할당하기 때문에 실제로 사용하지를 않는 자원을 사용하는 것으로 간주한다. 이러한 문제점은 모바일 컴퓨팅 환경에서 자원 효율성을 크게 저하시킨다. 본 논문에서는 인터넷상에서 트래픽을 효율적으로 관리하기 위해서 사용된 혼잡 제어 방법과 유사한 방법을 사용하여 핸드오프 콜의 자원 예약 시점을 결정한다. 그리고 본 논문에서 제안하는 자원 예약 결정 알고리즘은 [2]에서 제안한 이동성 모델을 기반으로 하여 셀 내부 이동 횟수를 기반으로 자원 예약을 결정할 시점을 정한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1178-1190
• /
• 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 efficiently assign resource for VBR traffic, in this paper, we propose TXOP algorithm based on dual leaky bucket using average resource allocation and peak resource allocation. The minimum TXOP of each station is obtained by using statistical approach to maximize number of stations of which performance satisfy QoS target. Simulation results show that the proposed algorithm has much higher performance compared with reference scheduler in terms of throughput and delay.