Log in

Relevant bibliographies by topics / Bandwidth Allocation Problem / Journal articles

To see the other types of publications on this topic, follow the link: Bandwidth Allocation Problem.

Journal articles on the topic 'Bandwidth Allocation Problem'

Author: Grafiati

Published: 3 June 2025

Last updated: 20 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Bandwidth Allocation Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ramakrishnan, Sangeeta, Xiaoqing Zhu, Frank Chan, et al. "Optimizing Quality-of-Experience for HTTP-based Adaptive Video Streaming." International Journal of Multimedia Data Engineering and Management 7, no. 4 (2016): 22–44. http://dx.doi.org/10.4018/ijmdem.2016100102.

Full text

Abstract:

In this work, the authors present a novel bandwidth management solution for optimizing overall quality of experience (QoE) of multiple video streaming sessions. Instead of allocating bandwidth equally among competing flows, they propose to tailor the bandwidth allocation to both content complexity of requested video and playout buffer status of individual clients. The authors formulate the multi-client bandwidth allocation problem within the convex optimization framework, which is flexible enough to accommodate a wide variety of video quality metrics. Further, the authors present a practical a

APA, Harvard, Vancouver, ISO, and other styles

2

Thabet, Saqr Khalil Saeed, Emmanuel Osei-Mensah, Omar Ahmed, Abegaz Mohammed Seid, and Olusola Bamisile. "Resource Optimization for 3D Video SoftCast with Joint Texture/Depth Power Allocation." Applied Sciences 12, no. 10 (2022): 5047. http://dx.doi.org/10.3390/app12105047.

Full text

Abstract:

During wireless video transmission, channel conditions can vary drastically. When the channel fails to support the transmission bit rate, the video quality degrades sharply. A pseudo-analog transmission system such as SoftCast relies on linear operations to achieve a linear quality transition over a wide range of channel conditions. When transmitting 3D videos over SoftCast, the following issues arise: (1) assigning the transmission power to texture and depth maps to obtain the optimal overall quality and (2) handling 3D video data traffic by dropping and re-allocating resources. This paper so

APA, Harvard, Vancouver, ISO, and other styles

3

You, Peng-Sheng, Chun-Chieh Lee, and Yi-Chih Hsieh. "Bandwidth allocation and pricing problem for a duopoly market." Yugoslav Journal of Operations Research 21, no. 1 (2011): 65–78. http://dx.doi.org/10.2298/yjor1101065y.

Full text

Abstract:

This research discusses the Internet service provider (ISP) bandwidth allocation and pricing problems for a duopoly bandwidth market with two competitive ISPs. According to the contracts between Internet subscribers and ISPs, Internet subscribers can enjoy their services up to their contracted bandwidth limits. However, in reality, many subscribers may experience the facts that their on-line requests are denied or their connection speeds are far below their contracted speed limits. One of the reasons is that ISPs accept too many subscribers as their subscribers. To avoid this problem, ISPs can

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Heng, Aijun Liu, and Xiaofei Pan. "Optimization of Joint Power and Bandwidth Allocation in Multi-Spot-Beam Satellite Communication Systems." Mathematical Problems in Engineering 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/683604.

Full text

Abstract:

Multi-spot-beam technique has been widely applied in modern satellite communication systems. However, the satellite power and bandwidth resources in a multi-spot-beam satellite communication system are scarce and expensive; it is urgent to utilize the resources efficiently. To this end, dynamically allocating the power and bandwidth is an available way. This paper initially formulates the problem of resource joint allocation as a convex optimization problem, taking into account a compromise between the maximum total system capacity and the fairness among the spot beams. A joint bandwidth and p

APA, Harvard, Vancouver, ISO, and other styles

5

Bhattacharya, Hindol, Samiran Chattopadhyay, Matangini Chattopadhyay, and Avishek Banerjee. "Storage and Bandwidth Optimized Reliable Distributed Data Allocation Algorithm." International Journal of Ambient Computing and Intelligence 10, no. 1 (2019): 78–95. http://dx.doi.org/10.4018/ijaci.2019010105.

Full text

Abstract:

Distributed storage allocation problems are an important optimization problem in reliable distributed storage, which aims to minimize storage cost while maximizing error recovery probability by optimal storage of data in distributed storage nodes. A key characteristic of distributed storage is that data is stored in remote servers across a network. Thus, network resources especially communication links are an expensive and non-trivial resource which should be optimized as well. In this article, the authors present a simulation-based study of the network characteristics of a distributed storage

APA, Harvard, Vancouver, ISO, and other styles

6

Wayer, Shahaf I., and Arie Reichman. "Resource Management in Satellite Communication Systems: Heuristic Schemes and Algorithms." Journal of Electrical and Computer Engineering 2012 (2012): 1–10. http://dx.doi.org/10.1155/2012/169026.

Full text

Abstract:

The high cost of frequency bandwidth in satellite communication emphasizes the need for good algorithms to cope with the resource allocation problem. In systems using DVB-S2 links, the optimization of resource allocation may be related to the classical multi-knapsack problem. Resource management should be carried out according to the requests of subscribers, their priority levels, and assured bandwidths. A satisfaction measure is defined to estimate the allocation processes. Heuristic algorithms together with some innovative scaling schemes are presented and compared using Monte Carlo simulati

APA, Harvard, Vancouver, ISO, and other styles

7

Park, Jae Hyun, Doyle Kwon, and Duk Kyung Kim. "Resource Allocation for GBR Services in D2D-Enabled Communication." Electronics 9, no. 10 (2020): 1585. http://dx.doi.org/10.3390/electronics9101585.

Full text

Abstract:

In device-to-device (D2D)-enabled communications, a channel can be matched to a cellular user (CU)–D2D user (DU) pair, where either two separate resources can be allocated in a dedicated mode, or a single resource is shared in a shared mode. It affects the channel capacity and the channel bandwidth needed to guarantee the target data rate. The transmit power also needs to be adaptively controlled according to channel bandwidth, as well as channel quality. In this paper, we propose a resource allocation scheme to minimize the total channel bandwidth while guaranteeing the target data rate of gu

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Chongli, Tiejun Lv, Pingmu Huang, Zhipeng Lin, Jie Zeng, and Yuan Ren. "Joint Optimization of Bandwidth and Power Allocation in Uplink Systems with Deep Reinforcement Learning." Sensors 23, no. 15 (2023): 6822. http://dx.doi.org/10.3390/s23156822.

Full text

Abstract:

Wireless resource utilizations are the focus of future communication, which are used constantly to alleviate the communication quality problem caused by the explosive interference with increasing users, especially the inter-cell interference in the multi-cell multi-user systems. To tackle this interference and improve the resource utilization rate, we proposed a joint-priority-based reinforcement learning (JPRL) approach to jointly optimize the bandwidth and transmit power allocation. This method aims to maximize the average throughput of the system while suppressing the co-channel interferenc

APA, Harvard, Vancouver, ISO, and other styles

9

Zhang, Xun, Kehao Wang, Xiaobai Li, Kezhong Liu, and Yirui Cong. "Joint Task Allocation and Resource Optimization Based on an Integrated Radar and Communication Multi-UAV System." Drones 7, no. 8 (2023): 523. http://dx.doi.org/10.3390/drones7080523.

Full text

Abstract:

This paper investigates the joint task allocation and resource optimization problem in an integrated radar and communication multi-UAV (IRCU) system. Specifically, we assign reconnaissance UAVs and communication UAVs to perform the detection, tracking and communication tasks under the resource, priority and timing constraints by optimizing task allocation, power as well as channel bandwidth. Due to complex coupling among task allocation and resource optimization, the considered problem is proved to be non-convex. To solve the considered problem, we present a loop iterative optimization (LIO) a

APA, Harvard, Vancouver, ISO, and other styles

10

Abu-Ein, Ashraf A., Waleed Abdelkarim Abuain, Mohannad Q. Alhafnawi, and Obaida M. Al-Hazaimeh. "Security Enhanced Dynamic Bandwidth Allocation-Based Reinforcement Learning." WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS 22 (November 5, 2024): 21–27. https://doi.org/10.37394/23209.2025.22.3.

Full text

Abstract:

Recently, the problem of allocating bandwidth has arisen due to the limitation of bandwidth resources. Reinforcement learning is a good technique that can be used for improving throughput, and efficiency and minimizing the overall blocking of the network. To optimize performance metrics such as throughput and Quality of Service (e.g., QoS), this research employs Reinforcement Learning (e.g., RL) and models bandwidth allocation in networking as a Markov Decision Process (e.g., MDP). Interacting with the network and modifying rewards-based policies, the agent acquires the ability to allocate ban

APA, Harvard, Vancouver, ISO, and other styles

11

Liu, Qingli, Rui Li, Yangyang Li, Peiling Wang, and Jiaxu Sun. "Adaptive Bandwidth Allocation for Massive MIMO Systems Based on Multiple Services." Applied Sciences 13, no. 17 (2023): 9861. http://dx.doi.org/10.3390/app13179861.

Full text

Abstract:

Aiming at the characteristics of resource periodicity in massive MIMO systems and bandwidth allocation without comprehensive consideration of user service QoS and channel state information, resulting in poor user satisfaction and low bandwidth utilization, this paper proposes an adaptive bandwidth allocation method based on user services. This method comprehensively considers factors, such as user service QoS, channel state information, and resource periodicity, to adaptively allocate bandwidth for users using different services. Firstly, based on the service priority, the user priority is dyn

APA, Harvard, Vancouver, ISO, and other styles

12

Li, Shiyong, Yue Zhang, Yan Wang, and Wei Sun. "Utility optimization–based bandwidth allocation for elastic and inelastic services in peer–to–peer networks." International Journal of Applied Mathematics and Computer Science 29, no. 1 (2019): 111–23. http://dx.doi.org/10.2478/amcs-2019-0009.

Full text

Abstract:

Abstract This paper considers reasonable bandwidth allocation for multiclass services in peer-to-peer (P2P) networks, measures the satisfaction of each peer as a customer by a utility function when acquiring one service, and develops an optimization model for bandwidth allocation with the objective of utility maximization. Elastic services with concave utilities are first considered and the exact expression of optimal bandwidth allocation for each peer is deduced. In order to obtain an optimum in distributed P2P networks, we develop a gradient-based bandwidth allocation scheme and illustrate t

APA, Harvard, Vancouver, ISO, and other styles

13

Dr.B.Sridevi, Priya R.Anantha, and V.S.Primiya. "PROPOSED WFQ BASED DYNAMIC BANDWIDTH ALLOCATION FOR MOBILE WIMAX APPLICATION." International Journal of Computational Science and Information Technology (IJCSITY) 2, May (2014): 1–11. https://doi.org/10.5281/zenodo.3548117.

Full text

Abstract:

<strong>ABSTRACT </strong> In this project, we proposed a framework to support heterogenous traffic with different QoS demand in WiMAX. This framework dynamically changes the bandwidth allocation (BA) for ongoing and new arrival connections based on network condition and service demand. The objective is to efficiently use the available bandwidth and provide QoS support in a fair manner. Dynamic allocation of spectrum prior to transmission can mitigate the starvation problem of Non Real time application. The WFQ based dynamic bandwidth allocation framework uses architecture that has packet sche

APA, Harvard, Vancouver, ISO, and other styles

14

Nanda Pratama, Agung. "Kelola Bandwidth Dengan Menerapkan Algoritma Per Connection Queue Pada Jaringan Komputer Rajawali Kupie." Management of Information System Journal 1, no. 2 (2023): 52–57. http://dx.doi.org/10.47065/mis.v1i2.520.

Full text

Abstract:

In this day and age generally in places of business using the internet wifi as a tourist attraction for endings, such as coffee shop business. However, it is not uncommon to find wifi facilities provided by coffee shops or coffee shops that cannot be used, usually this is caused by the many users of the wifi network, not to mention one of the users who performs downloading or streaming activities. This causes the allocation of available bandwidth to be captured entirely by users who carry out these activities, resulting in no allocation of the remaining bandwidth for other users. Therefore it

APA, Harvard, Vancouver, ISO, and other styles

15

Koutenský, Michal, Vladimír Veselý, and Vincenzo Maffione. "Addressing Bandwidth-Driven Flow Allocationin RINA." Computers 9, no. 3 (2020): 63. http://dx.doi.org/10.3390/computers9030063.

Full text

Abstract:

Effective capacity allocation is essential for a network to operate properly, providing predictable quality of service guarantees and avoiding bottlenecks. Achieving capacity allocation fairness is a long-standing problem extensively researched in the frame of transport and network layer protocols such as TCP/IP. The Recursive InterNetwork Architecture offers programmable policies that enable more flexible control on the mechanics of network flow allocation. In this paper, we present our version of one of these policies, which provides flow allocation according to the bandwidth requirements of

APA, Harvard, Vancouver, ISO, and other styles

16

KODIALAM, M., and V. VENKATESWARAN. "BANDWIDTH ALLOCATION IN MULTICAST TREES WITH QoS CONSTRAINTS." International Journal of Information Technology & Decision Making 02, no. 04 (2003): 619–27. http://dx.doi.org/10.1142/s0219622003000896.

Full text

Abstract:

Growth in continuous media applications and group communications highlight the need for efficient multicast support. In multicast tree construction and resource reservation a central problem is ensuring that the determined multicast tree can support specified QoS requirements economically. In this paper, we focus on this specific problem under a typical QoS requirement that end-to-end delays must not exceed a specified limit. For the resulting optimization problem, we develop a fast and efficient algorithm that is suitable for implementing a router to perform real time provisioning for multica

APA, Harvard, Vancouver, ISO, and other styles

17

Nikolaevskiy, Ilya, Andrey Lukyanenko, and Andrei Gurtov. "Nash Bargaining Solution Allocation is Not Suitable for Datacenter Jobs." International Game Theory Review 19, no. 01 (2017): 1750001. http://dx.doi.org/10.1142/s0219198917500013.

Full text

Abstract:

The Nash Bargaining Solution (NBS) has been broadly suggested as an effective solution for the problem of fair allocation of multiple resources, namely bandwidth allocation in datacenters. In spite of being thoroughly studied, and provably strategy-proof for most scenarios, NBS-based allocation methods lack research on the strategic behavior of tenants in the case of proportionality of resource demands, which is common in datacenter workloads. We found that misbehavior is beneficial: by lying about bandwidth demands tenants can improve their allocations. We show that a sequence of selfish impr

APA, Harvard, Vancouver, ISO, and other styles

18

Dai, Yong, Xilao Wu, Jincheng Zhao, et al. "A Flexible Ethernet Calendar Allocation Based on Client Traffic." Journal of Physics: Conference Series 2224, no. 1 (2022): 012131. http://dx.doi.org/10.1088/1742-6596/2224/1/012131.

Full text

Abstract:

Abstract Aiming at the problem of low link bandwidth utilization in the current FlexE client slot allocation mechanism, a FlexE calendar bandwidth allocation mechanism that is compatible with the client data transmission rate is proposed, and the LSTM algorithm is used to predict network traffic data, and according to the client priority and traffic prediction results, the client is allocated with slots. Experiments show that, compared with the traditional FlexE slot allocation mechanism, the method proposed in this paper can make the bandwidth resource utilization rate reach 82.8%.

APA, Harvard, Vancouver, ISO, and other styles

19

Huang, Jieyu, Ziqing Yang, Junwei Xie, Haowei Zhang, and Zhengjie Li. "Joint Power and Bandwidth Allocation in Collocated MIMO Radar Based on the Quality of Service Framework." Electronics 12, no. 12 (2023): 2567. http://dx.doi.org/10.3390/electronics12122567.

Full text

Abstract:

The simultaneous multi-beam working mode of the collocated multiple-input and multiple-output (MIMO) radar enables the radar to track multiple targets simultaneously. A joint power and bandwidth allocation algorithm in a collocated MIMO radar based on the quality of service (QoS) framework is proposed for the multi-target tracking problem with different threat levels. Firstly, a posterior Cramer–Rao lower bound (PCRLB) concerning the power and bandwidth is derived. In addition, the optimal objective functions of power and bandwidth are designed based on the QoS framework, and the problem is so

APA, Harvard, Vancouver, ISO, and other styles

20

Nwachukwu, Anthony Chukwuemeka, and Andrzej Karbowski. "Solution of the Simultaneous Routing and Bandwidth Allocation Problem in Energy-Aware Networks Using Augmented Lagrangian-Based Algorithms and Decomposition." Energies 17, no. 5 (2024): 1233. http://dx.doi.org/10.3390/en17051233.

Full text

Abstract:

We discuss several algorithms for solving a network optimization problem of simultaneous routing and bandwidth allocation in green networks in a decomposed way, based on the augmented Lagrangian. The problem is difficult due to the nonconvexity caused by binary routing variables. The chosen algorithms, which are several versions of the Multiplier Method, including the Alternating Direction Method of Multipliers (ADMM), have been implemented in Python and tested on several networks’ data. We derive theoretical formulations for the inequality constraints of the Bertsekas, Tatjewski and SALA meth

APA, Harvard, Vancouver, ISO, and other styles

21

Zhao, Hongwei, Jingyue You, Yangyang Wang, and Xike Zhao. "Offloading Strategy of Multi-Service and Multi-User Edge Computing in Internet of Vehicles." Applied Sciences 13, no. 10 (2023): 6079. http://dx.doi.org/10.3390/app13106079.

Full text

Abstract:

An edge computing offloading strategy was proposed with the goal of addressing the issue of low edge computing efficiency and service quality in the multi-service and multi-user intersections of networked vehicles. This strategy took into account all relevant factors, including the matching of users and service nodes, offloading ratio, bandwidth and computing power resource allocation, and system energy consumption. It is mainly divided into 2 tasks: (1) Service node selection: A fuzzy logic-based service node selection algorithm (SNFLC) is proposed. The linear equation for node performance va

APA, Harvard, Vancouver, ISO, and other styles

22

Vanitha, G., and P. Amudha. "Quality of Service Aware Dynamic Bandwidth Allocation for Rate Control in WSN." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 11s (2023): 166–76. http://dx.doi.org/10.17762/ijritcc.v11i11s.8083.

Full text

Abstract:

Different types of data can be generated by Wireless Sensor Networks (WSNs) in both Real-Time (RT) and Non-RT (NRT) scenarios. The combination of these factors, along with the limited bandwidth available, necessitates careful management of these categories in order to reduce congestion. Due to this, a Proficient Rate Control and Fair Bandwidth Allocation (PRC-FBA) method has been created that prioritizes certain types of traffic and creates a virtual queue for them.In PRC-FBA, the Signal-to-Noise and Interference Ratio (SINR) model is applied to the problem of bandwidth allocation in WSN in an

APA, Harvard, Vancouver, ISO, and other styles

23

R.Kennady, Et al. "Increased Task Execution with a Bandwidth-Aware Hadoop Scheduling Approach." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 2 (2023): 189–93. http://dx.doi.org/10.17762/ijritcc.v11i2.9830.

Full text

Abstract:

This research presents a novel bandwidth-aware Hadoop scheduling method that addresses the challenge of task scheduling in Hadoop clusters while considering the real-time network conditions. The proposed method involves the establishment of a job time completion model and a mathematical model for a Hadoop scheduling system. Furthermore, it transforms the Hadoop task scheduling problem into an optimization problem to find the task scheduling method that minimizes job completion time. By leveraging Software-Defined Networking (SDN) capabilities, a time slot-based network bandwidth allocation mec

APA, Harvard, Vancouver, ISO, and other styles

24

S. Nithya, Et al. "A Tutorial on Cross-layer Optimization Wireless Network System Using TOPSIS Method." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 10 (2023): 1809–17. http://dx.doi.org/10.17762/ijritcc.v11i10.8757.

Full text

Abstract:

Each other, leading to issues such as interference, limited bandwidth, and varying channel conditions. These challenges require specialized optimization techniques tailored to the wireless environment. In wireless communication networks is to maximize the overall system throughput while ensuring fairness among users and maintaining quality of service requirements. This objective can be achieved through resource allocation optimization, where the available network resources such as bandwidth, power, and time slots are allocated to users in an optimal manner. Optimization-based approaches in wir

APA, Harvard, Vancouver, ISO, and other styles

25

Rustiawan, Angga, Hendra Nelva Saputra, and Alfiah Fajriani. "Design of Network Device Placement and Bandwidth Allocation Using Simple Queue Method." Inform : Jurnal Ilmiah Bidang Teknologi Informasi dan Komunikasi 10, no. 1 (2025): 53–60. https://doi.org/10.25139/inform.v10i1.9182.

Full text

Abstract:

Network usage that is not properly managed often leads to unfair bandwidth distribution and unstable internet connections. This problem causes slow internet connections and disruptions to activities that require internet connectivity. The solution to this problem is structured bandwidth management using Simple Queue. Network configuration is performed on the router to distribute bandwidth to all ports connected to the switch, and then PCQ (Per Connection Queue) can limit bandwidth for each user. The research methodology uses the Network Development Life Cycle (NDLC) with analysis, design, simu

APA, Harvard, Vancouver, ISO, and other styles

26

Oluwatobi, Akinmerese, Awodele Oludele, Makinwa Kofi, Kuyoro Shade, and Adedeji Folasade. "A Study of Network Optimization Models for High-Performance Networks." International Journal of Innovative Science and Research Technology 8, no. 5 (2023): 2664–70. https://doi.org/10.5281/zenodo.8021560.

Full text

Abstract:

An important feature of a bandwidth optimization system is the adequate provision of internet services with high data rates and wide coverage. Low bandwidth causes poor internet speed, network downtime, constant network traffic congestion and network unavailability during peak and off-peak periods, to mention a few. Existing research on bandwidth optimization focused on bandwidth allocation in creating different channels and traffic isolation to Guarantee good Quality of Service (QoS). Despite several optimization techniques and bandwidth allocation algorithms of existing researchers, there is

APA, Harvard, Vancouver, ISO, and other styles

27

Huang, Wuwei, Yang Yang, Mingzhe Chen, Chuanhong Liu, Chunyan Feng, and H. Vincent Poor. "Wireless Network Optimization for Federated Learning with Model Compression in Hybrid VLC/RF Systems." Entropy 23, no. 11 (2021): 1413. http://dx.doi.org/10.3390/e23111413.

Full text

Abstract:

In this paper, the optimization of network performance to support the deployment of federated learning (FL) is investigated. In particular, in the considered model, each user owns a machine learning (ML) model by training through its own dataset, and then transmits its ML parameters to a base station (BS) which aggregates the ML parameters to obtain a global ML model and transmits it to each user. Due to limited radio frequency (RF) resources, the number of users that participate in FL is restricted. Meanwhile, each user uploading and downloading the FL parameters may increase communication co

APA, Harvard, Vancouver, ISO, and other styles

28

Mathonsi, Topside E., Tshimangadzo Mavin Tshilongamulenzhe, and Bongisizwe Erasmus Buthelezi. "Enhanced Resource Allocation Algorithm for Heterogeneous Wireless Networks." Journal of Advanced Computational Intelligence and Intelligent Informatics 24, no. 6 (2020): 763–73. http://dx.doi.org/10.20965/jaciii.2020.p0763.

Full text

Abstract:

In heterogeneous wireless networks, service providers typically employ multiple radio access technologies to satisfy the requirements of quality of service (QoS) and improve the system performance. However, many challenges remain when using modern cellular mobile communications radio access technologies (e.g., wireless local area network, long-term evolution, and fifth generation), such as inefficient allocation and management of wireless network resources in heterogeneous wireless networks (HWNs). This problem is caused by the sharing of available resources by several users, random distributi

APA, Harvard, Vancouver, ISO, and other styles

29

Chao, Wang, Zhang Dalong, and Ran Xiaomin. "Regional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism." MATEC Web of Conferences 176 (2018): 01020. http://dx.doi.org/10.1051/matecconf/201817601020.

Full text

Abstract:

Aiming at the problem of link congestion caused by the shortage of network bandwidth resources at the user end, this paper first proposes a regional load balancing idea. Then, for the problem of bandwidth resource allocation in regional load balancing, a bandwidth allocation model is established and a dynamic auction algorithm is proposed. The algorithm calculates the link quality and stability by constructing a link model, and introduces the auction bandwidth to the auctioneer's incentive degree to obtain the auction bidding function. The simulation results show that the algorithm can effecti

APA, Harvard, Vancouver, ISO, and other styles

30

Gao, Wei, Lei Wang, and Lianzheng Qu. "Research on Joint Resource Allocation for Multibeam Satellite Based on Metaheuristic Algorithms." Entropy 24, no. 11 (2022): 1536. http://dx.doi.org/10.3390/e24111536.

Full text

Abstract:

With the rapid growth of satellite communication demand and the continuous development of high-throughput satellite systems, the satellite resource allocation problem—also called the dynamic resources management (DRM) problem—has become increasingly complex in recent years. The use of metaheuristic algorithms to obtain acceptable optimal solutions has become a hot topic in research and has the potential to be explored further. In particular, the treatment of invalid solutions is the key to algorithm performance. At present, the unused bandwidth allocation (UBA) method is commonly used to addre

APA, Harvard, Vancouver, ISO, and other styles

31

Agrawal, Himangi, and Tanya Gupta. "CLOUD COMPUTING: A LATENCY AND BANDWIDTH COST OPTIMIZATION PERSPECTIVE." International Journal of Technical Research & Science 9, Spl (2024): 27–35. http://dx.doi.org/10.30780/specialissue-iset-2024/024.

Full text

Abstract:

Cloud providers are forced to run numerous datacenters throughout the world to host their cloud services due to end-user latency and regulatory requirements. Request allocation, the process of allocating each user request to the best data center to benefit cloud providers, is an emerging issue under such geo-distributed architecture. Nevertheless, previous request allocation solutions have serious drawbacks: They either only optimize benefits for one party (providers or users, for example) or neglect some important but realistic factors (various per-unit bandwidth costs among datacenters and h

APA, Harvard, Vancouver, ISO, and other styles

32

Song, Qing Yang, Ming Hong Yue, and Zhao Long Ning. "A Satisfaction-Based Dynamic Bandwidth Allocation Algorithm for Heterogeneous Wireless Network." Applied Mechanics and Materials 220-223 (November 2012): 2004–7. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.2004.

Full text

Abstract:

Due to the limited bandwidth resources, traditional networks can not completely guarantee the Quality of Service (QoS) among users with new class, thus how to allocate network resource effectively becomes a very important problem. In this paper, we propose an algorithm for an integrated cellular/WLAN network, namely Satisfaction-based Dynamic Bandwidth Allocation (SDBA) algorithm. The main objective is to guarantee users’ satisfaction through allocating network resource dynamically according to proportional fairness based degradation and one-by-one search based degradation. Numerical results s

APA, Harvard, Vancouver, ISO, and other styles

33

Kwon, Doyle, and Duk Kyung Kim. "Resource Allocation with a Rate Guarantee Constraint in Device-to-Device Underlaid Cellular Networks." Electronics 9, no. 3 (2020): 438. http://dx.doi.org/10.3390/electronics9030438.

Full text

Abstract:

Device-to-device (D2D) communication is a crucial technique for various proximity services. In addition to high-rate transmission and high spectral efficiency, a minimum data rate is increasingly required in various applications, such as gaming and real-time audio/video transmission. In this paper, we consider D2D underlaid cellular networks and aim to minimize the total channel bandwidth while every user equipment (UE) needs to achieve a pre-determined target data rate. The optimization problem is jointly involved with matching a cellular UE (CU) to a D2D UE (DU), and with channel assignment

APA, Harvard, Vancouver, ISO, and other styles

34

Kołtyś, Kamil, Piotr Pałka, Eugeniusz Toczyłowski, and Izabela Żółtowska. "Multicommodity Auction Model for Indivisible Network Resource Allocation." Journal of Telecommunications and Information Technology, no. 4 (June 26, 2023): 60–66. http://dx.doi.org/10.26636/jtit.2008.4.900.

Full text

Abstract:

In this paper we present the multicommodity auction model BCBT-I that allocates indivisible network resources among bidders. The approach can be considered as a generalization of the basic multicommodity model for balancing communication bandwidth trade (BCBT). The BCBT model assumes that offers concerning inter-node links and point-to-point bandwidth demands can be realized partially. However, in the real-world trade there might be a need to include ca- pacity modularity in the market balancing process. Thus we state the model for balancing communication bandwidth trade that takes into accoun

APA, Harvard, Vancouver, ISO, and other styles

35

Prabhu Chandran, K., and Ramesh G. P. "Power and resource allocation for MIMO based two-tier heterogeneous network using small cell clustering algorithm." International Journal of Engineering & Technology 7, no. 1.2 (2017): 135. http://dx.doi.org/10.14419/ijet.v7i1.2.9039.

Full text

Abstract:

Resource allocation problem in the two-tier heterogen eous MIMO network plays a vital role in avoidance of interference between the mobile users connected to the host directly and through the backhaul link. Two different frequency bandwidths are proposed to avoid the interference generated between the users placed in the interference region in the small cell. The mobile user frequency range is allotted for the link between small cell base station, macrocell base station and mobile user and millimeter frequency bandwidth is utilized between the small cell base station, small cell cluster heads

APA, Harvard, Vancouver, ISO, and other styles

36

M. C., Patel, and Mandloi A. S. "An Improved Polling Mechanism for Dynamic Bandwidth Allocation of XGPON Networks." International Journal for Research in Applied Science and Engineering Technology 11, no. 12 (2023): 1850–58. http://dx.doi.org/10.22214/ijraset.2023.57744.

Full text

Abstract:

Abstract: One of the most well-known technologies that offers a large range of services at user’s fingertips without requiring the least amount of infrastructure is passive optical networks. This can be due to a particular component known as the passive optical spiller. In order to facilitate time division access for individual ONUs on a single optical fiber, the appropriate dynamic bandwidth allocation mechanism must be present at the OLT with the advent of user support. For bandwidth assignment by DBA, it is essential to determine the precious upstream bandwidth demand, and can be aided by t

APA, Harvard, Vancouver, ISO, and other styles

37

Li, X. B., L. Dan, and Q. Wu. "An Epon Dynamic Bandwidth Allocation Algorithm Based on the Least Mean Square Prediction." Advanced Materials Research 216 (March 2011): 574–78. http://dx.doi.org/10.4028/www.scientific.net/amr.216.574.

Full text

Abstract:

To ensure different priorities of different services, for instance the voice, video and data, EPON dynamic bandwidth allocation algorithm must be able to accurately predict frames between the two authorizations. In respect to this problem,this paper presents a multi-queue scheduling EPON dynamic bandwidth allocation algorithm on the basis of the least mean square prediction and illustrates the specific algorithm as well as the algorithm simulation. Simulation results show that this scheme can predict the frames of high-priority services and reasonably allocates bandwidth based on the predictio

APA, Harvard, Vancouver, ISO, and other styles

38

Lemeshko, Oleksandr, Oleksandra Yeremenko, Larysa Titarenko, and Alexander Barkalov. "Hierarchical Queue Management Priority and Balancing Based Method under the Interaction Prediction Principle." Electronics 12, no. 3 (2023): 675. http://dx.doi.org/10.3390/electronics12030675.

Full text

Abstract:

This work is devoted to improving a two-level hierarchical queue management method based on priority and balancing under the interaction prediction principle. The lower level of calculations was connected with the problem optimization solution and was responsible for two tasks. Firstly, the packet flow aggregation and distribution among the macro-queues and sub-queues organized on the router interface must solve the congestion management problem. Secondly, the resource allocation problem solution was related to the balanced allocation of interface bandwidth among the sub-queues, which were wei

APA, Harvard, Vancouver, ISO, and other styles

39

Li, Shiyong, Yue Zhang, and Wei Sun. "Optimal Resource Allocation Model and Algorithm for Elastic Enterprise Applications Migration to the Cloud." Mathematics 7, no. 10 (2019): 909. http://dx.doi.org/10.3390/math7100909.

Full text

Abstract:

Cloud computing has been widely used in various industries in recent years. However, when migrating enterprise applications into the cloud, enterprise users face a problem with minimizing migration time and cloud resource providers face a dilemma of resource allocation problem, with the objective of maximizing the migration utility of enterprise users while minimizing the cost of cloud resource providers. In order to achieve them, this paper considered cloud migration objectives including cloud migration time, cloud migration utility, and cloud data center cost, and proposed a resource allocat

APA, Harvard, Vancouver, ISO, and other styles

40

Lai, Jiunn-Ru, Hsin-Yi Huang, Wen-Ping Chen, Luke K. Wang, and Ming-Yuan Cho. "Design and Analytical Analysis of a Novel DBA Algorithm with Dual-Polling Tables in EPON." Mathematical Problems in Engineering 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/919278.

Full text

Abstract:

Ethernet passive optical network is a point-to-multipoint structure, and an effective media access protocol should be designed for collision avoidance and bandwidth allocation. Most previous researches have aimed to solve the problem using dynamic bandwidth allocation (DBA) algorithms with polling-based schemes. Unfortunately, idle channel time among the polling cycles cannot be overcome efficiently. In this paper, a dual-polling DBA (DP-DBA) algorithm which consists of an interpolling mechanism and an intrapolling mechanism is proposed. The interpolling mechanism helps eliminate the idle time

APA, Harvard, Vancouver, ISO, and other styles

41

Li, Donghao, Binfang Du, and Zhiquan Bai. "Deep Reinforcement Learning-Enabled Trajectory and Bandwidth Allocation Optimization for UAV-Assisted Integrated Sensing and Covert Communication." Drones 9, no. 3 (2025): 160. https://doi.org/10.3390/drones9030160.

Full text

Abstract:

The growing interest in integrated sensing and communication (ISAC) has accelerated the development of unmanned aerial vehicles (UAVs) and drones for secure data transmission. In this study, the optimization of UAV trajectory and bandwidth allocation within the ISAC framework is investigated, with a focus on covert communication under energy constraints. We propose a novel deep reinforcement learning (DRL) algorithm, Soft Actor-Critic for Covert Communication and Charging (SAC-CC), to address this problem. The SAC-CC algorithm maximizes the CCTR by dynamically allocating bandwidth for sensing

APA, Harvard, Vancouver, ISO, and other styles

42

Wu, Jian, Min Jia, Liang Zhang, and Qing Guo. "DNNs Based Computation Offloading for LEO Satellite Edge Computing." Electronics 11, no. 24 (2022): 4108. http://dx.doi.org/10.3390/electronics11244108.

Full text

Abstract:

Huge low earth orbit (LEO) satellite networks can achieve global coverage with low latency. In addition, mobile edge computing (MEC) servers can be mounted on LEO satellites to provide computing offloading services for users in remote areas. A multi-user multi-task system model is modeled and the problem of user’s offloading decisions and bandwidth allocation is formulated as a mixed integer programming problem to minimize the system utility function expressed as the weighted sum of the system energy consumption and delay. However, it cannot be effectively solved by general optimizations. Thus

APA, Harvard, Vancouver, ISO, and other styles

43

Liu, Yazhi, Dongyu Wei, Chunyang Zhang, and Wei Li. "Distributed Bandwidth Allocation Strategy for QoE Fairness of Multiple Video Streams in Bottleneck Links." Future Internet 14, no. 5 (2022): 152. http://dx.doi.org/10.3390/fi14050152.

Full text

Abstract:

In QoE fairness optimization of multiple video streams, a distributed video stream fairness scheduling strategy based on federated deep reinforcement learning is designed to address the problem of low bandwidth utilization due to unfair bandwidth allocation and the problematic convergence of distributed algorithms in cooperative control of multiple video streams. The proposed strategy predicts a reasonable bandwidth allocation weight for the current video stream according to its player state and the global characteristics provided by the server. Then the congestion control protocol allocates t

APA, Harvard, Vancouver, ISO, and other styles

44

Olszewski, Ireneusz. "Spectrum Allocation Policy in Elastic Optical Networks." International Journal of Electronics and Telecommunications 63, no. 4 (2017): 423–29. http://dx.doi.org/10.1515/eletel-2017-0053.

Full text

Abstract:

Abstract The considered problem covers routing and spectrum allocation problem (RSA problem) in Elastic Optical Networks while maintaining the spectrum continuity constraints, non-overlapping spectra constraints for adjacent connections on individual links of the network and spectrum contiguity constraints of the connection. In this article the modified version of the First Fit spectrum slot allocation policy for Fixed Alternate Routing in flexible optical networks has been proposed. The Fixed Alternate Routing with proposed spectrum allocation policy rejects fewer requests, provides less band

APA, Harvard, Vancouver, ISO, and other styles

45

Lin, Di, and Fabrice Labeau. "An Algorithm That Predicts CSI to Allocate Bandwidth for Healthcare Monitoring in Hospital's Waiting Rooms." International Journal of Telemedicine and Applications 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/843527.

Full text

Abstract:

In wireless healthcare monitoring systems, bandwidth allocation is an efficient solution to the problem of scarce wireless bandwidth for the monitoring of patients. However, when the central unit cannot access the exact channel state information (CSI), the efficiency of bandwidth allocation decreases, and the system performance also decreases. In this paper, we propose an algorithm to reduce the negative effects of imperfect CSI on system performance. In this algorithm, the central unit can predict the current CSI by previous CSI when the current CSI is not available. We analyze the reliabilit

APA, Harvard, Vancouver, ISO, and other styles

46

Yuan, Yuxia, and Zengyong Xu. "Computing resource allocation scheme based on edge computing under augmented reality application." Journal of High Speed Networks 28, no. 3 (2022): 143–56. http://dx.doi.org/10.3233/jhs-220687.

Full text

Abstract:

Edge computing can place computing, storage, bandwidth, application and other resources on the edge of the network to reduce transmission delay, and bandwidth limitation for users. Therefore, task scheduling and resource allocation in edge computing have become a new research focus. In view of the dynamic nature of computing resources in edge computing and the computing power limitation of a single computing resource, this paper proposes a computing resource allocation scheme based on edge computing under augmented reality (AR) application. On the premise of ensuring the completion time of sub

APA, Harvard, Vancouver, ISO, and other styles

47

Gao, Xiangqiang, Yingzhao Shao, Yuanle Wang, Hangyu Zhang, and Yang Liu. "Cooperative Caching and Resource Allocation in Integrated Satellite–Terrestrial Networks." Electronics 13, no. 7 (2024): 1216. http://dx.doi.org/10.3390/electronics13071216.

Full text

Abstract:

Due to the rapid development of low earth orbit satellite constellations, e.g., Starlink, OneWeb, etc., integrated satellite-terrestrial networks have been viewed as a promising paradigm to globally provide satellite internet services for users. However, when the contents from ground data centers are provided for users by satellite networks, there will be high capital expenditures in terms of communication delay and bandwidth usage. To this end, in this paper, a cooperative-caching and resource-allocation problem is investigated in integrated satellite–terrestrial networks. Popular contents, w

APA, Harvard, Vancouver, ISO, and other styles

48

Abubakar Ibrahim, Adamu, Sanjir Inam Salsabil, and Ibrahim A. Lawal. "Effective Utilization of An Unused Bandwidth in IEEE 802.16 Network." Journal of Telecommunication, Electronic and Computer Engineering (JTEC) 14, no. 2 (2022): 15–22. http://dx.doi.org/10.54554/jtec.2022.14.02.003.

Full text

Abstract:

A large percentage of available bandwidth in IEEE 802.16 networks can be utilised by using previous unused bandwidth. This is a common problem that occurs inside IEEE 802.16 networks, and it manifests itself when a subscriber station in an IEEE 802.16 network's Quality of Service (QOS) assured services is unable to predict how much data is being held back as unused bandwidth. As a direct consequence of this fact, the ongoing research has proposed simulating the process by which the remainder of the reserved bandwidth that is not being used will be recycled in order to enhance the Quality of Se

APA, Harvard, Vancouver, ISO, and other styles

49

Ogryczak, Włodzimierz, Adam Wierzbicki, and Tomasz Śliwiński. "Fair resource allocation schemes and network dimensioning problems." Journal of Telecommunications and Information Technology, no. 3 (September 30, 2003): 34–42. http://dx.doi.org/10.26636/jtit.2003.3.193.

Full text

Abstract:

Resource allocation problems are concerned with the allocation of limited resources among competing activities so as to achieve the best overall performances of the system but providing fair treatment of all the competitors. Telecommunication networks are facing the increasing demand for Internet services. Therefore, a problem of network dimensioning with elastic traffic arises which requires to allocate bandwidth to maximize service flows with fair treatment of all the services. In such applications, the so-called max-min fairness (MMF) solution concept is widely used to formulate the resourc

APA, Harvard, Vancouver, ISO, and other styles

50

Vedantham, Sundararajan, and S. S. Iyengar. "The Bandwidth Allocation Problem in the ATM network model is NP-complete." Information Processing Letters 65, no. 4 (1998): 179–82. http://dx.doi.org/10.1016/s0020-0190(98)00226-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!