• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.9-25
• /
• 1997

Personal Communication Networks will be composed of ATM-based broadband ISDN in the future. However, unlike the wired networks, many challenges will arise in the wireless communication service such as PCS. These callenges are frequency alteration of cell routing path, relatively very high error rate at transmission over the wireless interface, etc. Particularly, the alteration of cell routing path caused by handoff makes temporary deterioration of QoS. In this paper, the signaling flows of handoff scenarios which may occur on Personal Communication Networks are presented, and verified by Pertri-Net toolkit. In addition, the cell flow control scheme which minimizes the lagging gap between cells and maintains the cell sequence during handoff is proposed. The proposed scheme can be summarized as the differentiation of normal queue and handoff queue, and the cell flow control between these queues. For verification of the proposed scheme, we used two approaches, which are mathermatical manipulation and SLAM simulation.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.39-51
• /
• 1998

In this paper, we propose signaling procedures amon network elements for a connection rerouting method which can reduce inter-switch handoff processing delay reduces the delay in the connection re-routing by reserving VPI/VCIs for possible inter-switch handoff calls in advance. Additionally, we mathematically analyze the signaling procedures and then suggest solutions to the relations with cluser size, network topoloty, handoff-request rete and handoff delay. With simulation, the solutions are validated. From numerical examples, we concluded taht handoff delay, one of the handoff QoSs, can be satisfied by adjusting the cluster size and network topology according to the handoff -request rate of service area. With our proposed signaling and analytic methods, we concluded that the connection rerouting method using cluster-sectoring effectively reduces the delay of inter-switch handoff processing than dynamic connection rerouting method. Our solutions are useful in guaranteeing the requested handoff delay (especially, inter-switch handoff delay) when the connection rerouting method is applied to ATM-based wireless/wired integrated network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9A
• /
• pp.1563-1573
• /
• 2001

본 논문에서는 무선 ATM 망에서 멀티 서비스 클래스를 지원하기 위하여 핸드오프로 인한 이동 특성과 호 수준의 QoS를 고려한 동적 무선 자원 관리 기법을 제안하였다. 제안한 기법은 무선 자원을 우선적으로 핸드오프 호에게 할당하고 새로운 호에게도 서비스 확률에 의하여 동적으로 자원을 할당하도록 한다. 서비스 확률은 전체 무선 대역폭, 임계값, 사용중인 무선 대역폭, 이동 특성, 그리고 서비스 클래스별 조정값을 이용하여 동적으로 결정된다. 또한 제안한 기법의 성능을 평가하기 위해 수학적 분석을 실시하였고 핸드오프 호의 강제 종료 확률, 새로운 호의 블록킹 확률, 자원 이용률 관점에서 기존의 기법과 비교하였다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1071-1074
• /
• 2000

본 연구는 멀티미디어 트래픽의 하나인 VBR(Variable Bit Rate) 서비스를 위한 무선 단말기의 효율적인 채널 사용을 위한 무선 ATM MAC(Medium Access Control) 프로토콜에 관한 연구이다. 현재 유선망에서는 멀티미디어 서비스를 위하여 ATM 기술을 사용하고 있기 때문에 유무선망의 통합을 위한 ATM 무선망의 설계가 대두되고 있다. 이를 위해서는 무선망이 가지는 대역폭의 한계와 링크의 높은 에러율을 극복하기 위해서 효율적인 MAC 알고리즘 개발이 필요하다. 본 논문에서는 무선 ATM망에서 VBR 트래픽 소스를 갖는 단말기의 QoS를 보장하고 채널 사용의 효율을 높이기 위하여 신경망을 이용한 Neural DSA(Dynamic Slot Assignment) 알고리즘을 제안하고 시뮬레이션을 통해 기존에 제안된 MAC 알고리즘과 성능 비교 분석을 통해 그 우수성을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1388-1397
• /
• 2001

무선 ATM에서 핸드오프 시의 경로 재설정 과정에서 필요한 COS 선택 알고리즘에 관하여 기존의 알고리즘과는 다른 새로운 알고리즘을 제안한다. 제안하는 Short search COS 선택 알고리즘은 매 핸드오프 시마다 COS를 검색하지 않고 이전에 검색된 COS 노드를 최대한 활용하여 핸드오프 지연 성능을 저하시키지 않으면서 전체적인 망 이용 효율성은 향상시키는 결과를 나타낸다. 알고리즘의 개선된 성능을 시뮬레이션을 통해 검증되고 그래프 및 결과 테이블을 통해 보여진다.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.35-38
• /
• 1999

In this paper, we propose bandwidth management scheme to efficiently guarantee the QoS of various services on ATM based IMT-2000 networks. The proposed bandwidth management scheme consists of the call admission control to reduce a handoff failure probability and the scheduling scheme to efficiently allocate a time slot based on the QoS requirements in wireless links. The simulation results show that the proposed bandwidth scheme has better performance than the previous works in terms of the handoff failure probability and packet delay time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9A
• /
• pp.1574-1582
• /
• 2001

본 논문에서는 무선 ATM 망에서 VBR 트래픽에 대한 동적인 대역할당 기법을 제안하였다. 제안된 기법에서는 동적 파라미터를 전송하기 위하여 인 밴드 방식을 사용하였으며, 버퍼의 길이와 변이를 고려하여 이동국에서 2 state bit를 기지국에서 전송하도록 하였다. 기지국에서 수신된 비트의 상태에 따라서 이동국에 데이터 슬롯을 할당한다. 제안한 알고리즘은 VBR 트래픽의 QoS를 보장하고, 시스템의 효율을 높일 수 있도록 하였고, 컴퓨터 시뮬레이션을 통하여 제안된 알고리즘의 성능을 평가하였다.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.165-180
• /
• 2001

This study is on the design and performance evaluation of a multi medium access control(MAC) protocol for multimedia access in the wireless ATM network. In general, MAC protocols for multimedia data transmission are classified into the fixed slot allocation algorithm that allocates base-station slots equally over terminals, and the dynamic slot allocation algorithm that with flexible penetration. The conventional slot allocation algorithms assign slots based on the average bandwidths required for various services types. Although the algorithms have a wide bandwidth for real-time-variant services, the slots are being wasted due the service types. To improve the slot waste problem, this thesis proposes a method that minimizes the waste by assigning variable slots based on the most appropriate bandwidth after a base-station analyzes the service type requested from terminals.