• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.139-140
• /
• 2007

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2413-2417
• /
• 2003

This paper proposes an improvement of a QoS based routing protocol. The hierarchical source routing algorithm[4] was improved by including of the Crank-Back algorithm[2]. The Crank-Back capability is the ability to solve the problem of selecting the wrong route because of using unsynchronized routing information in the ingress router. In order to reduce time of reversing the call-setup process back to the ingress router, spare-route information is included with a call-setup packet. Spare-route information could be used by every router to find the next appropriated link itself when insufficient resource of the selected link was found. The proposed algorithm improves the performance of the source routing call-setup process significantly.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.137-144
• /
• 2022

Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1690-1700
• /
• 2000

Connection management function of the TINA which is developed by TINA-C provides network connection services such as setup modification and release of connections. The connection management function provides these services to network operators to the fault management function that provides backup-path and to the performance management function that provides load-balancing. The connection management function necessarily requires a routing algorithm to set up a new connection. In this paper we propose a new routing algorithm named QTHR (QoS and Traffic parameter based Hierarchical Routing) for TINA based connection management of ATM/B-ISDN network. And we implemented the QTHR and analyzed the performance of the QTHR.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.428-437
• /
• 2007

Along with the development of network, more and more functions and services are required by users, while traditional network fails to support all of them. Although overlay is a good solution to some demands, using them in an efficient, scalable way is still a problem. This paper puts forward a framework on how to construct an efficient, scalable overlay mesh in real network. Main differences between other overlays and ours are that our overlay mesh processes some nice features including class-of-service(CoS) and traffic engineering(TE). It embeds the end-to-end optimal traffic control law which can distribute traffic in an optimal way. Then, an example is given for better understanding the framework. Particularly, besides good scalability, and failure recovery, it possesses other characteristics such as routing simplicity, self-organization, etc. In such an overlay mesh, an applicable source routing scheme called hierarchical source routing is used to transmit data packet based on UDP protocol. Finally, a guideline derived from a number of simulations is proposed on how to set various parameters in this overlay mesh, which makes the overlay more efficient.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1442-1448
• /
• 2003

Network Management become more and more important issue in the network environment in which many applications such as Mail, teleconferencing, WWW and database software are operated. It can be possible for The Bridge and Router forwarding data to select next hop device which results in routing incorrect path from the viewpoint of network design. In this paper we address the problem of finding the detour routing path due to incorrect setting on routing devices. We propose the new algorithm for finding detour muting path based on hierarchical network structure analysis using information from SNMP MIB. To prove the correctness of the unposed algorithm we have done simulation with predefined data. Simulation results show that the algorithm finds detour path correctly.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.463-466
• /
• 2009

MANET(Mobile Ad-Hoc Network) mean network that configured to mobile device without the help of Fixed infra. Node in MANET constraints have such as liquidity and battery. Node concentrated areas or the size of the network becomes large that causes some issues. It's the problem of routing overhead when path set, path navigation and reset path. In this paper ZRP(Zone Routing Protocol) and ZHLS(Zone-Based Hierarchical Link State) are analyzed. As a result, offers the Fixed ZRP.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.95-100
• /
• 2008

In this paper, we propose a new interconnection network topology, hierarchical folded hyper-star network HFH($C_n,\;C_n$), which is based on folded hyper-star network. Our results show that the proposed hierarchical folded hyper-star network performs very competitively in comparison to folded hyper-star network and hierarchical network HCN(m,m), HFN(m,m) have been previously proposed, when diameter ${\times}$ degree is used as a network cost measure. We also investigate various topological properties of HFH($C_n,\;C_n$) including connectivity, routing algorithm, diameter, broadcasting.