• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권2호
• /
• pp.244-253
• /
• 2000

병렬 컴퓨터의 메시지 전달에서 응용에 관계없이 일반적으로 우수한 경로 지정 및 스위칭 정책은 존재하지 않으므로, 사용자가 응용에 따라서 정책을 변경할 수 있게 하는 것이 바람직하다. 본 논문에서는 마이크로프로세서 구조에 기초한 경로 지정 엔진과는 달리, 성능의 감소 없이 융통성 있는 경로 지정과 스위칭 기능을 수행할 수 있는 조견표(look-up table) 경로 지정 엔진의 구현에 대하여 기술한다. 제안된 경로 지정 엔진은 조견표의 내용을 바꿈으로써 웜홀(wormhole), 가상 컷스루우(virtual cut-through) 및 패킷 스위칭(packet switching) 등은 물론, 다양한 경로 지정 알고리즘의 혼성(hybride)스위칭을 구현할 수 있다. 경로 지정 엔진의 조견표는 파이프라인 구조로 되어 있어, 하나의 플릿(flit) 정도의 저 지연을 가지므로, 단일 경로 지정 및 스위칭 정책을 하드와이어(hardwired)로 구현한 경우 보다 큰 성능의 감소 없이 다중의 경로 지정 동작을 중첩할 수 있다. 제안된 4개의 파이프 라인단은 해저드(hazard)를 일으키지 않으므로, 고 비용의 포워딩(forwarding) 회로가 필요 없다. 경로 지정 엔진은 시간공유의 컷스루우 버스나 크로스바(crossbar) 스위치를 갖는 단일 경로로 되어 있는 4개의 물리적 경로를수용할 수 있다. 제안된 경로 지정 엔진은 Xilinx 4000XL 시리즈 FPGA를 사용하여 구현되었다.

• 대한산업공학회지
• /
• 제20권2호
• /
• pp.19-30
• /
• 1994

Generally, a planning problem in a flexible manufacturing system is considered to be a composite of three interdependent tasks : part selection, loading, and routing mix. This research presents a mathematical model which can concurrently solve part selection, loading, and routing mix problems, so the problems that are caused by treating the planning problems independently are solved. The mathematical model is aimed to minimize system unbalance and the number of late parts, including constraints such as machine capacity, tool magazine capacity, and tool inventory. To illustrate the application of the model, an example is included. Solution procedure based on Lagrangian relaxation is also suggested for larger-sized problems.

• 한국경영과학회지
• /
• 제29권4호
• /
• pp.175-187
• /
• 2004

We consider the simultaneous selection of part routes for multiple part types in Flexible Manufacturing Systems (FMSs). Using an optimization framework we investigate two alternative route assignment policies. The one, called routing mix policy in the literature, specifies the optimal proportion of each part type to be produced along its alternative routes, assuming that the proportions can be kept during execution. The other one, which we propose and call pallet allocation policy, partitions the pallets assigned to each part type among the routes. The optimization framework used is a nonlinear programming superimposed on a closed queueing network model of an FMS which produces multiple part types with distinct repeated visits to certain workstations. The objective is to maximize the weighted throughput. Our study shows that the simultaneous use of multiple routes leads to reduced bottleneck utilization, improved workload balance, and a significant increase in the FMS's weighted throughput, without any additional capital investments. Based on numerical work, we also conjecture that pallet allocation policy is more robust than routing mix policy, operationally easier to implement, and may yield higher revenues.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3369-3385
• /
• 2019

There are various research challenges in vehicular ad hoc networks (VANETs) that need to be focused until an extensive deployment of it becomes conceivable. Design and development of a scalable routing algorithm for VANETs is one of the critical issue due to frequent path disruptions caused by the vehicle's mobility. This study aims to provide a novel road-aware routing protocol for vehicular networks named as Two-level hierarchical Hybrid Road-Aware (THERA) routing for vehicular ad hoc networks. The proposed protocol is designed explicitly for inter-vehicle communication. In THERA, roads are distributed into non-overlapping road segments to reduce the routing overhead. Unlike other protocols, discovery process does not flood the network with packet broadcasts. Instead, THERA uses the concept of Gateway Vehicles (GV) for the discovery process. In addition, a route between source and destination is flexible to changing topology, as THERA only requires road segment ID and destination ID for the communication. Furthermore, Road-Aware routing reduces the traffic congestion, bypasses the single point of failure, and facilitates the network management. Finally yet importantly, this paper also proposes a probabilistical model to estimate a path duration for each road segment using the highway mobility model. The flexibility of the proposed protocol is evaluated by performing extensive simulations in NS3. We have used SUMO simulator to generate real time vehicular traffic on the roads of Gangnam, South Korea. Comparative analysis of the results confirm that routing overhead for maintaining the network topology is smaller than few previously proposed routing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.719-728
• /
• 1997

In the AGV routing a vehicle can select the shortest route on which no conflicts are anticipated. The procedure includes time constraint and the node/arc occupation times of vehicles in order to locate the conflicting paths. The slight differences among AGV routing algorithms exist in identifying the conflict regions encountered while reaching out to the destination node. In this paper, a novel approach to the use of the re-routing scheme is presented. It will be used to minimize the travel distance of vehicles in a regular vehicle routing process rather than to cope with emergency situations. The proposed algorithm provides existing active vehicles with the ability of changing their current paths for a new vehicle whenever the equal-distance paths exist, in on attempt to optimize the AGV transportation system. This ability is possible because of the flexibility of on AGV system controlled by a computer system.

• 한국정보처리학회논문지
• /
• 제6권11S호
• /
• pp.3229-3242
• /
• 1999

At recent, the Internet is evolving into the directions which is capable of incorporating stream-type services such as voice and video services due to the remarkable growth of WWW service and the development of new multimedia application services. However, the existing Internet can only support a best-effort delivery model and thus it is difficult to satisfy these requirements as well as to provide the QoS beyond a certain degree. Accordingly, it is imperative to develop QoS-based routing algorithm in order to allow flexible routing by the Internet user's QoS demand and to be applied into wide area networks. In this paper, we presented new routing algorithms for next generation Internet services and made performance evaluations. The proposed algorithms allow the routing by the user's QoS demand level in order to provide the diverse Internet application services based on ATM network environment that is expected to play a role as an infrastructure of next Generation Internet Services.

• Journal of Communications and Networks
• /
• 제8권4호
• /
• pp.422-431
• /
• 2006

This paper proposes an adaptive routing protocol called ARCA for converged ad-hoc and cellular network (CACN). Due to the limitation of both bandwidth and transmission range in a cell, a mobile host (MH) may not be able to make a call during busy time. CACN offers a flexible traffic diversion mechanism that allows a MH to use the bandwidth in another cell to ease the congestion problem and increase the throughput in a cellular network. Based on the presentation of CACN's physical characteristics, the paper details the design issues and operation of the adaptive routing protocol for CACN (ARCA). Detailed numerical analysis is presented in terms of both route request rejection rate and routing overhead, which, along with the simulation results, have indicated the effectiveness and efficiency of the ARCA protocol.

• International Journal of Computer Science & Network Security
• /
• 제22권6호
• /
• pp.139-144
• /
• 2022

Technological advancements taken the health care industry by a storm by embedding sensors in human body to measure their vitals. These smart solutions provide better and flexible health care to patients, and also easy monitoring for the medical practitioners. However, these innovative solutions provide their own set of challenges. The major challenge faced by embedding sensors in body is the issue of lack of infinite energy source. This work presents a meta-heuristic based routing model using modified PSO, and adopts an energy harvesting scheme to improve the network lifetime. The routing process is governed by modifying the fitness function of PSO to include charge, temperature and other vital factors required for node selection. A reactive routing model is adopted to ensure reliable packet delivery. Experiments have been performed and comparisons indicate that the proposed Energy Harvesting and Modified PSO (EHMP) model demonstrates low overhead, higher network lifetime and better network stability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.2936-2951
• /
• 2016

An emerging satellite technology, Operationally Responsive Space (ORS) is expected to provide a fast and flexible solution for emergency response, such as target tracking, dense earth observation, communicate relaying and so on. To realize large distance transmission, we propose the use of available relay satellites as relay nodes. Accordingly, we apply software defined network (SDN) technology to ORS networks. We additionally propose a satellite network architecture refered to as the SDN-based ORS-Satellite (Sat) networking scheme (SDOS). To overcome the issures of node failures and dynamic topology changes of satellite networks, we combine centralized and distributed routing mechanisms and propose a fast recovery routing algorithm (FRA) for SDOS. In this routing method, we use centralized routing as the base mode.The distributed opportunistic routing starts when node failures or congestion occur. The performance of the proposed routing method was validated through extensive computer simulations.The results demonstrate that the method is effective in terms of resoving low end-to-end delay, jitter and packet drops.