• Title/Summary/Keyword: bandwidth allocation algorithm

Search Result 185, Processing Time 0.028 seconds

Dynamic Bandwidth Allocation using Adaptive Minimum Guaranteed Bandwidth for Ethernet Passive Optical Networks (이더넷 수동 광통신 망을 위한 가변형 최소 보증 대역폭을 이용한 동적 대역폭 할당 기법의 제안)

  • Lim, Wan-Wu;Yun, Chang-Ho;Lee, Hyun-Ju;Yang, Yeon-Mo;Kim, Ki-Seon
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.23-24
    • /
    • 2007
  • Ethernet passive optical network (EPON) is a technology to solve the access network bottleneck and to realize fiber to the home (FTTH). In EPON, the dynamic bandwidth allocation (DBA) is important because all users share common line in upstream. In this paper, we propose new DBA named as modified EPON dynamic scheduling algorithm (MEDSA) and simulate new DBA using Matlab.

  • PDF

Performance Evaluation of Pipelined Dynamic Bandwidth Algorithm for XG-PON (XG-PON의 Pipeline 방식의 동적대역할당 성능평가)

  • Gong, Byung Gu;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.148-149
    • /
    • 2014
  • This paper evaluates performance of a pipelined dynamic bandwidth allocation scheme for XG-PON (10-Gbps-capable passive optical network) system for power saving. Under self-similar traffic and balanced input loads, we evaluate performance of XG-PON systems using computer simulations.

  • PDF

Performance Analysis of Adaptive Bandwidth and Subcarrier Allocation Scheme for a Multi-user OFDM System (다중 사용자 OFDM 시스템을 위한 적응적 대역폭 및 부반송파 할당 기법의 성능 분석)

  • Lim, Yeon-Ju;Park, Sang-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11A
    • /
    • pp.1113-1119
    • /
    • 2006
  • For a multi-user OFDM system in mobile channels which requires low-complexity in adaptive resource allocations, resource allocation algorithm using multi-threshold is proposed. The allocation scheme, which is performed by the multi-threshold values in descending order, considers only subcarriers over each threshold level. Moreover, some subcarriers with the lowest channel gain can be· removed in the present threshold level within the constraint of satisfaction of the required data rate, in order to allocate them to the other users when the allocation process of next threshold is executed. As a result, the proposed bandwidth and subcarrier algorithm has better system performances than the conventional allocation schemes in terms of required power and processing time, which is expected as a technique that improves the spectral efficiency of OFDM systems in a mobile environment.

Network Selection Algorithm Based on Spectral Bandwidth Mapping and an Economic Model in WLAN

  • Pan, Su;Zhou, Weiwei;Gu, Qingqing;Ye, Qiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.68-86
    • /
    • 2015
  • Future wireless network aims to integrate different radio access networks (RANs) to provide a seamless access and service continuity. In this paper, a new resource denotation method is proposed in the WLAN and LTE heterogeneous networks based on a concept of spectral bandwidth mapping. This method simplifies the denotation of system resources and makes it possible to calculate system residual capacity, upon which an economic model-based network selection algorithm is designed in both under-loaded and over-loaded scenarios in the heterogeneous networks. The simulation results show that this algorithm achieves better performance than the utility function-based access selection (UFAS) method proposed in [12] in increasing system capacity and system revenue, achieving load balancing and reducing the new call blocking probability in the heterogeneous networks.

Dynamic Spectrum Allocation Algorithm for Maritime Communications using Spectrum Sharing and Priority (해상무선통신환경에서 스펙트럼 공유와 우선순위를 적용한 동적스펙트럼할당 알고리즘 기술연구)

  • Lim, Moo-Sung;Kim, Kyung-Sung;Lee, Yeon-Woo;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7B
    • /
    • pp.1001-1008
    • /
    • 2010
  • In this paper, we propose the dynamic spectrum allocation (DSA) algorithm using spectrum sharing method considering the long-term priority between NOs and service classes for the maritime communication system environment where a ship locates at either near shore (or land) or off-shore. It was shown that the proposed algorithm using spectrum sharing with priorities could deliver better satisfaction ratio (SR) than the fixed allocation schemes, in the context of provision of required bandwidth (or spectrum) for each users. Therefore, we conclude that the proposed DSA with priorities could apply to the maritime communication environment and exploit the under-used (or unused, idle) spectrum of terrestrial communication networks.

Performance Evaluation of Dynamic signalling Period Allocation Algorithm for Wireless ATM MAC Protocols under Mixed Traffic Conditions (무선 ATM MAC 프로토콜을 위한 동적 신호 주기 할당 알고리즘의 다양한 트래픽 환경에서의 성능평가)

  • 강상욱;신요안;최승철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5B
    • /
    • pp.820-829
    • /
    • 2000
  • In this paper, DSPA(Dynamic Signalling Period Allocation) algorithm that has been proposed by the authors for MAC(Medium Access Control) protocols in W-ATM(Wireless Asynchronous Transfer Mode) is applied to mixed traffic conditions composed of various service classes. We investigate the bandwidth utilization efficiency and quality of service(QoS) fulfillment by the DSPA algorithm used in W-ATM MAC protocols. Simulation results indicate that the DSPA algorithm significantly increases the throughput of the system with the minimum control overhead. Moreover, QoS of each service class is well satisfied by proper and fair channel allocation to different service classes according to their requirements.

  • PDF

Energy-Efficient Resource Allocation for Heterogeneous Cognitive Radio Network based on Two-Tier Crossover Genetic Algorithm

  • Jiao, Yan;Joe, Inwhee
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.112-122
    • /
    • 2016
  • Cognitive radio (CR) is considered an attractive technology to deal with the spectrum scarcity problem. Multi-radio access technology (multi-RAT) can improve network capacity because data are transmitted by multiple RANs (radio access networks) concurrently. Thus, multi-RAT embedded in a cognitive radio network (CRN) is a promising paradigm for developing spectrum efficiency and network capacity in future wireless networks. In this study, we consider a new CRN model in which the primary user networks consist of heterogeneous primary users (PUs). Specifically, we focus on the energy-efficient resource allocation (EERA) problem for CR users with a special location coverage overlapping region in which heterogeneous PUs operate simultaneously via multi-RAT. We propose a two-tier crossover genetic algorithm-based search scheme to obtain an optimal solution in terms of the power and bandwidth. In addition, we introduce a radio environment map to manage the resource allocation and network synchronization. The simulation results show the proposed algorithm is stable and has faster convergence. Our proposal can significantly increase the energy efficiency.

Multiple Multicast Tree Allocation Algorithm in Multicast Network

  • Lee Chae Y.;Cho Hee K.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.120-127
    • /
    • 2002
  • The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.

  • PDF

Development of an Extended EDS(Earliest Deadline Scheduling) Algorithm for the CAN-Based Real-Time System (CAN기반 실시간 시스템을 위한 확장된 EDS 알고리즘 개발)

  • Lee, Byong-Hoon;Kim, Hong-Ryeol;Kim , Dae-Won
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.7
    • /
    • pp.294-301
    • /
    • 2002
  • A new dynamic scheduling algorithm is proposed for CAN-based real-time system in this paper. The proposed algorithm is extended from an existing EDS(Earliest Deadline Scheduling) approach having a solution to the priority inversion. Using the proposed algorithm, the available bandwidth of network media can be checked dynamically, and consequently arbitration delay causing the miss of deadline can be avoided. Also, non-real time messages can be processed with their bandwidth allocation. Full network utilization and real-time transmission feasibility can be achieved through the algorithm. To evaluate the performance of algorithm, two simulation tests are performed. The first one is transmission data measurement per minute for periodic messages and the second one is feasibility in the system with both periodic messages and non-real time message.

Scheduling Method to Improve fairness of ABR Service in ATM Network (ATM망에서 ABR서비스의 공평성 향상을 위한 스케줄링 방법)

  • 양형규;이병호
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.129-132
    • /
    • 2001
  • Broadband Integrated Services Digital Network(B-lSDN) supports multimedia information in real time. This can be accomplished by using Asynchronous Transfer Mode(ATM) technology. In addition, ATM networks can provide not only bandwidth reservation, but also Quality of Service(QoS) guarantees. In this paper, we propose a efficient cell scheduling algorithm considering ABR service in ATM networks. The proposed algorithm can support ABR service more efficiently than existing fixed cell slot allocation method and priority cell slot allocation method algorithm. proposed algorithm dynamically schedules cells in a real time by considering the current traffic buffer conditions. Throughout the computer simulation, evaluates the performance of the proposed algorithm.

  • PDF