• Smart Media Journal
• /
• v.7 no.2
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.1-8
• /
• 2010

The fault diameter is one of the important measures for transmission rate and reliability of interconnection network. H.-O. Lee et al.[Parallel paths in folded hyper-star graph, Journal of KIPS, Vol.6, No.7, pp.1756-1769, 1999] suggested the node-disjoint paths of FHS (2n,n), and proved that the fault diameter of FHS(2n,n) is less than 2n-1. In this paper, we suggest an advanced node-disjoint paths of FHS(2n,n). We also prove that the wide diameter of FHS(2n,n) is dist(U,V)+4, and the fault diameter of FHS(2n,n) is less than n+2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1371-1379
• /
• 2009

In this paper, we propose a new multi-path routing protocol to provide reliable and stable data transmission in MANET that is composed of high-mobility nodes. The new multi-path routing establishes the main route by the mechanism based on AODV, and then finds the backup route that node-disjoint from the main route by making add nodes in the main route not participate in it. The data transmission starts immediately after finding the main route. And the backup route search process is taking place while data is transmitted to reduce the transmission delay. When either of the main route or the backup route is broken, data is transmitted continuously through the other route and the broken route is recovered to node-disjoint route by the route maintenance process. The result of the simulation based on the Qualnet simulator shows that the backup route exists 62.5% of the time when the main route is broken. And proposed routing protocol improved the packet transmission rate by 2~3% and reduced the end-to-end delay by 10% compared with AODV and AODV-Local Repair.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1160-1170
• /
• 2010

Existing multipath routing mechanism has much overhead to maintain the state of nodes on the multipath route and does not guarantees completely disjoint multipath construction from source to destination. In this paper, we propose an Explicit Disjoint Multipath (EDM) routing algorithm to enhance energy efficiency through removing the flooding mechanism for route discovery process, minimizing the number of nodes participating in route update and balancing the traffic load for entire network. EDM constructs logical pipelines which can create disjoint multipaths in logical way. Then it physically performs anchor node based geographic routing along the logical pipeline in order to build multipath to the destination. EDM can provide the distribution effect of traffic load over the network, help to balance the energy consumption and therefore extend the network lifetime.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.897-904
• /
• 2013

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.429-436
• /
• 2005

A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.131-142
• /
• 2011

In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2701-2710
• /
• 1997

Recursive circulant graph has recently developed as a new model of multiprocessors, and drawn considerable attention to supercomputing, In this paper, we investigate the routing of a message i recursive circulant, that is a key to the performance of this network. On recursive circulant network, we would like to transmit m packets from a source node to a destination node simultaneously along paths, where the ith packet will traverse along the ith path $(o{\leq}i{\leq}m-1)$. In oder for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of $(n{\times}n)$ matrices, we present $O(n^2)$ parallel routing algorithm on recursive circulant network.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.131-134
• /
• 2008

A Mobile Ad hoc NETwork(MANET) is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies. In the highly dynamic environment of MANET, energy efficiency is an important performance measure since it directly affects the network lifetime. The failure of energy severely impacts a communications system in crucial communications environments, such as disasters salvage. In this study, we propose a new packet switching routing that can increase the durability of the energy resource and therefore, the lifetime of the mobile nodes and MANET. The performance of the packet switching routing on the node-disjoint multipath and that of AODV are compared by NS2 simulation. The simulation results indicate that this new switching routing can extend the lifetime of a MANET.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.949-956
• /
• 1999

이 논문에서는 ATM (Asynchronous Transfer Mode) 방식의 초고속망의 장애 발생 시 이용자 연결의 QoS (Quality of Service)를 고려하여 복구할 수 있게 하는 보호 망 설계 방안을 제시한다. 제시한 설계 방안에 기초한 비용과 복구 특성을 분석과 모의 실험을 통해 알아본다. 제안하는 망에서의 복구는 분리 VP 그룹 (Disjoint Virtual Path Group, DVPG) 을 사용하는 상태 독립적 (State- independent) 방식으로 복구된다. ATM 망의 운용 및 보호 VP 할당과 용량 배정 문제를 정의하고 이를 바탕으로 최소의 비용을 갖는 VP 망을 설계한다. 망의 고장 시 기존 노드간의 VP 연결은 미리 할당된 링크 또는 노드 분리 보호 VP 경로를 따라 간단한 복구 알고리즘에 의해 빠르게 복구된다. QoS의 고려는 추가 비용을 필요로 하지만 정확한 이용자 연결의 복구를 실현하며, 분리 VP 그룹의 적용은 비용을 상승시키지만, 빠른 복구와 복수의 고장에 대처할 수 있는 방안이 된다.Abstract A cost evaluation of protection scheme for VP-based ATM network is presented here and its related characteristics are evaluated. The proposed and evaluated scheme is a state-independent restoration scheme using a disjoint path group. For fast and simple restoration of failed connections, link disjoint or node disjoint VP groups (DVPG) were utilized in this paper. A VP assignment and capacity planning problem is formulated. When failure occurs, the failed working VPs are switched to the protection VPs of disjoint path groups with a simple restoration scheme. And, cost evaluation and restoration characteristics are presented. The consideration of multiple QoS (Quality of Service) levels and disjoint path group protection scheme require additional network cost but acquire fit and fast restoration.