• 제목/요약/키워드: Control Allocation

검색결과 887건 처리시간 0.036초

ATM 망에서 호 설정 정보를 이용한 명시적 전송률 할당 알고리즘 (Explicit Rate Allocation Algorithsm using the Connection Setup Information in ATM Networks)

  • 김대일;김중민;박인갑
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
    • /
    • pp.379-382
    • /
    • 2001
  • In this paper, a new enhanced early fair rate allocation(EFRA+) algorithm is proposed for ATM switches supporting ABR service. The central issue of explicit rate control algorithms for ABR service is the computation of max-min fair rates for every connection. The EFRA+ inherits the main feature of the EFRA, uses the connection control information during the connection setup to prevent potential congestion in switches, and enhances the computation method of the max-min fair rate.

  • PDF

Adaptive Cross-Layer Resource Optimization in Heterogeneous Wireless Networks with Multi-Homing User Equipments

  • Wu, Weihua;Yang, Qinghai;Li, Bingbing;Kwak, Kyung Sup
    • Journal of Communications and Networks
    • /
    • 제18권5호
    • /
    • pp.784-795
    • /
    • 2016
  • In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.

Resource Allocation in Spectrum Sharing ad-hoc Cognitive Radio Networks Based on Game Theory: An Overview

  • Abdul-Ghafoor, Omar B.;Ismail, Mahamod;Nordin, Rosdiadee;El-Saleh, Ayman Abd
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권12호
    • /
    • pp.2957-2986
    • /
    • 2013
  • The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

이더넷 수동형 광가입자망에서의 동적 대역폭 할당에 관한 연구 (Study on the dynamic bandwidth allocation over Ethernet Passive Optical Network)

  • 주정민;변희정;남기욱;임종태
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.663-665
    • /
    • 2004
  • Ethernet-based passive optical network(EPON) technology is being considered as a promising solution for next-generation broadband access network. It must have the property of high efficiency, low cost, and support quality of service(QoS). A major feature for this new architecture is the use of a shared transmission media between all connected optical network unit(ONU). Hence, medium access control(MAC) arbitration mechanisms are essential for the successful implementation of EPON. In this paper we propose a simple dynamic bandwidth allocation(DBA) algorithm that improves the performance of network and supports IP-based multimedia applications with the bursty data traffic. In addition, we introduce analytic models of proposed algorithms and prove the system based on our algorithm to be asymptotically stable. Simulation results show the new DBA algorithm provides high bandwidth efficiency and low queueing delay of ONU in EPON.

  • PDF

TWDM PON을 위한 새로운 MAC 프로토콜 및 동적대역할당 방법 (New MAC Protocol and Dynamic Bandwidth Allocation Method for TWDM PON)

  • 한만수;나철훈;강성준
    • 한국정보통신학회논문지
    • /
    • 제17권6호
    • /
    • pp.1419-1424
    • /
    • 2013
  • PONs (passive optical networks)은 운용비용이 저렴하고 높은 대역폭을 제공하기 때문에 가입자망에서 각광을 받고 있다. 최근에는 WDM (wavelength-division multiplexing)와 TDM (time-division multiplexing)을 결합한 TWDM PON이 가입자망에서의 새로운 해답으로 여겨지고 있다. 본 논문에서는 TWDM PON에 대한 새로운 MAC (media access control) protocol을 제안한다. 또한 TWDM PON에 대한 새로운 동적대역할당 방법을 제안하고 성능을 평가한다.

쌍동형 무인선의 동적위치제어에 관한 연구 (Dynamic Positioning Control of a Twin-hull Unmanned Surface Ship)

  • 강민주;김태윤;김진환
    • 로봇학회논문지
    • /
    • 제11권4호
    • /
    • pp.217-225
    • /
    • 2016
  • Dynamic Positioning (DP) is used to automatically maintain the position and heading of a floating structure subjected to environmental disturbances. A DP control system is composed of a motion controller to compute the desired force and moment and a thrust allocator to distribute the computed force and moment to multiple thrusters considering mechanical and operational constraints. Among various thruster configurations, azimuth thrusters or propeller/rudder pairs tend to make the allocation problem difficult to solve, because these types of propulsion systems include nonlinear constraints. In this paper, a dynamic positioning strategy for a twin-thruster ship that is propelled by two azimuthing thrusters is addressed, and a thrust allocation method which does not require a numerical optimization solver is proposed. The applicability of the proposed method is demonstrated with an experiment using an autonomous boat.

부하관리사업자의 비상시 부하제어량 배분 알고리즘 개발 (Development of the Load Curtailment Allocation Algorithm for Load Aggregator in Emergeney Demand Response)

  • 정구형;김진호;김발호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 하계학술대회 논문집 A
    • /
    • pp.633-635
    • /
    • 2003
  • Electricity industries throughout the world are undergoing unprecedented changes. As a result, these changes lead to the separation of traditional integrated utilities and the introduction of competition in order that increase efficiency in electricity industry. Direct load control (DLC) system in competitive electricity market has a hierarchical interactive operation system, therefore, its control logic is also applied by bilateral interactive method that interchanges information related to interruptible load between operation hierarchies. Consequently, load curtailment allocation algorithm appropriate for new DLC system is required, and based on interchanged information, this algorithm should be implemented by most efficient way for each operation hierarchy. In this paper, we develop the load curtailment allocation algorithm in an emergency for new DLC system. Especially, the optimal algorithm for load aggregator (LA) that participates in competitive electricity market as a main operator for load management is developed.

  • PDF

ATM-GFR 서비스를 이용한 가변 데이터의 효과적인 대역폭 관리 (The Efficient Bandwidth Control Method for Variable Data using ATM-GFR Service)

  • 김중규;이영동
    • 디지털콘텐츠학회 논문지
    • /
    • 제2권2호
    • /
    • pp.129-138
    • /
    • 2001
  • 오늘날 인터넷의 급격한 확산과 여러가지 서비스의 개발에 따라 사용되는 데이터의 포맷도 문자, 음성, 동영상등 다양한 형태의 멀티미디어 데이터로 빠르게 변화하고 있다. 이러한 다양한 형태의 가변 데이터를 ATM 망을 통해 서비스하기 위해서는 최소 대역폭을 보장하고 사용 가능한 대역폭을 동적으로 할당하는 것이 필요하다. 이를 위해 개선된 형태의 수정된 DFBA(Differential Fair Buffer Allocation) 알고리즘을 제안하였다. 제안한 알고리즘은 최소 대역폭을 보장하면서 기존 방법의 단점인 공평성과 효율의 불균형을 해소시켜 효과적인 대역폭 관리를 하는 방안으로, 이의 성능을 시뮬레이션을 통하여 확인하였다.

  • PDF

Resource Allocation and EE-SE Tradeoff for H-CRAN with NOMA-Based D2D Communications

  • Wang, Jingpu;Song, Xin;Dong, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권4호
    • /
    • pp.1837-1860
    • /
    • 2020
  • We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

Hierarchical Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

  • Ahn, Kye-Hyun;Han, Kyeong-Eun;Kim, Young-Chon
    • ETRI Journal
    • /
    • 제26권4호
    • /
    • pp.321-331
    • /
    • 2004
  • In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low-level scheduler in the optical network unit (ONU) and a high-level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi-point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah "Ethernet in the first mile" (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.

  • PDF