• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.383-389
• /
• 2003

In this paper, we propose a solution, called M_DQDMR, for generating delay-constrained boundwidth-appropriated multicast routing trees to reduce the delay and conserved boundwidth resources of nodes in mobile computing environment. At the current router installation, we according the routing table and the information of link which neighboring rude to guarantee QoS(Quality of Service). When we construct multicast tree, M_DQDMR algorithm dynamically adjusts its appropriate tree construction policy based on how far the destination node from the delay bound and boundwidth our QoS requirement. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M_DQDMR can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve boundwidth resources.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.539-544
• /
• 2011

In this paper, a parameter optimization method of RIO-DC (RED (Random Early Detection) with In and Out-De-Coupled Queues) scheme for Assured Service (AS) in Differentiated Services (DiffServ) is proposed. In order to optimize QoS (Quality of Service) performance of the RIO-DC policy for AS in terms of maximum tolerable latency, link utilization, fairness, etc., we should design router nodes with proper RIO-DC operating parameter values. Therefore, we propose a RIO-DC configuration method and the admission control criterion, considering the allocated bandwidth to each subclass and the corresponding buffer size, to increase throughput for In-profile traffic and link utilization. Simulation results show that RIO-DC with the proposed parameter values guarantees QoS performance comparable with the RIO scheme and it improves fairness between AS flows remarkably.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1011-1014
• /
• 2002

This paper proposes a multicast packet-switching method which can less affect QoS degradation. The method includes a switch fabric with extra switching paths dedicated for multicast packets. Presented also are both a buffering structure and a scheduling algorithm for the proposed method. Simulation analysis for the method shows that the switching delay of unicast packets is decreased even though arrival rate of multicast packets is increased.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1589-1592
• /
• 2005

VPN(Virtual Private Network)은 물리적인 장비나 회선을 논리적으로 구분하여 기존 전용회선을 기반으로 하는 사설 네트워크에 비해 상대적으로 적은 구축 비용, 융통성 있는 확장성, 저렴한 운용비용의 장점을 보유한 별도의 사설 네트워크를 구성하는 기술이다. 다양한 VPN 기술 중에서도 MPLS VPN 은 확장성, QoS 제공을 용이하게 해주는 장점을 가지고 있어 차세대 네트워크 기술로 부각되고 있다. 일반적으로 MPLS VPN 은 ISP 에서 제공하는 서비스로 인식되나 규모가 크고 다양한 사설 네트워크를 필요로 하는 기업의 네트워크 모델로도 적합하다. 또한 Virtual Router VPN 은 Customer Edge(CE) 장비로서 활용성이 큰 Switch 장비에 적용하여, CE 를 MPLS VPN 과 쉽게 연동하게 한다. 본 논문에서는 MPLS VPN 및 Virtual Router VPN 을 이용하여 기업 네트워크를 효과적으로 구성하는 방안을 기술한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1330-1336
• /
• 2014

QoS techniques and transmitted in real-time communication with the advancement of technology a variety of applications and services are available these days, mobile devices bogeuphwa LTE technology to the development of multimedia services with high quality can be realized. In order to satisfy this condition simply with a router with an increased bandwidth expansion by considering the increase in the routing table of the network scalability problems included. Burst traffic data to be distributed according to the environment is to be centered. To do this, the destination -based routing method to transmit the current paper -based (Source routing) routing settings are required. In this paper, published by the IETF, IP switching system based on standardized protocol Label Switching Multi-Protocol Label Switching (MPLS) network by using the existing Best Effect is difficult to guarantee QoS for multimedia transmission in MPLS network environment using optimized QoS guarantees to transmit the multicast.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.475-477
• /
• 2003

본 논문에서는 PC 기반 FreeBSD 라우터에 대역 브로커를 통한 동적 자원 관리를 지원할 수 있도록 COPS를 신호 프로토콜로 사용하는 차별화 서비스 지원 라우터를 구현하였다. 구현을 위해 ASN.1 표기법으로 PIB를 작성하고 이를 위한 인코딩/디코딩 모듈을 구현하였다. 또한, 라우터의 자원 제어를 수행하는 QoSD(QoS Daemon)와 COPS(Common Open Policy Service) 클라이언트를 구현하였다. 그리고 QoSD와 COPS 클라이언트 간의 통신 프로토콜을 정의하고 구현하였다. 또한, COPS 메시지 단위의 롤백을 위하여 라우터에 롤백 모듈을 구현하였고, 자원 관리 및 롤백 시 필요로 하는 인터페이스, 클래스, 필터, 컨디셔너의 추가 및 삭제 기능을 구현하였다. 그리고 테스트 베드를 구축하여 구현된 라우터의 동작 검증을 수행하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.76-87
• /
• 2014

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and is predicted to increase remarkably in the near future. For this reason, this paper studies energy saving strategies assuring the network-level QoS. In the strategies, the energy consumption of NIC(network interface card) on both endpoint of links decreases by selecting links and making them sleep when the total traffic volume of the IP network is lower than a threshold. In this paper, we propose a heuristic routing algorithm based on so-called delegating/delegated routers, and evaluate its characteristics using computer simulation considering network-level QoS. The selection of sleep links is determined in terms of the number of traffic paths (called min_used path) or the amount of traffics(called min_used traffic) through those kinks. To our experiment, the min_used traffic method shows a little better energy saving but the increased path length compared to the min_used path method. Those two methods have better energy saving characteristics than the random method. This paper confirms that the delegating/delegated router-based routing algorithm results in energy saving effects and sustains network-level QoS in IP networks.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.722-737
• /
• 2002

As the number of multimedia applications increases, various protocols and architectures have been proposed to provide QoS(Quality of Service) guarantees in the Internet. Most of these techniques, though, bear inherent contradiction between the scalability and the capability of providing QoS guarantees. In this paper, we propose a protocol, named DQSP(Dynamic QoS Support Protocol), which provides the dynamic resource allocation and admission control for QoS guarantees in a scalable way. In DQSP, the core routers only maintain the per source-edge router resource allocation state information. Each of the source-edge routers maintains the usage information for the resources allocated to itself on each of the network links. Based on this information, the source edge routers perform admission control for the incoming flows. For the resource reservation and admission control, DQSP does not incur per flow signaling at the core network, and the amount of state information at the core routers depends on the scale of the topology instead of the number of user flows. Simulation results show that DQSP achieves efficient resource utilization without incurring the number of user flow related scalability problems as with IntServ, which is one of the representative architectures providing end-to-end QoS guarantees.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1453-1460
• /
• 2014

WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in the condition of no packet loss, and the WFQ scheduler guarantees those QoS requirements with the allocated resource. In practice, however, most QoS-guaranteed services allow a degree of packet loss, especially from 0.1% to 3% for Voice over IP. This paper discovers that the packet loss rate of each traffic flow is determined by only its time-stamp adjustment value, and then enhances the WFQ to provide a differentiated packet loss guarantee under general traffic conditions in terms of both traffic characteristics and QoS requirements. The performance evaluation showed that the proposed WFQ could increase the utilization of bandwidth by 8~11%.