• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.57-72
• /
• 2016

To provide effective communication in the wireless mesh network (WMN), several algorithms have been proposed. Since the possibilities of numerous failures always exist during communication, resiliency has been proven to be an important aspect for WMN to recover from these failures. In general, resiliency is the diligence of the reliability and availability in network. Several types of resiliency based routing algorithms have been proposed (i.e., Resilient Multicast, ROMER, etc.). Resilient Multicast establishes a two-node disjoint path and ROMER uses a credit-based approach to provide resiliency in the network. However, these proposed approaches have some disadvantages in terms of network throughput and network congestion. Previously, the buffer based routing (BBR) approach has been proposed to overcome these disadvantages. We proved earlier that BBR is more efficient in regards to w.r.t throughput, network performance, and reliability. In this paper, we consider the node/link failure issues and analogous performance of BBR. For these items we have proposed a resilient packet transmission (RPT) algorithm as a remedy for BBR during these types of failures. We also share the comparative performance analysis of previous approaches as compared to our proposed approach. Network throughput, network congestion, and resiliency against node/link failure are particular performance metrics that are examined over different sized WMNs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4720-4738
• /
• 2015

Proper management on user-driven virtual circuits (VCs) is essential for seamless operation of virtual networks. The Network Provisioning System (NPS) is useful software for creating user-driven VCs automatically and must take fault management into account for physical layer impairments on user-driven VCs. This paper addresses a user-driven and trusty protection management in an NPS with an open standard Network Service Interface (NSI), as a contribution to show how to implement the user-driven and trusty protection management required for user-driven VCs. In particular, it provides a RESTful web service Interface for Configuration and Event management (RICE) that enable management of a distinguished data and control plane VC status between Network Service Agents (NSAs) in the event of a node or link fault and repair in a domain. This capability represents a contribution to show how network and protection events in a domain can be monitored between NSAs (NPSs with the NSI) in multiple domains. The implemented NPS controls and manages both the primary and backup VC with disjoint path in a user-driven manner. A demonstration to verify RICE API's capability is addressed for the trusty protection in the dynamic VC network.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1756-1769
• /
• 1999

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1340-1343
• /
• 2009

본 논문에서는 센서 노드의 고장에도 신뢰성있는 데이터 전송을 위해 위치 기반 k-독립경로 라우팅 알고리즘을 제안한다. 제안 라우팅 알고리즘은 센서 노드의 랜덤 고장률을 고려하여 독립경로의 수(k)를 결정하고, 구역고장으로 인한 데이터 전달률의 저하를 최소화하기 위해 노드의 위치를 바탕으로 k-독립경로를 지리적으로 분산하여 생성한다. 데이터 변동률을 이용하여 중요이벤트의 발생유무를 판단하고, 중요이벤트 발생시에는 k-독립경로를 통해 메시지를 전송함으로써 데이터 전달률을 높이고, 보통 이벤트일 때는 단일경로로 메시지를 전송함으로써 에너지 소모를 줄인다. 성능평가를 통해 제안하는 위치기반의 k-독립경올 라우팅 알고리즘은 에너지 효율이 높고, 중요이벤트의 데이터 전달률이 높음을 알 수 있었다. 특히, 구역 고장에 대해 다른 라우팅 알고리즘에 비해 훨씬 높은 견고함을 보였다.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.218-225
• /
• 2007

As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4343-4355
• /
• 2014

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD（Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.12
• /
• pp.819-829
• /
• 2020

This empirical research is aimed at testing the relationship of the big five personality traits namely openness to experience, extraversion, consciousness, agreeableness, neuroticism, and risk aversion with the investment intention of individual investors belonging to Balochistan, Pakistan. The primary data is collected through a self-administered questionnaire (a structured form that consists of a series of closed-ended and open-ended questions) from a sample of 397 active individual investors belonging to different districts of the province. The data is empirically analyzed by applying the Partial Least Square (PLS) path modeling technique by using the estimation package available in Smart-PLS. The findings of this study suggest that all the variables are statistically significant with investors' investment intention with risk aversion as the strongest predictor. Moreover, openness to experience, extraversion, consciousness, agreeableness, and risk are significantly and positively related to an investor's investment intention, whereas neuroticism is negatively related to an investor's investment intention. The results extended by this study can be used by financial planners and investment bankers to channelize the available financial resources in diversified portfolios. The results will help financial planners to make available diverse investment alternatives for investors in Balochistan, thus catering to their unique needs. Academia must offer courses on contemporary finance paradigm based on behavioral finance to enable future business graduates to make wise financial decisions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1031-1038
• /
• 2005

As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of my existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an interconnection scheme between the wireless ad-hoc network environment based on multiple path source routing protocol and a Mobile-IP based network environment. This scheme reduces the overhead of route re-establishment and re-registration by maintaining multiple paths between the mobile host in wireless ad-hoc network and the base station in mobile-IP network. Also it puts the base station in charge of function that performs translation between wireless ad-hoc network packets and Mobile-IP packets, reducing the load of mobile hosts. In this paper, our simulations show that our scheme outperforms existing interconnecting schemes with regards to throughput and end-to-end delay Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.