• 전자공학회논문지S
• /
• 제34S권2호
• /
• pp.11-20
• /
• 1997

It is a recent trend that mobile communications and PCS are intergrated into the broadband network. Broadband mutlimedia traffic will be transported over the integrated network. In this paper, we propose a connection re-routing method for fast inter-switch hadoffs and dynamic resurce reservation scheme, which is based on the proposed re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing, the proposed re-routing method is to reserve VPI/VCIs for possible inter-swich handoff calls in advance. Our reservation scheme is to statistically reserve the fixed resources for possible inter-switch handoff calls, according to the QoS of the handoff calls. The simmulation reslts show that our proposed scheme satisfies the required QoS of handoff calls and keep the dropping probability of handoff calls lower than other schemes.

• 대한전자공학회논문지TC
• /
• 제37권1호
• /
• pp.23-31
• /
• 2000

본 논문에서는 무선망에서의 유연성 있는 핸드오버 기법을 제안한다. 제안하는 핸드오버 기법은 가상연결 재 라우팅 기법과 가상연결 확장 기법의 장점들을 이용한 혼합방식이다. 기존의 혼합방식이 망의 구조에 의해 어느 한 기법이 결정되었던 것에 비해 제안하는 방식에서는 서비스의 특성에 따라 그 기법이 결정된다. 또한 가상연결 재 라우팅 기법 적용 시 멀티캐스팅 기법을 활용한 자원예약 방식을 통해 서비스의 끊김 현상과 핸드오버 지연을 최소화할 수 있는 방안을 제시한다. 본 논문에서는 성능분석을 위해 핸드오버를 위해 필요한 시그널링 메시지 수를 분석하고 시뮬레이션을 수행한다. 시뮬레이션 결과는 기존 핸드오버 기법들에 비해 제안하는 기법이 핸드오버 지연 및 서비스 품질보장 측면에서 보다 우수한 성능을 가짐을 보인다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.