• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.99-108
• /
• 2001

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum load on the ring. The fastest a1gorithm to date is Myung, Kim and Tcha＇s a1gorithm that runs in Ο(n｜K｜) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha＇s a1gorithm arid runs in Ο(min{n｜K｜, n$^2$}) time.

• Korean Journal of Human Ecology
• /
• v.24 no.1
• /
• pp.49-67
• /
• 2015

The study aims to review airline services like the domestic line performance, the general flight fares and website discount fairs, reservation cancellation and cancellation charges, reroutings and personal discount system of the low cost carriers(LCC), and suggest what needs to be done to improve the airline service. The improvements to be made by the LCC should include increasing regular domestic lines, providing information compared for consumers, relieving the toll to call the service center, revising the conditions on reservation cancellation penalty, rerouting charges, revising the consumer dispute resolution standards, and promoting frequent fliers program. Development strategies should be established that can boost consumer benefits through the improvement of the airline services.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.10
• /
• pp.49-56
• /
• 1992

A new global routing algorithm which dynamically adjusts its cost parameters depending on the given routing poroblem to find a near optimum solution has been developed. The proposed algorithm efficiently performs global routing on general area in which all the pin positions are given. This algorithm is composed of two phases`In the first phase, it routes each net by searching a minimum cost path while ignoring the channel capacity. In the second iterative phase, it rips up nets which pass the channel at which the horizontal or vertical routing density exceeds the capacity and then it reroutes them using a modified set of cost parameters. Applying the above phases, paths for nets are found such that routing density doesn't exceed the capacity in each channel and that nets are routed with minimum cost. Experimental results for several benchmark examples including difficult-4, difficult-8, difficult-16, Primary1 and Primary2 show that our method generates better results than other published ones.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1098-1100
• /
• 2002

Inter-RNC(radio network controller) and inter-BSC(base station center) hard handovers involve rerouting. Thus additional delay time for the new bearer setup and reroute determination should be considered. For theses kinds of handovers we propose a new scheme and coined it as ICHP(Inter-Cluster Handover Prediction). When a call approaches a boundary cell of a cluster, ICHP prepares for the handover by performing resource reservations and reroute computation in advance. Performance analysis shows that ICHP provides faster handover and that it lowers the blocking probability.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1057-1063
• /
• 1995

This paper describes an approach for constucting a Rectilinear Steiner Tree (RST) derivable from a Minimum Spanning Tree (MST), using Associative Processor (AP). We propose a fast parallel algorithm using AP's basic algorithms which can be realized by the processing capability of rudimentary logic and the selective matching capability of Content- Addressable Memory (CAM). The main idea behind the proposed algorithm is to maximize the overlaps between the consecutive edges in MST, thus minimizing the cost of a RST. An efficient parallel linear algorithm with O(n) complexity to construct a RST is proposed using an algorithm to find a MST, where n is the number of nodes. A node insertion method is introduced to allow the Z-type layout. The routing process which only depends on the neighbor edges and the no-rerouting strategy both help to speed up finding a RST.

• Journal of Chest Surgery
• /
• v.33 no.3
• /
• pp.262-264
• /
• 2000

We report a successful biventricular repair of D-transposition of great arteries, pulmonary stenosis and remote muscular inlet ventricular septal defect, after modifie Blalock-Taussing shunt early in infant. A long left ventricle-to-aorta intraventricular rerouting tunnel was created without stenosis by transferring the medial papillary muscle of the tricuspid valve to the tunnel, obliterating the trabeculation of right ventricle in the course of tunnel and excising the secondary chordae of the tricuspid valve.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.341-344
• /
• 2001

H.323 proposes to use Mobile IP and H.323 ad hoc conference signaling to provide Handoff function to an H.323 mobile terminal. But the H.323 ad hoc conference signaling has a drawback. It requires an H.323 terminal to do a complex conference signaling which takes a longer signaling time. In this paper, we propose an GK architecture that provides Handoff function effectively using 3$^{rd}$ P'||'||'||'||'||'&'||'||'||'||'||'R(Third party initiated Pause and Rerouting) signaling which are done through H.245 logical channel. The GK which is implementing 3$^{rd}$ P'||'||'||'||'||'&'||'||'||'||'||'R signaling only requires an H.323 endpoint to do the H.323 basic signaling in reestablishing media channel and gives the faster Handoff signaling. To do this, our GK has derived H.245 control channel using tunneling f3r all H.323 calls including the fast connect calls which enable terminals communicate each other if they doesn't have H.245 control channel .municate each other if they doesn't have H.245 control channel .

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.414-416
• /
• 1999

무선 ATM은 무선 멀티미디어 서비스를 종단간 ATM 기술로 제공하는 전송방식으로 최근에 그 요구가 급증하여 단말기의 개발과 보급이 폭증하고 있다. 이에 따라 사용자 및 전송용량의 증가로 인하여 셀의 크기가 작아지게 되고 더 많은 핸드오프가 발생하게 되는데, 좀 더 빠르고 망 자원을 보다 효율적으로 이용하도록 하기 위한 기법들에 대한 연구가 증대되고 있다. 본 논문에서는 보다 빠른 핸드오프를 위하여 사용되어지는 여러 가지 routing 방법들 중 단말기가 접속된 기지국이 바뀔 경우 VC(Victual Connection)를 재설정하는 방식인 Path Extension과 Path Rerouting을 사용하여 LAN 환경에서 해당 MSC에 속한 BS의 개수에 따라 어떠한 VC path length와 receive latencies를 나타내는지 비교하여 핸드오프 지연이 보다 적은 기법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.566-568
• /
• 1999

현재는 데이터 통신망이 음성 통신망을 흡수하는 단계이다. 데이터 망이 기존의 음성 망이 가지는 영역을 포함하면서 광범위하게 활용되면서 앞으로 그 범위는 더욱 넓어질 것이다. 현재 급속히 팽창하고 있는 인터넷도 데이터 통신망이 진일보 하는데 커다란 역할을 하고 있다. 기존의 연결 지향형 방식의 패킷 통신과 달리 인터넷이 주로 비연결형 방식의 IP를 사용하기 때문에 새로운 개념의 데이터 전송이 요구되고 있다. 이러한 요구들로 인해 ATM, Gigabit Router, MPLS 등이 출현하게 되었고 현재는 MPLS가 가장 적합한 해결책으로 제시되고 있다. IETF 역시 이러한 MLS에 대한 표준안을 준비하고 있다. 이곳에서는 많은 장점을 가지는 MPLS(MultiProtocol Label Switch)망에서의 명령어 그리고 타이머를 가지는 레이블 예약방식의 경로 재설정 알고리즘을 제시한다. 방법은 경로 재설정시간을 단축하고 트래픽의 적절한 분배를 통하여 네트워크의 부하를 줄인다.

• Journal of Chest Surgery
• /
• v.37 no.1
• /
• pp.76-79
• /
• 2004

The remote location of VSD relative to the aortic valve imposes considerable surgical difficulties in the repair of DORV with noncommitted VSD. We report a successful biventricular repair of the anomaly with VSD rerouting to pulmonary artery followed by arterial switching operation.