• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.100-104
• /
• 2004

In this paper, we propose multicast routing algorithm to guarantee QoS in mobile computing environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that DQDMR can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.129-132
• /
• 2003

In this paper, we propose the DQM - CBRP( Distributed QoS Monitoring - Cluster Based Routing Protocol ) routing protocol to provide Quality of Service guarantee for multimedia service in Ad hoc mobile network. This paper proves the DQM-CBRP can avoid message loss and is suitable to guarantee of QoS thru simulation of COMNET III.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1586-1605
• /
• 2012

With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.140-147
• /
• 2001

In this paper, we propose a scheme of calculating resources\` costs for precomputation in QoS routing schemes. This scheme is effective in respect to the g1oba1 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 multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load and then selects paths with the probability of path selection. We, therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And for analysis of a load balancing cost calculation proposed a simulation is done.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.241-244
• /
• 2004

In recent years, WDM networks have received much attention as the Internet backbone networks because of the explosive growth of the Internet IP-based traffic. The Optical Burst Switching (OBS) has been proposed as an effective optical switching technology in the WDM networks. OBS has the advantages in 1) the high usage rate of the bandwidth, and 2) no necessity of optical buffer. However OBS has the burst-contention problem in the networks. The deflection routing is proposed as one of means to solve this problem. In this paper, we propose a new routing method of using deflection routing. In addition. we propose a QoS/CoS control method using a new routing algorithm. Finally, we show the variety of the proposed methods by computer simulations.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.324-333
• /
• 2001

The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.189-196
• /
• 2007

In this paper, we proposed a mobile ad hoc routing protocol based on AODV(Ad hoc On demand Distance Vector) with QoS(Quality of Service) support and evaluated the performance through simulation. The waste of communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node. For performance evaluation, we analyzed the average data reception rate, considering the node mobility and the number of best effort/QoS data flows. We found that in the mobile Ad Hoc networks the QoS service for some specific data flows increased the average data reception rate for the QoS data flows.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.361-368
• /
• 2011

In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.148-153
• /
• 2012

In this paper, we propose a fault-tolerant QoS routing scheme based on interference awareness for providing both high throughput and minimum end-to-end delay for wireless sensor networks. With the proposed algorithm, it is feasible to find out the optimal transmission path between sensor nodes to the sink node by using cumulative path metric where real-time delivery, high energy efficiency and less interference are considered as in path selection. Finally, simulation results show that network throughput and delay can be improved by using the proposed routing scheme.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.237-240
• /
• 2004

본 논문에서는 앞으로 광대역통합망에서 사용자의 요구사항에 따른 QoS를 제공하기 위한 연구의 일환으로 여러 가지 서비스 모델과 메커니즘을 살펴보고, 라우팅 최적화를 위한 유전 알고리즘과 hybrid 유전알고리즘에 대하여 논한다. OSPF에 바탕을 둔 라우팅 최적화만으로 QoS가 충분하지 않은 경우 약간의 MPLS 경로가 QoS를 개선하기 위해 설정될 수 있다. 이러한 상보형 MPLS 라우팅을 위한 두 개의 MTP 모델을 제안하고. 적절한 네트워크 QoS 대책으로 네트워크 내의 최대 링크 이용을 고찰한다.