• Title/Summary/Keyword: Dynamic allocation

Search Result 684, Processing Time 0.03 seconds

Dynamic Wavelength Allocation Algorithm of TWDM PON with Low-Speed Wavelength Tuner (저속 파장 변환기를 사용하는 TWDM PON의 동적파장할당 방법)

  • Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.447-448
    • /
    • 2015
  • This paper proposes a new dynamic wavelength allocation algorithm for TWDM PON (time and wavelength division multiplexed passive optical network) which comprises of multiple ONUs (optical network units) which have low-speed wavelength tuner. The wavelength tuner requires large amount of frame times to tune its wavelength. An OLT (optical line termination) performs a dynamic bandwidth allocation after the wavelengths of ONUs are determined.

  • PDF

Dynamic Bandwidth Allocation Algorithm of TWDM PON (TWDM PON의 동적대역할당 알고리즘)

  • Hong, Sung Hak;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.743-744
    • /
    • 2013
  • This paper proposes a new DBA (dynamic bandwidth allocation) algorithm for a TWDM PON (time and wave-division multiplexing passive optical network) which is based on XGPON (10-Gigibit-Capable PON). Modifying a DBA algorithm of an XGPON, the proposed algorithm not only allocates the transmission slot but also assigns a wavelength to use for each ONU.

  • PDF

Dynamic Bandwidth Allocation Algorithm Utilizing Unused Bandwidth for XGPON (XGPON의 여유 대역폭을 활용한 동적대역할당 알고리즘)

  • Jeong, Jong Hoon;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.739-740
    • /
    • 2013
  • This paper proposes a new dynamic bandwidth allocation algorithm for XGPON (10-Gigabit-capable passive optical network). The proposed algorithm uses a common service counter for each service class unlike to the existing algorithms. The unused bandwidth of a service class can be used for other service classes to increase bandwidth utilization. We illustrate examples to show the proposed algorithm is superior to existing algorithms.

  • PDF

Heuristic based Energy-aware Resource Allocation by Dynamic Consolidation of Virtual Machines in Cloud Data Center

  • Sabbir Hasan, Md.;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1825-1842
    • /
    • 2013
  • Rapid growth of the IT industry has led to significant energy consumption in the last decade. Data centers swallow an enormous amount of electrical energy and have high operating costs and carbon dioxide excretions. In response to this, the dynamic consolidation of virtual machines (VMs) allows for efficient resource management and reduces power consumption through the live migration of VMs in the hosts. Moreover, each client typically has a service level agreement (SLA), this leads to stipulations in dealing with energy-performance trade-offs, as aggressive consolidation may lead to performance degradation beyond the negotiation. In this paper we propose a heuristic based resource allocation of VM selection and a VM allocation approach that aims to minimize the total energy consumption and operating costs while meeting the client-level SLA. Our experiment results demonstrate significant enhancements in cloud providers' profit and energy savings while improving the SLA at a certain level.

Dynamic Random Channel Allocation Scheme For Supporting QoS In HIPERLAN/2

  • Park S. J;Kang J. E;Lee J. K
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.35-38
    • /
    • 2004
  • The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and AP (Access Point) can dynamically allocate the number of RCHs (Random CHannels). We propose a dynamic random channel allocation scheme improved by limiting the number of minimum RCHs. On a simulated scenario adopted practical Internet traffic, the proposed scheme is shown to achieve over $19\%$ lower delay than previously studied algorithm. This study will be a first step towards designing scope of RCHs for high-performance wireless packet network

  • PDF

Performance Analysis of an ATM-LAN IWU with a Dynamic Bandwidth Allocation Scheme

  • Park, Chul-Geun;Han, Dong-Hwan;Baik, Kwang-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.10A
    • /
    • pp.1756-1763
    • /
    • 2001
  • In this paper, we propose an ATM-LAN IWU(interworking unit) with threshold based dynamic bandwidth allocation scheme. We analyze a discrete-time based finite queueing model with deterministic service times in order to investigate the performance of the proposed scheme. It is known that the arrival process of IP packets is bursty. So we use an MMPP(Markov Modulated Poisson Process) to model the bursty input traffic. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effects of the thresholds on the performance of the DBAS(dynamic bandwidth allocation scheme).

  • PDF

A Study on Downstream Dynamic Bandwidth Allocation Algorithm in Multi-OLT PON System (다중 OLT를 갖는 PON 시스템에서 하향 동적대역할당 알고리즘에 관한 연구)

  • Rawshan, Fahmida;Park, Young-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10B
    • /
    • pp.1143-1149
    • /
    • 2011
  • A multi-OLT PON architecture is proposed to accommodate several types of services or multiple service providers economically in a single PON. The operation protocol and a dynamic bandwidth allocation scheme appropriate for two-OLT structure are proposed. Performance analysis shows that the proposed system is very efficient and can be used in the upcoming higher speed PON system.

The Allocation Planning of Storage Location in a Dedicated Storage Method Warehuse System (지정식 보관방식 창고시스템에서 보관위치 할당계획)

  • Chang, Suk-Hwa
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.8-14
    • /
    • 2007
  • This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.

Improvement of Real-time Performance of ISO 11783 Network by Dynamic Priority Allocation Method (동적 우선순위 할당 기법을 이용한 ISO 11783 통신의 실시간성 향상)

  • Lee, Sang-Wha;Kim, Yoo-Sung;Lee, Seung-Gol;Park, Jae-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.8
    • /
    • pp.794-799
    • /
    • 2012
  • The international standard, ISO-11783, was designed for the communication within an agriculture machinery. Even if it is based on the CAN (Control Area Network) protocol, its extended features which include point-to-point communication and large data transmission support show different network performance from the standard CAN. This paper proposes a dynamic priority allocation method to improve the real-time performance of ISO-11783. Computer simulation shows reduction of the deadline-missed cases and community latency via proposed algorithm.

New Encoder/Decoder with Wavelength/Time 2-D Codes for Optical CDMA Network (광 부호 분할 다중접속 네트워크를 위한 파장/시간 2차원 코드의 새로운 부호기/복호기)

  • Hwang, Hu-Mor
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.5
    • /
    • pp.1035-1040
    • /
    • 2009
  • We propose a new encoder/decoders based on an tune able wavelength converter(TWC) and an arrayed waveguide grating(AWG) router for large capacity optical CDMA networks. The proposed encoder/decoder treats codewords of wavelength/time 2-D code simultaneously using the dynamic code allocation property of the TWC and the cyclic property of the AWG router, and multiple subscribers can share the encoder/decoder in networks. Feasibility of the structure of the proposed encoder/decoder for dynamic code allocation is tested through simulations using two wavelength/time 2-D codes, which are the generalized multi-wavelength prime code(GMWPC) and the generalized multi-wavelength Reed-Solomon code(GMWRSC). Test results show that the proposed encoder/decoder can increase the channel efficiency not only by increasing the number of simultaneous users without any multiple-access interference but by using a relatively short length CDMA codes.