• The KIPS Transactions:PartC
• /
• 제10C권2호
• /
• pp.217-232
• /
• 2003

QoS routing can improve network performance while providing support for QoS guarantees. These benefits, however, comes with additional routing costs such as more complex and frequent route computation and the protocol overheads to exchange dynamic network state information. Moreover, little has been done to mininize the impact of the QoS traffic to the best effort traffic or to enhance the routine Performance of the best effort traffic when QoS routing is deployed. In this paper, it is proposed that a sewer based routing mechanism, which supports the QoS routing without incurring the QoS routing protocol overhead for the network state update exchanges and enhances the performance of the best effort traffic without affecting the performance of QoS routing. Simulation results show that the proposed scheme enhances the routing performance for the QoS traffic while reducing the routing protocol overhead. The routing performance of the best traffic is also improved with virtually no impact to the routine performance of the QoS traffic. The proposed scheme is shown to be especially effective when the ratio of QoS traffic is high, that is, when the impact of the QoS traffic to the performance of best effort traffic is significant.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제40권12호
• /
• pp.38-45
• /
• 2003

Recently, localized QoS routing scheme was recently proposed for overcome drawbacks of global state QoS routing schemes. Localized QoS routing dose not exchange QoS states among routers, but use virtual capacity based routing scheme instead. In localized QoS routing, to archive good performance, a set of candidate paths must be selected between the source and the destination effectively. In this paper we propose a few heuristics for effective path selection and develop path selection algorithms based on the heuristics. More detail analysis of the proposed algorithm is presented with simulation results which demonstrate that the path selection method can very affect the performance of localized QoS routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제32권12A호
• /
• pp.1226-1237
• /
• 2007

This paper proposes QoS mesh routing protocol for IEEE 802.16 based wireless mesh networks. QoS mesh routing protocol proposed in this paper is a proactive hop-by-hop QoS routing protocol. The goal of our routing protocol is not only to find a route from a source to a destination, but also optimal route that satisfies QoS requirements, given in terms of bandwidth and delay as default QoS parameters. In this paper, we first analyze possible types of routing protocols that have been studied for MANET and show proactive hop-by-hop routing protocols are the most appropriate for wireless mesh networks. Then, we present a network model for IEEE 802.16 based wireless mesh networks and propose a proactive hop-by-hop QoS routing protocol. Through our simulation, we represent that our routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

• Journal of KIISE:Information Networking
• /
• 제36권1호
• /
• pp.1-11
• /
• 2009

In this paper, we propose a QoS routing protocol for WiMAX based wireless mesh networks. The proposed routing protocol is a proactive hop-by-hop QoS routing protocol. It can find an optimal route that satisfies QoS requirements using bandwidth and delay as QoS parameters. In this paper, we first present a network model for WIMAX based wireless mesh networks and explain why QoS routing protocol is the most appropriate for WiMAX based wireless mesh networks. Then, we propose a proactive hop-by-hop QoS routing protocol that meets QoS requirements of traffic flowing between mesh client and the gateway. The simulation results show that the proposed routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (A)
• /
• pp.268-270
• /
• 2002

QoS 라우팅은 네트워크 활용률 및 사용자의 서비스 수준을 향상시키는 효과가 있으나 계산 및 프로토콜 오버헤드와 같은 추가 비용으로 인해 실제 IP 네트워크에서 널리 구현되지 못하고 있는 실정이다. 최근 이러한 QoS 라우팅의 오버헤드를 감소시키기 위해 서버를 기반으로 하는 QoS 라우팅 방안들이 제시된 바 있다. 그러나 이들 대부분은 QoS 트래픽의 성능 향상에만 초점을 맞추어 우선 순위가 보다 낮은 처선(Best effort) 트래픽에 대한 영향은 전혀 고려하지 않았다. 두 트래픽은 서로 다근 우선 순위에 따라 라우팅되는데 네트워크 자원을 공유하는 환경에서 효율적인 최선 트래픽 라우팅을 지원하지 못하는 경우에는 네트워크 자원 고갈 및 성능 저하의 문제를 초래한다. 이에 본 논문에서는 서버를 기반으로 하는 QoS 라우팅 성능에는 전혀 영향을 주지 않으면서 우선 순위가 낮은 최선 트래픽의 성능 또한 향상시킬 수 있는 새로운 라우팅 메커니즘을 제안하고, 시뮬레이션을 통해 그 성능을 평가하였다.

• The Journal of the Korea institute of electronic communication sciences
• /
• 제11권3호
• /
• pp.317-324
• /
• 2016

WiMedia provides the data rate of up to 1Gbps, but the transmission range is restricted to approximately 10 meters. When constructing a multi-hop WiMedia network to extend its coverage, conventional hop-based routing may not guarantee satisfactorily the required QoS. We propose two QoS routing techniques for the WiMedia-based wireless mesh network. The proopsed QoS routing reflects the characteristics of TDMA-based WiMedia MAC and develops QoS extensions separately for on-demand routing and table-driven routing. Through simulations, we identify that the QoS routing shows better performance than the hop-based routing. It also turns out that the QoS on-demand routing and the QoS table-driven routing show conflicting performance results depending on the transmission power.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (3)
• /
• pp.357-359
• /
• 2000

최근 들어 디지털(digital) 비디오나 오디오 같은 멀티미디어 응용 프로그램이 수요와 공급이 폭발적으로 늘어남에 따라, 이를 지원할 수 있는 새로운 프로토콜 아티텍쳐(architecture)들이 개발되고 있다. QoS(Quality-of-Service) 라우팅은 이러한 응용 프로그램들이 요구하는 QoS 요구사항을 기반으로 하는 라우팅(routing) 기법이다. QoS 라우팅은 네트워크의 동적인 상태를 반영하여 플로우(flow)가 요구하는 QoS를 만족시킬 수 있는 라우트를 찾아줌으로써 라우팅 성능을 향상시켰지만, 네트워크의 동적인 상태 정보를 모든 라우터가 가지고 있어야 함은 물론 적절한 시기에 네트워크 정보를 갱신시켜야만 한다. 이와 같이 네트워크 정보의 적절한 갱신 시기를 결정하는 것은 갱신 유발 정책이라 한다. 기존에는 라우팅 성능을 높이기 위해 네트워크 변화에 민감한 갱신 유발 정책을 사용하였으나, 이로 인해 발생하는 갱신 메시지는 또 하나의 트래픽(traffic)을 발생시켜 프로토콜 오버헤드(protocol overhead)를 초래하였다. 또한, 최근에는 이러한 프로토콜 오버헤드를 줄이기 위한 갱신 주기 정책이 제시되었지만 라우팅 성능 저하를 감수해야 하는 한계점이 발견되었다. 본 논문에서는 기존에 제시된 갱신 유발 정책에 비하여 프로토콜 오버헤드를 좀더 줄임과 동시에 라우팅 성능을 개선시킨 새로운 갱신 유발 정책을 제시하였다. 그리고, 이에 관한 시뮬레이션을 구현하여 프로토콜 오버헤드와 라우팅 성능을 비교한 결과, 기존 정책보다 더 효율적임을 발견하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제30권11B호
• /
• pp.744-749
• /
• 2005

This paper proposes the prediction based QoS routing algorithm, PSS(Prediction Safety-Shortest) algorithm that minimizes network state information overhead and presumes more accurate knowledge of the present state of all the links within the network. We apply time series model to the available bandwidth prediction to overcome inaccurate information of the existing QoS routing algorithms. We have evaluated the performance of the proposed model and the existing algorithms on MCI networks, it thus appears that we have verified the performance of this algorithm.

• The KIPS Transactions:PartC
• /
• 제9C권1호
• /
• pp.135-140
• /
• 2002

An efficient QoS routing scheme needs to find a path that satisfies a given QoS requirements while consuming as few resources as Possible. In this paper, we propose two schemes of calculating resources'costs one for on-demand and one for precomputation QoS routing schemes. These schemes are effective in respect to the global network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and Intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multip1e paths between all pairs of ingress and ogress border routers while considering balancing of the expected load. We, therefore, expect that the paths are bettor than any other paths in respect to reserving the network resources on Paths. The routine: scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. cote that our cost calculation schemes for both kinds of traffic could be used in existing QoS routing protocols without and modification in small and large scale of networks.

• Journal of KIISE:Information Networking
• /
• 제29권5호
• /
• pp.573-582
• /
• 2002

We propose centralized server based QoS routing schemes, where a route server is responsible for determining QoS paths on behalf of all the routers in a routing domain. In the proposed server based schemes, the dynamic link QoS state information, which is required for a QoS path computation, is implicitly maintained at route server as it assigns or gets back QoS paths. By maintaining the network state information this way, we may not only eliminate the overhead to exchange network state update message but also achieve higher routing performance by utilizing accurate network state information in path computation. We discuss path caching techniques for reducing the amount of path computation overhead at the route server, and evaluate the performance of the proposed schemes using simulation. The simulation results show that the path caching schemes may significantly reduce the route server load. The proposed schemes are also compared to the distributed QoS routing schemes proposed in the literature. It has been shown that the proposed server based schemes not only enhance the routing performance, but they are also competitive with respect to routing overheads.