• Title/Summary/Keyword: bandwidth allocation algorithm

Search Result 185, Processing Time 0.019 seconds

An Efficient VPI/VCI Allocation Algorithm for ABR Multipoint-to-point Connection in ATM Networks (ATM 망에서의 ABR 다점 대 점 연결을 위한 효과적인 VPI/VCI 할당 알고리즘)

  • 천상훈;곽경섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9B
    • /
    • pp.1661-1667
    • /
    • 1999
  • In this paper, we propose an efficient VP extension algorithm for ABR multipoint-to-point connection in ATM networks. The VC merging or VP merging is used to implement ABR multipoint-to-point connection. We use the VP merging technique. To solve the scarcity problem of VP resources, we propose an efficient VP extension algorithm. Since the proposed scheme follows the standard VPI/VCI format, it doesn’t require another table according to the VP extension. We compare the proposed scheme with VC merging algorithm. The result shows that the proposed method can provide fair bandwidth allocation among the sources in multipoint-to-point connection.

  • PDF

Clustering Strategy Based on Graph Method and Power Control for Frequency Resource Management in Femtocell and Macrocell Overlaid System

  • Li, Hongjia;Xu, Xiaodong;Hu, Dan;Tao, Xiaofeng;Zhang, Ping;Ci, Song;Tang, Hui
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.664-677
    • /
    • 2011
  • In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.

The fuzzy transmission rate control method for the fairness bandwidty allocation of ABR servce in ATM networks (AYM망에서 ABR 서비스의 공정 대역폭 할당을 위한 퍼지 전송률 제어 기법)

  • 유재택;김용우;김영한;이광형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.5
    • /
    • pp.939-948
    • /
    • 1997
  • In this paper, we propose the new rate-based transmission rates control algorithm that allocates the fair band-width for ABR service in ATM network. In the traditional ABR service, bandwidth is allocated with constant rate increment or decrement, but in the proposed algorithm, it is allocated fairly to the connected calls by the fuzzy inference of the available bandwidth. The fuzzy inference uses buffer state and the buffer variant rate as the input variables, and uses the total transmission rate as a output variable. This inference a bandwidth is fairly distributed over all ABR calls in service. By simmulation, we showed that the proposed method improved 0.17% in link effectiveness when RIF, RDF is 1/4, 38.6% when RIF, RDF 1/16, and 82.4% when RIF, RDF 1/32 than that of the traditional EFPCA.

  • PDF

Adaptive Call Admission and Bandwidth Control in DVB-RCS Systems

  • Marchese, Mario;Mongelli, Maurizio
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.568-576
    • /
    • 2010
  • The paper presents a control architecture aimed at implementing bandwidth optimization combined with call admission control (CAC) over a digital video broadcasting (DVB) return channel satellite terminal (RCST) under quality of service (QoS) constraints. The approach can be applied in all cases where traffic flows, coming from a terrestrial portion of the network, are merged together within a single DVB flow, which is then forwarded over the satellite channel. The paper introduces the architecture of data and control plane of the RCST at layer 2. The data plane is composed of a set of traffic buffers served with a given bandwidth. The control plane proposed in this paper includes a layer 2 resource manager (L2RM), which is structured into decision makers (DM), one for each traffic buffer of the data plane. Each DM contains a virtual queue, which exactly duplicates the corresponding traffic buffer and performs the actions to compute the minimum bandwidth need to assure the QoS constraints. After computing the minimum bandwidth through a given algorithm (in this view the paper reports some schemes taken in the literature which may be applied), each DM communicates this bandwidth value to the L2RM, which allocates bandwidth to traffic buffers at the data plane. Real bandwidth allocations are driven by the information provided by the DMs. Bandwidth control is linked to a CAC scheme, which uses current bandwidth allocations and peak bandwidth of the call entering the network to decide admission. The performance evaluation is dedicated to show the efficiency of the proposed combined bandwidth allocation and CAC.

A dynamic cell scheduling algorithm for efficient allocation of bandwidth on ATM network (ATM 망에서 효율적 대역폭 할당을 위한 종적 셀 스케줄링 알고리즘)

  • 조성현;오윤탁;박성한
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.3
    • /
    • pp.54-64
    • /
    • 1998
  • In this paper, a cell scheduling algorithm is proposed to satisfy the service requirements of CBR, VBR traffics. Particularly, inthe proposed algorithm an ABR traffic which is not included in the conventional cell schedulaing algorithm is treated as one kind of traffic types. The algorithm of RT-VBR and NRT-VBR traffic such that the service requrements of RT-VBR and NRT-VBR traffic are satisfied. The proposed algorithm dynamically schedules cells in a real time by considerin the current traffic conditions. The simulation of the proposed algorithms such as WRR or DWRR in terms of the mean delay time and the maximum queue length.

  • PDF

UAV Network Resource Allocation Algorithm according to the Network Environment and Data Requirement (네트워크 환경 및 데이터 요구사항에 따른 무인기 네트워크 자원할당 알고리즘)

  • Cheon, Hye-Rim;Hwang, Chan-Ho;Lee, Woosin;Yoo, Indeok;Kim, Jae-Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.7
    • /
    • pp.3-11
    • /
    • 2017
  • UAV system has the limitation to allocate enough spectrum bandwidth for the operation of multiple UAVs due to the market expansion. In addition, the communication environment of UAV network varies dynamically due to the UAV's mobility. Thus, to operate the stable UAV system and maximize the transmission data rate, it needs to allocate the resource effectively in the limited bandwidth considering the given network environment. In this paper, we propose the resource allocation algorithm which can maximize the network throughput as well as satisfy the minimum data requirement for the UAV system operation in the given network environment based on TDMA(Time Division Multiple Access). By performance analysis, we show that the proposed algorithm can allocate the resource to satisfy the high network throughput as well as the minimum data requirement in the given network environment.

Transmission Power Minimization with Network Coding for Mobile Terminals in Cellular Relay Networks

  • Du, Guanyao;Xiong, Ke;Li, Dandan;Qiu, Zhengding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2098-2117
    • /
    • 2012
  • This paper jointly investigates the bandwidth allocation, transmission strategy and relay positions for two-way transmission aware cellular networks with network coding (NC). Our goal is to minimize the transmission power of mobile terminals (MTs). Consider a cellular system, where multiple MTs exchange information with their common base station, firstly, we propose an efficient bandwidth allocation method and then give a transmission strategy for each MT to determine whether to use relay stations (RSs) for its two-way transmission with the BS or not. To further improve the system performance, the optimal positions of RSs are also jointly discussed. A GA-based algorithm is presented to obtain the optimum positions for RSs. Besides, the impacts of frequency reuse on MT's transmission power and system spectral efficiency (SE) under different number of relays are also discussed in our work. Numerical results show that the proposed NC aware scheme can extend MTs' battery life at least 6% more than traditional method.

Resource Allocation Algorithm for Multiple RIS-Assisted UAV Networks (다중 UAV-RIS 네트워크를 위한 자원 할당 알고리즘)

  • Heejae Park;Laihyuk Park
    • Journal of Platform Technology
    • /
    • v.11 no.1
    • /
    • pp.3-10
    • /
    • 2023
  • Unmanned Aerial Vehicles (UAVs) have gained significant attention in 5G and 6G wireless networks due to their high flexibility and low hardware costs. However, UAV communication is still challenged by blockage and energy consumption issues. Reconfigurable Intelligent Surfaces (RISs) have emerged as a promising solution to these challenges, enabling improved spectral efficiency and reduced energy consumption by transmitting signals to users who cannot receive signals because of the obstacles. Many previous studies have focused on minimizing power consumption and data transmission delay through phase shift and power optimization. This paper proposes an algorithm that maximizes the sum rate by including bandwidth optimization. Simulation results demonstrate the effectiveness of the proposed algorithm.

  • PDF

Spectrum allocation strategy for heterogeneous wireless service based on bidding game

  • Cao, Jing;Wu, Junsheng;Yang, Wenchao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1336-1356
    • /
    • 2017
  • The spectrum scarcity crisis has resulted in a shortage of resources for many emerging wireless services, and research on dynamic spectrum management has been used to solve this problem. Game theory can allocate resources to users in an economic way through market competition. In this paper, we propose a bidding game-based spectrum allocation mechanism in cognitive radio network. In our framework, primary networks provide heterogeneous wireless service and different numbers of channels, while secondary users have diverse bandwidth demands for transmission. Considering the features of traffic and QoS demands, we design a weighted interference graph-based grouping algorithm to divide users into several groups and construct the non-interference user-set in the first step. In the second step, we propose the dynamic bidding game-based spectrum allocation strategy; we analyze both buyer's and seller's revenue and determine the best allocation strategy. We also prove that our mechanism can achieve balanced pricing schema in competition. Theoretical and simulation results show that our strategy provides a feasible solution to improve spectrum utilization, can maximize overall utility and guarantee users' individual rationality.

A Dynamic Wavelength and Bandwidth Allocation Algorithm with Dynamic Framing under Ring-based EPON Architecture

  • Bang, Hak-Jeon;Park, Chang-Soo
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2009.02a
    • /
    • pp.307-308
    • /
    • 2009
  • To reduce delay for high priority packets in the ring-based EPON, the EPON packet classifier groups services as their priorities and frames for services are dynamically framed as their priorities. Since dynamic framing for a packet priority dynamically changes assignment spaces in the maximum framing packet size as network traffics, it makes services with high priority to improve quality of services with relative low threshold time for transmitting.

  • PDF