• Title/Summary/Keyword: 폴링 사이클

Search Result 4, Processing Time 0.017 seconds

Performance Improvement of SDF Terminal Paging Scheme using User Movement History List in Mobile Communication Systems (이동통신 시스템에서 사용자 이동경로를 이용한 SDF 단말기 페이징 기법의 성능향상)

  • 김규칠;김용석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.34-36
    • /
    • 2002
  • 단말기 페이징이란 특정한 이동 단말장치의 정확한 위치를 결정하는 과정을 말한다. 페이징 비용은 단말기를 찾기 위한 페이징 사이클의 수와 검색되는 셀의 수에 비례한다.본 논문에서는 이러한 페이징 비용을 감소시키기 위하여, 실생활에서 단말기 사용자의 이동 패턴이 일정하다는 가정 하에 Shortest-Distance-First 방식에 단말기 사용자의 이동경로 이력 리스트를 부가한 이동경로 기반의 페이징 기법을 제안하고 폴링 사이클의 수와 폴링 시그널의 수 관점에서 시뮬레이션을 통해 기존 SDF 단말기 페이징 기법과 성능을 비교 분석한다. 시뮬레이션 결과를 통하여 제안된 방식이 폴링 사이클과 폴링 시그널의 수를 감소시킴을 보여준다

  • PDF

Performance Analysis of Terminal Paging Strategies for Location Management (위치관리를 위한 단말기 페이징 기법의 성능 분석)

  • Kim, Kyu-Chil;Choi, Chang-Yeol;Kim, Yong-Seok
    • Journal of Industrial Technology
    • /
    • v.21 no.B
    • /
    • pp.257-263
    • /
    • 2001
  • Terminal paging is the process of determining the exact location of a particular mobile terminal. The paging cost is related to the number of paging cycles and the number of cells being polled by each cycle. In this paper, we first analyze the performance of various terminal paging strategies in terms of the number of polling cycles and the number of polling signals. Then we present a paging scheme which combines Shortest-Distance-First with movement history list. Simulation results show that the proposed paging scheme reduces the number of polling signals as well as the number of polling cycles.

  • PDF

Delay Performance Analysis of a Dynamic Bandwidth Allocation Scheme in a GPON (GPON에서 동적 대역할당 방안의 지연성능 분석)

  • Park, Chul-Geun;Chung, Hae;Kim, Jin-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9B
    • /
    • pp.813-821
    • /
    • 2008
  • In recent year, several types of PON(Passive Optical Networks) have been adopted into the subscriber loops for the high speed subscriber lines to meet the needs of some applications based on the Internet and the rapid increase of the Internet users. GPON(Gigabit PON) is a typical access network technology of these PONs which adopt the DBA(Dynamic bandwidth Allocation) scheme in order to transmit upstream traffic efficiently. In this paper, we introduce the gated polling system with a two-stage queue in order to analyze the delay performance of the DBA scheme in a GPON. We use a continuous time queueing model for deriving the mean cycle time and for obtaining the mean packet delay. We give some numerical results to investigate the delay performance for the symmetric polling system with statistically identical stations.

IPS-based Dynamic Bandwidth Allocation Algorithm with Adaptive Maximum Transmission Window to Increase Channel Utilization in EPON (EPON에서의 효율성 향상을 위한 가변 최대 전송 윈도우를 이용한 IPS 기반의 동적 대역폭 할당 알고리즘)

  • Cho, Seung-Moo;Oh, Chang-Yeong;Chung, Min-Young;Choo, Hyun-Seung;Lee, Tae-Jin
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.477-486
    • /
    • 2009
  • This paper proposes a dynamic bandwidth allocation (DBA) algorithm with adaptive maximum transmission window (DBA-AMTW) to increase channel utilization in Ethernet passive optical networks (EPONs). A polling mechanism in EPON determines channel utilization and puts constraints on DBA algorithm and scheduling. DBA algorithms based on interleaved polling with stop (IPS) allocate transmission windows to optical network units (ONU) considering requests of all ONUs. However channel idle time when any ONU does not transmit packets decreases channel utilization. Proposed DBA-AMTW improves efficiency of a network and allocates transmission windows effectively by appropriate DBA computation from REPORT messages of all ONUs. An adaptive maximum transmission window for each ONU determined by a DBA computation in the previous scheduling cycle. Simulation results show that the proposed DBA algorithm improves performance of throughput and average delay time.