• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.670-672
• /
• 2001

최근 인터넷에서는 메일, 파일 전송 등의 비실시간 응용 뿐만 아니라 음성, 비디오 등의 실시간 응용 서비스를 이용하려는 요구가 증가하고 있다. 이를 위해 광대역 서비스 뿐만 아니라 사용자별 차별화된 QoS의 보장이 요구된다. 네트워크를 통해 전달되는 패킷의 지연 시간과 데이터 처리율, 그리고 손실은 서비스에 따른 요구사항 등이 QoS의 주요 내용인데, 현재의 인터넷은 모든 패킷을 동일하게 전달하는 최선의 노력(Best-Effort)만을 제공하고 있기 때문에 서비스에 따른 패킷의 전달 지연과 지연 변이에 대한 요구사항을 보장해 주지 못하고 있다. 본 연구에서는 분산된 네트워크 환경에서 효율적인 QoS 관리를 위해 이동 에이전트(Mobile Agents)를 이용한 모니터링 시스템을 설계 및 구현하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8S
• /
• pp.2713-2721
• /
• 2000

이 논문에서는 Web 사이트를 설계할 때 응답시간과 관련해서 고려되어야 할 요수 중[10,15,16], 인터넷 연결 회선의 대역폭 결정에 참조될 수 있는 자료를 제시한다. 이를 위해 다양한 환경에서 Web 세션 도착율에 따른 응답시간과 회선 이용율의 변화를 관찰하고, 이를 통해 특정 대역폭의 회선에 대해 Web 서비스가 한계 응답시간 내에 보장될 수 있는 Web 세션 도착율의 임계치를 구한다. [15,16]. 이 논문에서는 데이터 수집을 위해 실험 네트워크를 구성하고, 자체적으로 구현한 패킷 생성기를 이용하여 세션 도착율의 변화에 따른 Web 트래픽을 시뮬레이션한다. 응답시간은 패킷 생성기가 생성한 각각의 HTTP(Hyper-Text Transfer Protocol)요청 패킷이 전송되는 시점부터 HTTP응답 메시지가 도착하는 시점까지의 경과된 시간으로 구하고, 회선 이용율은 SNMP(Simple Network Management Protocol)를 이용해 자체 구현한 데이터 수집기로 구한다[3]. 이 실험의 결과는, Web 사이트를 설계할 때 네트워크 전문가가 아니더라도 인터넷 연결 회선의 대역폭 결정 문제를 해결하는데 쉽고 유용하게 참조될 수 있다.

• Journal of Internet of Things and Convergence
• /
• v.1 no.1
• /
• pp.1-4
• /
• 2015

This paper aims to present the mathematical model to find the mean web object transfer latency in the slow-start phase of TCP congestion control mechanism, which is one of the main control techniques of Internet. Mean latency is an important service quality measure of end-user in the network. The application area of the proposed latency model is the narrowband environment including multi-hop wireless network and Internet of Things(IoT), where packet loss occurs in the slow-start phase only due to small window. The model finds the latency considering initial window size and the packet loss rate. Our model shows that for a given packet loss rate, round trip time and initial window size mainly affect the mean web object transfer latency. The proposed model can be applied to estimate the mean response time that end user requires in the IoT service applications.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.727-732
• /
• 2015

These days, many researchers are working on Future Internet and a new networking paradigm called Software Defined Networking draws a great attention. In this paper, we redefine Software Defined Networking as Service Defined Networking which means that packets are categorized according to types of services. By using Service Defined Networking, we are not only dealing with the way to utilize the network resources efficiently but we also propose an algorithm to minimize the waiting time for packets to be delivered. This proposed algorithm can solve the delay problem, one of the most significant problems caused by network congestion. Also, since we are adopting Service Defined Networking, network resource utilization can be improved compared to the existing network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.916-924
• /
• 2003

Fair queueing has been an important issue in the multimedia networks where resources are shared among nodes both wired and wireless. In most fair queuing algorithms, based on the generalized processor sharing(GPS), emphasizes fairness guarantee while overlooking bounded delay guarantee which is critical to support multimedia services in the networks. In this paper, we propose a new fair queueing scheme, delay guaranteed fair queueing (DGFQ), which guaranteeing bounded delay of flows according to their individual delay requirements for multimedia services in the wireless packet networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.895-900
• /
• 2010

As the diverse telecommunication services have been developed, network designers need to prevent congestion which may be caused by properties of timecorrelation and burstiness, and unpredictable statistical fluctuation of traffic streams. This paper considers the leaky bucket scheme with combined control of arrival and token rates, in which the arrival rate and the token generation interval are controlled according to the queue length. By using the embedded Markov chain and the supplementary variable methods, we obtain the queue length distribution as well as the loss probability and the mean waiting time.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.419-428
• /
• 2008

IEEE 802.15.4 reserves transmission time to support real-time transport by sending GTS request packets to the PAN coordinator in advance. This paper introduces GTS-FAT technique to reduce the reservation time by giving a higher sending priority to GTS request packets than data packets. Differently from the conventional scheme where these two kinds of packets share a single transmission queue, GTS-FAT scheme allocates two queues with two different contention window sizes like IEEE 802.11e. This paper also proposes an analytical GTS delay model by combining the two legacy models for 802.15.4 and 802.11e to accurately predict the GTS-FAT delay over a given network topology. Our analysis shows that GTS-FAT reduces GTS service delay by up to 50% at the expense of the data delay by only up to 6.1% when GTS request packets four times outnumber data packets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

• Proceedings of the KAIS Fall Conference
• /
• 2011.05a
• /
• pp.207-210
• /
• 2011

무선으로 근거리 디바이스들을 연결하는 무선 랜에서는 CSMA/CA를 기반으로 하는 IEEE 802.11이 대표적인 프로토콜로 사용되고 있다. IEEE 802.11 무선망에서 지연에 민감한 실시간 멀티미디어 응용 서비스들의 요구가 증가함에 따라 MAC 계층에서의 지연시간에 대한 연구는 중요하다. IEEE 802.11 무선랜의 기본적인 액세스 방법으로 사용하는 DCF는 경쟁 스테이션이 적은 상황에서는 비교적 우수한 성능을 보이나 경쟁 스테이션의 수가 많은 경우 처리율, 패킷지연 관점에서 성능이 저하되는 문제점이 있다. 본 논문에서는 IEEE 802.11 무선 랜 환경에서 전송에 성공한 패킷의 평균지연시간과 전송에 실패하여 패킷이 폐기되기까지의 평균시간에 대해 제안된 방식들의 성능을 분석하고 시뮬레이션을 통해 이를 입증한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.574-582
• /
• 2004

This paper shows the performance comparisons of several different rate scheduling schemes for non-real time data service over the uplink of burst switching-based direct sequencecode division multiple access (DS/CDMA) system to support the integrated voice/data service. The closed-form solution of optimal scheduling formulation, which minimizes average transmission delay when all of the active data users are transmitting simultaneously, is presented and mathematical analyses with other rate scheduling schemes, which provide efficiency criterion of transmission delay for rate scheduling schemes, are performed. Numerical results show the analyses explicitly.