• 대한전자공학회논문지
• /
• 제26권10호
• /
• pp.1598-1605
• /
• 1989

This paper describes an efficient global cell (module) placement strategy called HALO (Hierarchical Alternating Linear Ordering)which generates global 2-D placement of circuit modules by hierarchical application of linear ordering in alternating direction. We tried, in principle, to explain why HALO should perform better than other typical, somehat successful, analytical approaches such as min-cut, force-directed relaxation(FDR)or its likes. We have implemented HALO as a program for standard cell placement. Experimental results on two benchmark circuits, primary and primary 2 consisting of 752 and 2907 cells, respectively have shown a decrease of half-perimeter routing length by 7% and 24%, respectively compared to the best available results obtained so far. Total CPU time including the following detailed placement was less than half of the earlier work.

• International Journal of Computer Science & Network Security
• /
• 제21권12spc호
• /
• pp.443-450
• /
• 2021

The study is devoted to the formation of a economic principles cargo delivery management in global supply chains. Mathematical model of delivering special categories of goods by road is a key element of these principles. The article analyzes the existing studies on solving the problem of cargo delivery in various aspects. It was noted that the greatest attention is paid to legal regulation, last mile delivery, optimization of routes and delivery schemes, information support, technological innovations, cluster routing, etc. In the developed mathematical model a minimum of total costs of forming loading units and freight shipments was defined as the criterion of optimality of organizing delivery by motor transport. The authors propose the creation of logistics clusters allowing the integration of urban transport flows and global supply chains.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.116-125
• /
• 2019

The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

• 센서학회지
• /
• 제21권1호
• /
• pp.46-52
• /
• 2012

The rapid water pollution in stream, river, lake and sea in recent years raises an urgent need for continuous monitoring and policymaking to conserve the global clean environment. In particular, the increasing water pollution in coastal marine areas adds to the importance of the environmental monitoring systems. In this paper, the mobile server is designed to gathers information of the water quality at coastal areas. The obtained data by the server is transmitted from field servers to the base station via multi-hop communication in wireless sensor network. The information collected includes dissolved oxygen(DO), hydrogen ion exponent(pH), temperature, etc. By the information provided the real-time monitoring of water quality at the coastal marine area. In addition, wireless sensor network-based flooding routing protocol was designed and used to transfer the measured water quality information efficiently. Telosb sensor node is programmed using nesC language in TinyOS platform for small scale wireless sensor network monitoring from a remote server.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.490-498
• /
• 2007

BGP route flap damping(RFD) was anecdotally considered to be a key contributor to the stability of the global Internet inter-domain routing system. However, it was recently shown that RFD can incorrectly suppress for substantially long periods of time relatively stable routes, i.e., routes that only fail occasionally. This phenomenon can be attributed to the complex interaction between BGP path exploration and how the RFD algorithm identifies route flaps. In this paper we identify a distinct characteristic of BGP path exploration following a single network event such as a link or router failure. Based on this characteristic, we distinguish BGP route updates during BGP path exploration from route flaps and propose a novel BGP route flap damping algorithm, RFD+. RFD+ has a number of attractive properties in improving Internet routing stability. In particular, it can correctly suppress persistent route flaps without affecting routes that only fail occasionally. In addition to presenting the new algorithm and analyzing its properties, we also perform simulation studies to illustrate the performance of the algorithm.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2006년도 춘계학술발표대회
• /
• pp.1037-1040
• /
• 2006

This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

• 전자공학회논문지A
• /
• 제28A권9호
• /
• pp.761-773
• /
• 1991

In this paper, an algorithm for automatic schematic generation which creates schematic diagram from netlist are proposed. The important objectives on schematic generation are readability and clarity of resulting schematics. Each stage of generation should aim at enhancing these objectives. For this reason, schematic generation problem is divided into 5 subproblems` preprocessing, logical placement, pin assignment and improvement of placement, global routing, and detailed routing. The algorithm is implemented in C language, and it generates schematics from the results of logic synthesis in order to make it east for designers to understand the design and reflect their knowledge into design.

• 융합보안논문지
• /
• 제9권4호
• /
• pp.35-41
• /
• 2009

현재 인터넷에서 사용중인 라우팅 프로토콜 중 대표적인 프로토콜인 기존의 BGP 프로토콜의 보안을 강화하는 연구들의 비교를 통해 BGP 프로토콜에 문제점으로 부각되고 있는 AS-Path, IP Fake, DRDoS 등의 BGP 프로토콜을 사용할 때 반드시 필요한 정보이지만 악의적인 공격 또는 잘못된 설정으로 인해 전세계 인터넷 망을 동작하지 못하게 할 수 있는 위협적인 사항에 대한 보안성에 대해 분석한다.

• 지식정보인프라
• /
• 통권7호
• /
• pp.141-148
• /
• 2001

This paper describes a mechanisms for IPv6 multihomming with loadsharing broker, focusing on the interdomain scalability and load sharing with redundancy on IPv6 networks. Unlike currently-practiced IPv4 multihoming, this model does not impact the worldwide routing table size, also it provides inbound load sharing at site level based on router renumbering, and multiple-prefix assigning techniques of IPv6. The proposed model has four modules such as building interfaces MIB module, priority list maintaining module, load detection module, and RRP configuration module.

• 한국통신학회논문지
• /
• 제35권6A호
• /
• pp.585-593
• /
• 2010

위치 기반 라우팅은 데이터 패킷을 전송하기 위해 네트워크 전역의 토폴로지 정보 대신 순수하게 위치 정보만을 사용하기 때문에 무선 센서 네트워크에서 효과적이고 간단하며 확장성 있는 라우팅 프로토콜로 인식되어 왔다. 위치 기반 라우팅에서 소스 노드는 싱크의 위치 정보를 알고 있어야 한다. 대부분의 기존 위치 기반 라우팅 프로토콜들은 단순히 소스 노드가 싱크의 위치를 알고 있다고 가정하여 싱크 위치 획득 과정을 자세히 다루지 않았다. 본 논문에서는 무선 센서 네트워크에서 위치 기반 라우팅을 위한 원형 경로 기반 싱크 위치 서비스를 제안한다. 이 방안에서, 싱크는 원형 경로를 따라 싱크 위치 알림 메시지를 전송하고 소스는 그 원형 경로를 반드시 지나는 직선 경로를 따라 싱크 위치 질의 메시지를 전송함으로써 두 메시지의 교차점을 보장한다. 교차점에 위치한 노드는 소스 노드에게 싱크의 위치를 알린다. 제안 방안은 간단한 규칙을 통해 일정하지 않은 외곽 혹은 홀과 같은 불규칙성을 갖는 센서 네트워크에서도 문제없이 동작할 수 있다. 시뮬레이션 결과는 제안 방안이 에너지 소비와 제어 부하 측면에서 다른 방안들에 비해 우수함을 보여준다.