• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.972-984
• /
• 2003

In this paper, new on-line routing algorithms with a bandwidth constraint are proposed. The proposed algorithms may be used for a dynamic LSP setup in MPLS network. We extend the WSP algorithm, the SWP algorithm and a utilization-based routing algorithm into the proposed algorithms by slightly modified K-shortest loopless path algorithms. The performances such as accepted bandwidth, accepted request number and average path length of the proposed and the previous algorithms are evaluated through extensive simulations. All simulations are conducted under the condition that any node can be an ingress or egress node for a LSP setup. The simulation results show that the proposed algorithms have the good performances in most cases in comparison to the previous algorithms. Under the heavy load condition, the algorithms based on the minimum hop path perform better than any other algorithms.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.34-42
• /
• 2012

This paper analyses the energy saving basic power models in core IP networks, and proposes the adaptive buffer and burst scheme which is a possible energy saving method, and its implementation algorithm in core IP networks. Especially this paper describes the adaptive buffer and burst scheme dynamically varying the buffering interval B according to the input traffic volume of ingress router, and explains the operation principle of proposed scheme. This method is to adjust the buffering interval B according to input traffic volume of ingress router, that is increasing the interval B when input traffic volume is low, and decreasing the interval B when input traffic volume is high between some given interval regions. This method can gets the high energy saving effect as decreasing the transition number of idle/active in networks when input traffic volume is low, and decreasing the transition number of idle/active by the continuous of burst packets in transit router when input traffic volume is high. This paper shows the increasing of asleep rate for the energy saving of core IP networks and confirms the energy saving of core IP networks by the computer simulation. We confirmed that proposed method can be save the energy of IP networks by properly trade off network performances.

• IE interfaces
• /
• v.14 no.3
• /
• pp.263-271
• /
• 2001

MPLS LER is located at the boundary of MPLS domain as an ingress or an egress router and plays a role in connecting with the existing Internet. Among the components of the MPLS LER, forwarding engine(FE) is a key device which assigns a label to an IP packet by analyzing the destination address of its header in order to enter the MPLS domain, or restructures the cells from MPLS domain into IP packet by reversely processing. In this paper, we investigate the design of FE by analyzing the traffic performance of its components and estimate the IP packet processing capacity of a FE using queueing model and simulation. It is found that the maximum IP packet processing capacity of the Forwarding Engine is about 150,000 packets/sec.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.612-620
• /
• 2011

Recently, one of the problems with the Internet is the issue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without predetermined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a revised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better network performance.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• Journal of Korean Academy of Fundamentals of Nursing
• /
• v.6 no.3
• /
• pp.522-531
• /
• 1999

This research identifies the ingress to egress primary factors that causes a patient to receive delayed emergency medical care. This material was collected between February 1st to 28th, 1998. Research envolved 4,118 people who visited the college emergency medical center in Kyeongido Province, South Korea. Medical records were examined, using the retrospective method. to determine the length of stay and the main cause for waiting. Results are as follows : 1. The age group with the highest admission rate was 10 and under, approximately 1,394 (33.9%). Followed by an even distribution for ages between 11-50 at 10-15% for their respective ranges. The lowest admission rate was 50 years and above. 2. From the 4,118 records examined, 3,489 received outpatient treatment (84.7%); 601 were admitted for inpatient care (14.6%); 25 arrived dead on arrival (0.6%); and 4 people died at the hospital. 3. Between 7PM to 12AM, 42.9% were admitted to the EMC. The hours from 9PM to 11PM recorded the highest admission rate and 5AM to 8AM was the lowest From 8PM to 12AM, the most beds were occupied. 4. For most patients. the average length of stay was approximately 2.2 hours. By medical department, external medicine was the longest for 2.8 hours. Pediatrics was the shortest for 1.6 hours. The average waiting period for inpatient admission was 2.6 hours. Inpatient admission for pediatrics and external medicine was 3.4 hours and 2.2 hours respectively. 5. Theses are primary factors for delay at EMC: 1) pronged medical consultations to decide between inpatient versus outpatient treatment, and delaying to be inpatient, 2) when you call physicians they are delayed to come 3) Understaffing during peak or critical hours, 4) Excessive consulting with different medical departments, 5) some patients require longer monitoring periods, 6) medical records are delayed in transit between departments, 7) repeated laboratory tests make delay the result, 8) overcrowded emergency x-ray place causes delay taking x-ray and portable x-ray, 9) the distance between EMC and registration and cashier offices is too far. 10) hard to control patient's family members. The best way to reduce EMC waiting and staying time is by cooperation between departments, both medical and administrative. Each department must work beyond their job description or duty and help each other to provide the best medical service and satisfy the patient needs. The most important answer to shortened the EMC point from ingress to egress is to see things from a patient point of view and begin from there to find the solution.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.9-16
• /
• 2005

A new online routing algerian is proposed in this paper, which use the interference-prediction to solve the network congestion originated from extension of Internet scope and increasing amount of traffic. The end-to-end QoS has to be guaranteed in order to satisfy service level agreements (SLAs) in the integrated networks of next generation. For this purpose, bandwidth is allocated dynamically and effectively, moreover the path selection algorithm is required while considering the network performance. The proposed algorithm predicts the level of how much the amount of current demand interferes the future potential traffic, and then minimizes it. The proposed algorithm considers the bandwidth on demand, link state, and the information about ingress-egress pairs to maximize the network performance and to prevent the waste of the limited resources. In addition, the interference-prediction supports the bandwidth guarantee in dynamic network to accept more requests. In the result, the proposed algorithm performs the effective admission control and QoS routing. In this paper, we analyze the required conditions of routing algorithms, the aspect of recent research, and the representative algorithms to propose the optimized path selection algorithm adequate to Internet franc engineering. Based on these results, we analyze the problems of existing algorithms and propose our algorithm. The simulation shows improved performance by comparing with other algorithms and analyzing them.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.813-826
• /
• 1999

실시간 멀티미디어 응용의 등장으로 멀티캐스트와 QoS(Quality of Service) 지원이 필수적인 망 서비스로 부각되고 있다. 이에, ATM 기반의 인터넷에서 IP 멀티캐스트의 효율적인 처리를 위하여 MARS(Multicast Address Resolution Server)가 제안되었고, 기존의 최선 서비스 기반의 인터넷에서 QoS(Quality of Service)를 지원하기 위하여 RSVP(Resource Reservation Protocol)가 제안되었다. 본 논문에서는 ATM 망에서 QoS가 지원되는 IP 멀티캐스트 서비스를 제공하기 위하여 MARS 구조에서 RSVP를 지원하는 두 가지 방안을 제안하고, 시뮬레이션을 통하여 그 성능을 분석하였다. 제안하는 두 가지 방법은 각각 'RSVP 전 홉 노드 방식'과 'MARS 서버 방식'이라 명명하였다. RSVP 전 홉 노드 방식은 송신원으로부터 ATM 망으로 진입하는 노드와 수신원을 향하여 ATM 망을 진출하는 노드 간에 각각 일대일 양방향 VC를 설정하여 멀티캐스트 그룹에 속하는 수신원들이 보내는 자원 예약 메시지를 ATM 망에서 전송하는 방안이다. MARS 서버 방식은 ATM 망을 진출하는 노드와 MARS 서버간에 MARS 제어 메시지 교환을 위해 존재하는 ATM VC를 사용하여 RSVP의 자원 예약 메시지를 전송하고, MARS 서버가 RSVP 자원 예약 메시지를 처리하도록 그 기능을 확장함으로써 ATM 망에서 필요로 하는 제어 VC 수를 절약할 수 있는 방안이다. 시뮬레이션을 통하여, MARS 서버 방식은 ATM 제어 VC의 수를 절약할 수 있을 뿐 아니라 경우에 따라 RSVP 자원 예약 메시지 전달 지연을 줄일 수도 있음을 볼 수 있었다. 그러나, MARS 클러스터 내에 동시에 존재하는 RSVP 흐름이 많을 때에는 MARS 서버 방식의 경우 MARS 서버에서의 병목 현상으로 인해 성능이 저하될 수 있다.Abstract Emerging real time multimedia applications require multicast service with a QoS(Quality of Service) support. An overlay service architecture MARS(Multicast Address Resolution Server) is proposed to support IP multicast over an ATM network, and a resource reservation protocol RSVP is proposed to provide QoS support in the Internet which is originally based upon best effort service only. In this paper, we propose two schemes to support IP multicast service with QoS support over ATM networks: 'RSVP Previous Hop Node(RPHN) scheme' and 'MARS server based scheme'. In RPHN scheme, the RSVP reservation messages are transported via one-to-one ATM control VC from the egress nodes to the ingress nodes of the the multicast flow set up between each pair of nodes. The RSVP message processing occurs at the ingress nodes of the multicast flow. Whereas, in the MARS server based scheme, the RSVP reservation messages are transported via the MARS control VCs between the egress nodes and the MARS server. The RSVP message processing burden is imposed at MARS server in this scheme. For MARS server based scheme, no additional ATM VC is required for RSVP reservation message transmission, while the processing burden at the MARS server is high. Simulation results show that the MARS server based scheme, may accomplish RSVP reservation message delivery with smaller delay as well as saving of the number of ATM VCs. When the number of simultaneous RSVP flows in the MARS cluster is large, however, MARS based scheme may suffer performance degradation since MARS server becomes a performance bottleneck.

• Journal of Advanced Navigation Technology
• /
• v.26 no.5
• /
• pp.304-311
• /
• 2022

Although the SEAD(suppression to enemy air defenses) mission is a strategically important task in modern warfare, the high risk of direct exposure to enemy air defense assets forces to use of unmanned aerial vehicles. this paper proposes a path planning algorithm for SEAD mission for an unmanned aerial vehicle and a method for calculating the mission effectiveness on the planned path. Based on the RRT-based path planning algorithm, a low-altitude ingress/egress flight path that can consider the enemy's short-range air defense threat was generated. The Dubins path-based Intercept path planning technique was used to generate a path that is the shortest path while avoiding the enemy's short-range anti-aircraft threat as much as possible. The ingress/intercept/egress paths were connected in order. In addition, mission effectiveness consisting of fuel consumption, the survival probability, the time required to perform the mission, and the target destruction probability was calculated based on the generated path. The proposed techniques were verified through a scenario.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.235-245
• /
• 2005

In this paper, a simplified QoS model of MPLS-based backbone network. Conventional scheme proposed by IETF(IETF schem) is to embed a DiffServ model in MPLS network. However, this approach results in overall upgrade of MPLS system and so it is difficult to deploy this approach. Our proposed model, however, uses a Vidual Link which is a set of Label Switched Path(LSP) connected from an Ingress Label Edge Router(LER) to an Egress LER. In this model, Per-Hop-Behavior(PHB) is implemented only at each LSP in ingress LER and Core Label Switch Routers(LSRs) just guarantee each LSP's bandwidth, not service. This bandwidth guarantee service is fully provided by legacy MPLS model. Also we propose flow allocation mechanism and the flow distribution among LSPs of the virtual link by the flow according to the network status. To evaluate the simplified approach, the characteristics of the approach are compared logically with these of IETF's one through simulations.