• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.535-539
• /
• 1998

오늘날 멀티미디어 응용들은 다양하고 세분화된 QoS 지원을 요구하는데, 이와 같이 만족시켜야 할 QoS 파라미터의 수가 둘 이상이 되는 경우 라우팅 문제는 NP-complete하다고 말하며, 이러한 문제는 휴리스틱 알고리즘을 통해 해결된다. 본 논문에서는 ATM Forum에서 정의한 다섯 가지 서비스 유형 별로 연관된 서비스 품질 파라미터를 분류하고, 서비스 유형별로 독립된 경로 선택 기준 및 경로 계산 알고리즘을 적용하여 호 설정 시간 및 호 차단율을 낮출 수 있는 휴리스틱 알고리즘을 제안한다. 또한 임의의 망 모델 환경에서 CBR 서비스 유형에 대해 제안된 알고리즘을 시뮬레이션하여 성능 분석을 수행한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1055-1063
• /
• 2002

In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effort service that can satisfy one requirements. In order to satisfy a call with various Qualify-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.459-465
• /
• 2014

Recently, multimedia data transmission becomes important issues in the wireless sensor network. For the multimedia data transmission in wireless sensor network, QoS (Quality of service) is an important factor to determine the system performance. AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment. In AODV, the destination node selects the route with the smallest hop count. Since AODV only considers the hop count, the selected route could have low channel condition, and degrade QoS. In this paper, we propose a modified AODV algorithm that considers the successful transmission rate of each link. The proposed algorithm regards the number of retransmission which can be obtained from the successful transmission rate as the hop count, and applies the modified hop count to AODV. The advantage of the proposed algorithm is that the modified AODV can support QoS without significant change of the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.417-422
• /
• 2010

In this paper, we propose a new routing scheme based on the multiple layer routing strategy. This algorithm can guarantee the required QoS while maximizing energy efficiency in wireless sensor networks. The principle contributions of this work are its simplicity, scalability and responsiveness to current network situations. Simulation results indicate the superior performance of our proposed algorithm, while other existing scheme cannot offer such an attractive performance balance.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.119-125
• /
• 2007

On account of limited resources and diverse topology change. it is difficult to manage MANET and guarantee QoS. In current MANET, QoS grantee is exceedingly significant. However, today's MANET are being concentrately worked on MAC protocols and routing protocols. Thus we proposed a framework for effective management of MANET and supporting QoS using policy based network management paradigm and active network technology. Since this framework employs the policy-based management approach in active network environment, it provides an abstract and autonomous management method to network managers.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1245-1248
• /
• 2003

Ad-hoc 네트워크는 유선 인프라의 구성이나 도움 없이 이동 단말기들로만 손쉽게 통신망을 구성하여 긴급구조나 전쟁터 등에서 무선 데이터 서비스를 제공할 수 있는 무선 네트워크를 말한다. 지금까지는 이러한 무선망에서는 품질보다는 연결 자체에 큰 의미를 두어왔으나, 최근에는 Ad-hoc 릴레이 시스템과 같은 확장된 개념의 Ad-hoc 망으로 범위가 넓혀지고 있어 품질에 대한 요구 수준이 증대되고 있다. 기존 Ad-hoc 라우팅 프로토콜들은 고품질의 안정된 멀티미디어 정보 전달과 같은 사용자들의 요구를 충족시킬 수 없으므로, Ad-hoc 네트워크에서도 유선망에서와 같은 QoS 보장을 위한 기술이 부가되어야만 하며, 본 논문에서는 이상과 같은 추세에 맞춰 보다 안정적이고 품질이 보장될 수 있도록 분산형 QoS모니터링 기법이 도입된 DQM-CBRP를 제안한다. 그리고 이 DQM 기반 CBRP 라우팅 프로토콜의 적정한 운용을 위해 시뮬레이션을 수행하고 적정 운용 노드 수나 운용 범위 등을 분석한다.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.11-19
• /
• 2011

In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information for source routing in transport networks that conduct hierarchical QoS routing. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. This method selects the main path weight in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some path weight during aggregation process. In this paper, the main path weight is defined as outlier. Service Boundary Line has 2k+5parameters. k is the number of outliers. The number of storage spaces of Service Boundary Line changes according to the number of outliers. Simulation results show that our approximation method requires a storage space that 1.5-2 times larger than those in other known techniques depending on outlier selection method, but its information accuracy of proposed method in the ratio between storage space and information accuracy is higher.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.879-888
• /
• 2004

Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

• 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.