Log in

Relevant bibliographies by topics / Bandwidth allocation algorithms / Journal articles

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

Journal articles on the topic 'Bandwidth allocation algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 2 February 2022

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 algorithms.'

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

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 power allocation iterative algorithm based on duality theory is then proposed to obtain the optimal solution of this optimization problem. Compared with the existing separate bandwidth or power optimal allocation algorithms, it is shown that the joint allocation algorithm improves both the total system capacity and the fairness among spot beams. Moreover, it is easy to be implemented in practice, as the computational complexity of the proposed algorithm is linear with the number of spot beams.

APA, Harvard, Vancouver, ISO, and other styles

2

Hsu, Ivy, and Jean Walrand. "Dynamic bandwidth allocation for ATM switches." Journal of Applied Probability 33, no. 3 (1996): 758–71. http://dx.doi.org/10.2307/3215357.

Full text

Abstract:

We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence on accurate traffic models and thus simplify the tasks of supplying traffic statistics required of network users. In this paper we present two dynamic algorithms. The objective of these algorithms is to find the minimum bandwidth necessary to satisfy a cell loss probability constraint at an asynchronous transfer mode (ATM) switch. We show that in both schemes the bandwidth chosen by the algorithm approaches the optimal value almost surely. Furthermore, in the second scheme, which determines the point closest to the optimal bandwidth from a finite number of choices, the expected learning time is finite.

APA, Harvard, Vancouver, ISO, and other styles

3

Hsu, Ivy, and Jean Walrand. "Dynamic bandwidth allocation for ATM switches." Journal of Applied Probability 33, no. 03 (1996): 758–71. http://dx.doi.org/10.1017/s0021900200100191.

Full text

Abstract:

We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence on accurate traffic models and thus simplify the tasks of supplying traffic statistics required of network users. In this paper we present two dynamic algorithms. The objective of these algorithms is to find the minimum bandwidth necessary to satisfy a cell loss probability constraint at an asynchronous transfer mode (ATM) switch. We show that in both schemes the bandwidth chosen by the algorithm approaches the optimal value almost surely. Furthermore, in the second scheme, which determines the point closest to the optimal bandwidth from a finite number of choices, the expected learning time is finite.

APA, Harvard, Vancouver, ISO, and other styles

4

Sikora, Pavel, Tomas Horvath, Petr Munster, and Vaclav Oujezsky. "Efficiency Tests of DBA Algorithms in XG-PON." Electronics 8, no. 7 (2019): 762. http://dx.doi.org/10.3390/electronics8070762.

Full text

Abstract:

Sophisticated dynamic bandwidth allocation (DBA) algorithms can dramatically improve or worsen throughput and delay in whole networks. It is very important to choose the right DBA algorithm. Our work tests static assignment and three DBA algorithms, namely GigaPON Access Network DBA, Hybrid Reporting Allocation, and modified Max–Min Fair. All tests were made on our simulator of ten-gigabit passive optical network DBA specially developed for testing DBA algorithms. The tests verify delay of each optical network unit and amount of waste with bandwidth. This paper describes how the used DBA algorithms work and the processes involved in DBA algorithms.

APA, Harvard, Vancouver, ISO, and other styles

5

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 simulation based on a traffic model introduced here.

APA, Harvard, Vancouver, ISO, and other styles

6

Meng, Fan Bo, Tai Yi Fu, Jun Nan Wang, Jing Tao Yu, and Chan Nan Zhu. "Performance Evaluation of Ethernet Passive Optical Network for Smart Grid." Applied Mechanics and Materials 667 (October 2014): 149–52. http://dx.doi.org/10.4028/www.scientific.net/amm.667.149.

Full text

Abstract:

As a mature access technology for the communication in smart grid, Ethernet Passive Optical Network (EPON) is widely considered as a promising solution due to high bandwidth capacity and stability. In recent years, EPON technology has received much attention and introduced into smart grid. The particularity of smart grid largely depends on bandwidth allocation. In this paper, we evaluate the performances of smart grid with three bandwidth allocation algorithms, i.e., Poll with Stop (PS), Max and Min Bandwidth Bounds (MMBB) and Cyclic Strategy (CS), respectively. The simulation results in this paper show the advantages of CS algorithm in terms of packet delay and throughput.

APA, Harvard, Vancouver, ISO, and other styles

7

Peng, Zhi Wen, and P. J. Radcliffe. "Study on Dynamic Bandwidth Allocation Algorithms Based on EPON." Advanced Materials Research 433-440 (January 2012): 5243–49. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.5243.

Full text

Abstract:

The use of EPON for network allocation is gradually becoming the main stream for broadband network. This technology makes full use of the features of optical network and passive optical splitter to reduce equipment costs, operation and maintenance costs for network operators and to provide faster and more stable broadband network for users. The article introduces the working principle of EPON, establishes EPON system based on OPNET technology, analyzes the current bandwidth allocation algorithm, and proposes improvement to the algorithm. Experimental emulation finds that the new algorithm can provide good QOS service and is greatly improved in the aspects of packet delay, average queue and bandwidth utilization rate.

APA, Harvard, Vancouver, ISO, and other styles

8

Chowdhury, Shyamal, and Kazem Sohraby. "Bandwidth allocation algorithms for packet video in ATM networks." Computer Networks and ISDN Systems 26, no. 9 (1994): 1215–23. http://dx.doi.org/10.1016/0169-7552(94)90019-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lei, Jianjun, Jiarui Tao, and Shanshan Yang. "Joint AP Association and Bandwidth Allocation Optimization Algorithm in High-Dense WLANs." Future Internet 10, no. 8 (2018): 73. http://dx.doi.org/10.3390/fi10080073.

Full text

Abstract:

Regarding access point (AP) overload and performance anomaly which is caused by mobile terminals with different bitrates, a joint AP association and bandwidth allocation optimization algorithm is presented in this paper. Meanwhile, load balancing and proportional fairness are analyzed and formulated as an optimization model. Then, we present a Fair Bandwidth Allocation algorithm based on clients’ Business Priority (FBA-BP), which allocates bandwidth based on the bandwidth demand of clients and their business priority. Furthermore, we propose a Categorized AP Association algorithm based on clients’ demands (CAA-BD), which classifies APs by different types of clients and chooses an optimal associating AP for a new client according to AP categories and the aggregated demand transmission time that are calculated by the FBA-BP algorithm. The CAA-BD can achieve load balance and solve the performance anomaly caused by multi-rate clients coexisting. The simulation results show that our proposed algorithm obtains significant performance in terms of AP utilization, throughput, transmission delay and channel fairness in different client density levels compared with the categorized and Strong Signal First (SSF) algorithms.

APA, Harvard, Vancouver, ISO, and other styles

10

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 problem while the intrapolling part aggregates the unused bandwidth of the light-loaded users and those due to nondefragmentation of the Ethernet frames of the general users. We also evaluate the performance of the DP-DBA algorithm by a comparison with the interleaved polling with adaptive cycle time (IPACT), the dynamic bandwidth allocation with a modified grant table generation algorithm (DBA2), the Double-Phase Polling (DPP), and the adaptive DBA algorithm with sorting report messages (Sort-DBA) schemes with simulation results. For greater realism with regard to general applications, we also simulate the asymmetric traffic loads at the optical network units (ONUs).The results show that DP-DBA outperforms the other DBA schemes under asymmetric load conditions.

APA, Harvard, Vancouver, ISO, and other styles

11

Andrews, Matthew, Simon C. Borst, Francis Dominique, et al. "Dynamic bandwidth allocation algorithms for high-speed data wireless networks." Bell Labs Technical Journal 3, no. 3 (2002): 30–49. http://dx.doi.org/10.1002/bltj.2114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

McGarry, M. P., M. Maier, and M. Reisslein. "Ethernet PONs: a survey of dynamic bandwidth allocation (DBA) algorithms." IEEE Communications Magazine 42, no. 8 (2004): S8–15. http://dx.doi.org/10.1109/mcom.2004.1321381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Mcgarry, Michael, Martin Reisslein, and Martin Maier. "Ethernet passive optical network architectures and dynamic bandwidth allocation algorithms." IEEE Communications Surveys & Tutorials 10, no. 3 (2008): 46–60. http://dx.doi.org/10.1109/comst.2008.4625804.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Bhatia, Randeep, Adrian Segall, and Gil Zussman. "Analysis of bandwidth allocation algorithms for wireless personal area networks." Wireless Networks 12, no. 5 (2006): 589–603. http://dx.doi.org/10.1007/s11276-006-6537-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Shen, Yushi, Pamela C. Cosman, Laurence B. Milstein, and Eduardo F. Martinez. "On Uplink Channel Estimation in WiMAX Systems." International Journal of Mobile Computing and Multimedia Communications 2, no. 2 (2010): 67–77. http://dx.doi.org/10.4018/jmcmc.2010040105.

Full text

Abstract:

In this paper, channel estimation algorithms are proposed and compared for uplink WiMAX systems, which are OFDMA based. These algorithms are investigated based on a dynamic resource allocation scheme, and it is shown that each of them is suitable to specific system scenarios. For example, for a system with a bandwidth of 10MHz operating in the low frequency region (2-11GHz), a two-dimensional averaging algorithm outperforms other algorithms, such as a bilinear interpolation algorithm, because the correlations between the pilots and signals are sufficiently high in both the frequency and the time dimensions.

APA, Harvard, Vancouver, ISO, and other styles

16

Leng, Supeng, K. R. Subramanian, N. Sundararajan, and P. Saratchandran. "Novel Neutral Network Approach to Call Admission Control in High-speed Networks." International Journal of Neural Systems 13, no. 04 (2003): 251–62. http://dx.doi.org/10.1142/s0129065703001571.

Full text

Abstract:

This paper presents a novel Call Admission Control (CAC) scheme which adopts the neural network approach, namely Minimal Resource Allocation Network (MRAN) and its extended version EMRAN. Though the current focus is on the Call Admission Control (CAC) for Asynchronous Transfer Mode (ATM) networks, the scheme is applicable to most high-speed networks. As there is a need for accurate estimation of the required bandwidth for different services, the proposed scheme can offer a simple design procedure and provide a better control in fulfilling the Quality of Service (QoS) requirements. MRAN and EMRAN are on-line learning algorithms to facilitate efficient admission control in different traffic environments. Simulation results show that the proposed CAC schemes are more efficient than the two conventional CAC approaches, the Peak Bandwidth Allocation scheme and the Cell Loss Ratio (CLR) upperbound formula scheme. The prediction precision and computational time of MRAN and EMRAN algorithms are also investigated. Both MRAN and EMRAN algorithms yield similar performance results, but the EMRAN algorithm has less computational load.

APA, Harvard, Vancouver, ISO, and other styles

17

Tang, Feilong, Ilsun You, Minyi Guo, Song Guo, and Long Zheng. "Balanced Bipartite Graph Based Register Allocation for Network Processors in Mobile and Wireless Networks." Mobile Information Systems 6, no. 1 (2010): 65–83. http://dx.doi.org/10.1155/2010/986192.

Full text

Abstract:

Mobile and wireless networks are the integrant infrastructure of mobile and pervasive computing that aims at providing transparent and preferred information and services for people anytime anywhere. In such environments, end-to-end network bandwidth is crucial to improve user's transparent experience when providing on-demand services such as mobile video playing. As a result, powerful computing power is required for networked nodes, especially for routers. General-purpose processors cannot meet such requirements due to their limited processing ability, and poor programmability and scalability. Intel's network processor IXP is specially designed for fast packet processing to achieve a broad bandwidth. IXP provides a large number of registers to reduce the number of memory accesses. Registers in an IXP are physically partitioned as two banks so that two source operands in an instruction have to come from the two banks respectively, which makes the IXP register allocation tricky and different from conventional ones. In this paper, we investigate an approach for efficiently generating balanced bipartite graph and register allocation algorithms for the dual-bank register allocation in IXPs. The paper presents a graph uniform 2-way partition algorithm (FPT), which provides an optimal solution to the graph partition, and a heuristic algorithm for generating balanced bipartite graph. Finally, we design a framework for IXP register allocation. Experimental results demonstrate the framework and the algorithms are efficient in register allocation for IXP network processors.

APA, Harvard, Vancouver, ISO, and other styles

18

SHU, Jin, and Wei GUO. "Efficient Bandwidth and Power Allocation Algorithms for Multiuser MIMO-OFDM Systems." International Journal of Communications, Network and System Sciences 02, no. 06 (2009): 504–10. http://dx.doi.org/10.4236/ijcns.2009.26055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Wenye Wang, Xinbing Wang, and A. A. Nilsson. "Energy-efficient bandwidth allocation in wireless networks: algorithms, analysis, and simulations." IEEE Transactions on Wireless Communications 5, no. 5 (2006): 1103–14. http://dx.doi.org/10.1109/twc.2006.1633363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Chou, L. D., and J. L. C. Wu. "Bandwidth allocation of virtual paths using neural-network-based genetic algorithms." IEE Proceedings - Communications 145, no. 1 (1998): 33. http://dx.doi.org/10.1049/ip-com:19981662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Liu, Yafan, Chen Qian, Bingyao Cao, et al. "Staged optimization algorithms based MAC dynamic bandwidth allocation for OFDMA-PON." Optics Communications 369 (June 2016): 220–25. http://dx.doi.org/10.1016/j.optcom.2016.02.055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Rawshan, Fahmida, and Youngil Park. "Architecture of multi-OLT PON systems and its bandwidth allocation algorithms." Photonic Network Communications 25, no. 2 (2013): 95–104. http://dx.doi.org/10.1007/s11107-013-0394-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Lee, Jeng Farn, Meng Chang Chen, Ming Tat Ko, and Wanjiun Liao. "Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy." Information Processing Letters 97, no. 6 (2006): 238–43. http://dx.doi.org/10.1016/j.ipl.2005.11.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

SU, XIAO, and BENJAMIN W. WAH. "LOSS AWARE RATE ALLOCATIONS IN H.263 CODED VIDEO TRANSMISSIONS." Journal of Circuits, Systems and Computers 14, no. 06 (2005): 1157–71. http://dx.doi.org/10.1142/s0218126605002878.

Full text

Abstract:

For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose loss aware rate allocations in both group-of-block (GOB) level and macroblock level, given that certain packets are lost during transmissions and reconstructed using simple interpolation methods at the receiver side. Experimental results show that our proposed algorithms can produce videos of higher quality when sent over lossy Internet.

APA, Harvard, Vancouver, ISO, and other styles

25

Horvath, Tomas, Petr Munster, Josef Vojtech, and Ondrej Havlis. "Modified GIANT Dynamic Bandwidth Allocation Algorithm of NG-PON." Journal of Communications Software and Systems 13, no. 1 (2017): 15. http://dx.doi.org/10.24138/jcomss.v13i1.243.

Full text

Abstract:

Gigabit passive optical networks have been widely deployed due to the fact that the cost of their implementation is still decreasing. What is more important, we are facing theproblem with increasing demands on the transmission bandwidth. Regarding this issue, the ITU develops another two standards supporting higher downstream bitrate. The XG-PON standard is the first platform under the developing, and the NG-PON2 is the second standard. The first one provides compatibility and increases the downstream capacity of 10 Gbit/s and the second standard has the same assumptions, but does not have backward compatibility. In this article, we discuss only XG-PON networks. We choose amendment as the dynamic bandwidth allocation algorithms, and we have compared it with the original specification and with our modification. The primary intention of that modification is to reduce the delay of Triple Play (data, video, and voice) services. These services are represented by TCONT (Transmission Container), which is used to improve the PON system upstream bandwidth allocation and transmission status dynamically. As NS-3 simulator does not support the direct mapping of Triple Play services into T-CONT and their labeling. We focus on a delay value for Triple Play services which was reduced by own modification in a GIANT algorithm. On the other hand, we cannot reduce the delay value for VoIP services because it has the highest priority by T-CONT.

APA, Harvard, Vancouver, ISO, and other styles

26

Zhao, Zhong Nan, Jian Wang, and Hong Wei Guo. "A Novel Algorithm for Multiuser Resource Allocation of OFDM." Advanced Materials Research 981 (July 2014): 440–43. http://dx.doi.org/10.4028/www.scientific.net/amr.981.440.

Full text

Abstract:

Orthogonal Frequency Division Multiplexing is considered as the key technology of the fourth generation of mobile communication technology. In this paper, an idea is proposed which solves the issue of multiuser resource allocation for OFDM based on swarm intelligence theory, and terminal bandwidth limitation is set as constraints addition as well. Theoretically, swarm intelligence algorithm could allocate resources more efficient and simulation results show that the proposed method is able to achieve better performance and higher system data rate than other similar algorithms under the same condition.

APA, Harvard, Vancouver, ISO, and other styles

27

Sadr, Sanam, Alagan Anpalagan, and Kaamran Raahemifar. "Suboptimal Rate Adaptive Resource Allocation for Downlink OFDMA Systems." International Journal of Vehicular Technology 2009 (August 18, 2009): 1–10. http://dx.doi.org/10.1155/2009/891367.

Full text

Abstract:

This paper aims to study the performance of low complexity adaptive resource allocation in the downlink of OFDMA systems with fixed or variable rate requirements (with fairness consideration). Two suboptimal resource allocation algorithms are proposed using the simplifying assumption of transmit power over the entire bandwidth. The objective of the first algorithm is to maximize the total throughput while maintaining rate proportionality among the users. The proposed suboptimal algorithm prioritizes the user with the highest sensitivity to the subcarrier allocation, and the variance over the subchannel gains is used to define the sensitivity of each user. The second algorithm concerns rate adaptive resource allocation in multiuser systems with fixed rate constraints. We propose a suboptimal joint subchannel and power allocation algorithm which prioritizes the users with the highest required data rates. The main feature of this algorithm is its low complexity while achieving the rate requirements.

APA, Harvard, Vancouver, ISO, and other styles

28

Et.al, Mohammad Azmi Ridwan. "Fiber-Wireless Testbed using Software Defined Radio for Protocol and Algorithm Testing." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (2021): 1647–56. http://dx.doi.org/10.17762/turcomat.v12i3.985.

Full text

Abstract:

Fiber-Wireless (FiWi) network is able to provide abundant bandwidth capacity and mobility to the end-users. It also eliminates the needs of having complete tedious end-to-end fiber installation from the central office to the users which saves tremendous capital expenditure. However, FiWi is still progressing. Researchers worldwide are still developing experimental works for improvement on the network reliability, quality-of-services and security. Almost all recently proposed testbed designed for FiWi are using hardware that lacks in programmability feature, making it difficult to implement any protocols and algorithms. A testbed must be flexible, scalable and reprogrammable so that various experiments and testing can be implemented easily for testing purposes. In this paper, a reprogrammable FiWi testbed using software defined radio (SDR) is proposed. One of the most prominent SDR available in the market is Universal Software Radio Peripheral (USRP). It is chosen to be used in this paper as it is equipped with a user-friendly programming platform; LabVIEW. To test the testbed’s reprogrammability feature, two algorithms are implemented for proof-of-concept; collision avoidance and dynamic bandwidth allocation. The collision avoidance algorithm is implemented in the wireless side of the testbed using the concept of Carrier Sensing Multiple Access/Collision Avoidance. At the fiber domain, a dynamic bandwidth allocation-limited scheduling is incorporated in the testbed. The results show that algorithms implemented in the testbed are in-line with the expected results. It proves that the testbed can be used for future algorithm testing for research purposes.

APA, Harvard, Vancouver, ISO, and other styles

29

Zhong, Han, Ruize Sun, Fengcheng Mei, Yong Chen, Fan Jin, and Lei Ning. "Deep Grid Scheduler for 5G NB-IoT Uplink Transmission." Security and Communication Networks 2021 (August 13, 2021): 1–10. http://dx.doi.org/10.1155/2021/5263726.

Full text

Abstract:

Since the birth of narrowband Internet of Things (NB-IoT), the Internet of Things (IoT) industry has made a considerable progress in the application for smart cities, smart manufacturing, and healthcare. Therefore, the number of UEs is increasing exponentially, which brings considerable pressure to the efficient resource allocation for the bandwidth and power constrained NB-IoT networks. In view of the conventional algorithms that cannot dynamically adjust resource allocation, resulting in a low resource utilization and prone to resource fragmentation, this paper proposes a double deep Q-network (DDQN)-based NB-IoT dynamic resource allocation algorithm. It first builds an NB-IoT environment model based on the real environment. Then, the DDQN algorithm interacts with the NB-IoT environment model to learn and optimize resource allocation strategies until it converges to the optimum. Finally, the simulation results show that the DDQN-based NB-IoT dynamic resource allocation algorithm is better than the traditional algorithm in the resource utilization, average transmission rate, and UE average queuing time.

APA, Harvard, Vancouver, ISO, and other styles

30

Iiduka, Hideaki, and Masato Uchida. "Fixed Point Optimization Algorithms for Network Bandwidth Allocation Problems with Compoundable Constraints." IEEE Communications Letters 15, no. 6 (2011): 596–98. http://dx.doi.org/10.1109/lcomm.2011.040711.101369.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Zheng, Jun, and Hussein T. Mouftah. "A survey of dynamic bandwidth allocation algorithms for Ethernet Passive Optical Networks." Optical Switching and Networking 6, no. 3 (2009): 151–62. http://dx.doi.org/10.1016/j.osn.2009.03.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Hou, Y. Thomas, Bo Li, Shivendra S. Panwar, and Henry Tzeng. "On network bandwidth allocation policies and feedback control algorithms for packet networks." Computer Networks 34, no. 3 (2000): 481–501. http://dx.doi.org/10.1016/s1389-1286(00)00132-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Nikolova, Dessislava, Benny Van Houdt, and Chris Blondia. "Dynamic Bandwidth Allocation Algorithms for Ethernet Passive Optical Networks with Threshold Reporting." Telecommunication Systems 28, no. 1 (2005): 31–52. http://dx.doi.org/10.1023/b:tels.0000048326.36157.93.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Radivojević, Mirjana, and Petar Matavulj. "Novel wavelength and bandwidth allocation algorithms for WDM EPON with QoS support." Photonic Network Communications 20, no. 2 (2010): 173–82. http://dx.doi.org/10.1007/s11107-010-0257-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Olszewski, Ireneusz. "Modified Dual-Path Allocation Algorithm in Elastic Optical Networks." Journal of Network and Systems Management 28, no. 4 (2020): 1036–54. http://dx.doi.org/10.1007/s10922-020-09513-4.

Full text

Abstract:

Abstract Dual-path allocation problem is considered to be a case of multipath routing in Elastic Optical Networks. In this article, the optimization problem is formulated and a dual-path allocation algorithm that solves this problem proposed. In the considered problem all traffic for each request is broken into two equal parts, which are directed along two link-disjoint paths. After any link failure, half of the traffic for each affected request is realized. The proposed algorithm is based on the two weight matrices: the elements of the first one depend on the actual length of the links and their utilization, while the elements of the second one assume unit values if the links exist in the network. The proposed algorithm rejects smaller requests and provides a much lower bandwidth blocking probability than other analyzed algorithms.

APA, Harvard, Vancouver, ISO, and other styles

36

Meng, Xiangli, Lingda Wu, and Shaobo Yu. "Multi-Topology Routing Algorithms in SDN-Based Space Information Networks." Future Internet 11, no. 1 (2019): 15. http://dx.doi.org/10.3390/fi11010015.

Full text

Abstract:

Aiming at the complex structure of the space information networks (SIN) and the dynamic change of network topology, in order to design an efficient routing strategy, this paper establishes a SIN management architecture based on Software-defined Networking (SDN). A routing algorithm flow of the spatial information network based on a snapshot sequence is designed. For different spatial tasks with different Quality of Service (QoS) requirements, the concept of integrated link weight is proposed. The Warshall–Floyd algorithm is used to design the optimal routing strategy. A Task-oriented Bandwidth Resource Allocation (TBA) algorithm is proposed for multiple spatial tasks in the same link. Simulation results show that the algorithm can effectively guarantee the priority transmission of important tasks and avoid the unnecessary waste of bandwidth resources.

APA, Harvard, Vancouver, ISO, and other styles

37

Liang, Gen, Guoxi Sun, Jingcheng Fang, Xiaoxue Guo, and Hewei Yu. "An Access Selection Algorithm for Heterogeneous Wireless Networks Based on Optimal Resource Allocation." Wireless Communications and Mobile Computing 2020 (July 4, 2020): 1–13. http://dx.doi.org/10.1155/2020/8844015.

Full text

Abstract:

Wireless networks form heterogeneous wireless networks (HWNs) with overlapping signal coverage, and access selection is one of the key technologies of HWNs. Today, most access selection algorithms select appropriate networks mainly from the perspective of users while failing to consider resource allocation and optimize the overall transmission performance of HWNs. This paper proposes an access selection algorithm for HWNs based on optimal resource allocation by analyzing the wireless link transmission rate model, focusing on maximizing the HWN transmission rate, using the dynamic programming theory to derive the optimal value of bandwidth allocated to users. Experimental results show that the algorithm proposed in this paper can effectively improve network throughput and resource utilization and can connect users to the appropriate network according to QoS rate requirements.

APA, Harvard, Vancouver, ISO, and other styles

38

Liu, Jie, and Li Zhu. "Joint Resource Allocation Optimization of Wireless Sensor Network Based on Edge Computing." Complexity 2021 (March 29, 2021): 1–11. http://dx.doi.org/10.1155/2021/5556651.

Full text

Abstract:

Resource allocation has always been a key technology in wireless sensor networks (WSN), but most of the traditional resource allocation algorithms are based on single interface networks. The emergence and development of multi-interface and multichannel networks solve many bottleneck problems of single interface and single channel networks, it also brings new opportunities to the development of wireless sensor networks, but the multi-interface and multichannel technology not only improves the performance of wireless sensor networks but also brings great challenges to the resource allocation of wireless sensor networks. Edge computing changes the traditional centralized cloud computing processing method into a method that reduces computing storage capacity to the edge of the network and faces users and terminals. Realize the advantages of lower latency, higher bandwidth, and fast response. Therefore, this paper proposes a joint optimization algorithm of resource allocation based on edge computing. We establish a wireless sensor allocation model and then propose our algorithm model combined with the advantages of edge computing. Compared with the traditional allocation algorithm (PCOA, MCMH, and TDMA), it can further improve the resource utilization, reduce the network energy consumption, increase network capacity, and reduce the complexity of the schemes.

APA, Harvard, Vancouver, ISO, and other styles

39

Wang, Wei, Wei Guo, and Weisheng Hu. "Dynamic Wavelength and Bandwidth Allocation Algorithms for Mitigating Frame Reordering in NG-EPON." Journal of Optical Communications and Networking 10, no. 3 (2018): 220. http://dx.doi.org/10.1364/jocn.10.000220.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Dias, Maluge Pubuduni Imali, and Elaine Wong. "Sleep/doze controlled dynamic bandwidth allocation algorithms for energy-efficient passive optical networks." Optics Express 21, no. 8 (2013): 9931. http://dx.doi.org/10.1364/oe.21.009931.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Allalouf, M., and Y. Shavitt. "Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation." IEEE/ACM Transactions on Networking 16, no. 5 (2008): 1015–24. http://dx.doi.org/10.1109/tnet.2007.905605.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Saravanan, G., and N. Yuvaraj. "Cloud resource optimization based on poisson linear deep gradient learning for mobile cloud computing." Journal of Intelligent & Fuzzy Systems 40, no. 1 (2021): 787–97. http://dx.doi.org/10.3233/jifs-200799.

Full text

Abstract:

Mobile Cloud Computing (MCC) addresses the drawbacks of Mobile Users (MU) where the in-depth evaluation of mobile applications is transferred to a centralized cloud via a wireless medium to reduce load, therefore optimizing resources. In this paper, we consider the resource (i.e., bandwidth and memory) allocation problem to support mobile applications in a MCC environment. In such an environment, Mobile Cloud Service Providers (MCSPs) form a coalition to create a resource pool to share their resources with the Mobile Cloud Users. To enhance the welfare of the MCSPs, a method for optimal resource allocation to the mobile users called, Poisson Linear Deep Resource Allocation (PL-DRA) is designed. For resource allocation between mobile users, we formulate and solve optimization models to acquire an optimal number of application instances while meeting the requirements of mobile users. For optimal application instances, the Poisson Distributed Queuing model is designed. The distributed resource management is designed as a multithreaded model where parallel computation is provided. Next, a Linear Gradient Deep Resource Allocation (LG-DRA) model is designed based on the constraints, bandwidth, and memory to allocate mobile user instances. This model combines the advantage of both decision making (i.e. Linear Programming) and perception ability (i.e. Deep Resource Allocation). Besides, a Stochastic Gradient Learning is utilized to address mobile user scalability. The simulation results show that the Poisson queuing strategy based on the improved Deep Learning algorithm has better performance in response time, response overhead, and energy consumption than other algorithms.

APA, Harvard, Vancouver, ISO, and other styles

43

Sandhu, Amandeep Kaur, and Jyoteesh Malhotra. "A Novel QoS Aware Shortest Path Algorithm for VSDN." International Journal of Wireless Networks and Broadband Technologies 6, no. 1 (2017): 1–14. http://dx.doi.org/10.4018/ijwnbt.2017010101.

Full text

Abstract:

This article describes how a rapid increase in usage of internet has emerged from last few years. This high usage of internet has occurred due to increase in popularity of multimedia applications. However, there is no guarantee of Quality of Service to the users. To fulfill the desired requirements, Internet Service Providers (ISPs) establish a service level agreement (SLA) with clients including specific parameters like bandwidth, reliability, cost, power consumption, etc. ISPs make maximum SLAs and decrease energy consumption to raise their profit. As a result, users do not get the desired services for which they pay. Virtual Software Defined Networks are flexible and manageable networks which can be used to achieve these goals. This article presents shortest path algorithm which improves the matrices like energy consumption, bandwidth usage, successful allocation of nodes in the network using VSDN approach. The results show a 40% increase in the performance of proposed algorithms with a respect to existing algorithms.

APA, Harvard, Vancouver, ISO, and other styles

44

Su, Yang, and Mi Lu. "Rate Allocation Algorithm with Successive Refinement in Peer-to-Peer Networks." Applied Mechanics and Materials 496-500 (January 2014): 2200–2203. http://dx.doi.org/10.4028/www.scientific.net/amm.496-500.2200.

Full text

Abstract:

We introduce a new across-peer rate allocation algorithm with successive refinement to improve the video transmission performance in P2P networks, based on the combination of multiple description coding and network coding. Successive refinement is implemented through layered multiple description codes. The algorithm is developed to maximize the expected video quality at the receivers by partitioning video bitstream into different descriptions depending on different bandwidth conditions of each peer. Adaptive rate partition adjustment is applied to ensure the real reflection of the packet drop rate in the network. Also the granularity is changed to the scale of atomic blocks instead of stream rates in prior works. Through simulation results we show that the algorithm outperforms prior algorithms in terms of video playback quality at the peer ends, and helps the system more adjustable to the peer dynamics.

APA, Harvard, Vancouver, ISO, and other styles

45

Verma, Shubham, Amit Gupta, Sushil Kumar, Vivek Srivastava, and Bipin Kumar Tripathi. "Resource Allocation for Efficient IOT Application in Fog Computing." International Journal of Mathematical, Engineering and Management Sciences 5, no. 6 (2020): 1312–23. http://dx.doi.org/10.33889/ijmems.2020.5.6.097.

Full text

Abstract:

When it comes across problems in creating Internet of Things (IOT) architecture, the major problem that arises is an automatic stipulation of resources. At the same time in today’s era, it is very important to integrate this problem with better Quality of Services (QoS) because of which the cloud computing is taking a shift. As being well acquainted that in fog computing, network’s bandwidth is limited, therefore it becomes quite important to build a joint architecture with resource allocation problem giving it a better quality of services with enhanced efficiency and low latency communication. Priority of QoS is determined by Systematic Ladder Process (SLP) and decision parameter evaluation by RECK algorithm. In this paper, there will be a design of a better framework for IOT resource allocation scheme with better efficiency and better QoS. The paper too highlights the comparison of the previous works of the resource allocation algorithms and schemes with RECK algorithm.

APA, Harvard, Vancouver, ISO, and other styles

46

Rai, Prativa, Mrinal Kanti Ghose, and Hiren Kumar Deva Sarma. "Design of utility functions for game-based channel allocation in cognitive radio wireless sensor network." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 2 (2021): 1013. http://dx.doi.org/10.11591/ijeecs.v22.i2.pp1013-1023.

Full text

Abstract:

Cognitive radio enabled wireless sensor network is capable of reducing the spectrum scarcity problem of the wireless networks. Looking at the scarcity of available bandwidth, and the high growth in the number of communication devices in recent times, cognitive radio technology has proven to be a promising technology for the days to come. The application of Game Theory in cognitive radio networks has been visible in recent research works. However, only limited literature is available in which possibilities of applying the game-theory based approaches for the challenging task of channel assignment in cognitive radio wireless sensor are available in the literature. It is understood that the crux of the solution to the problem of scheming games for allocation of the channel is centered on the selection of the utility function in order to increase the efficiency of the channel allocation algorithm. Accordingly, the study regarding the influence of several utility functions on the performance of the corresponding channel allocation algorithm is important. Such a study enables designers to arrive at the optimal utility function to be used in game-theory based channel allocation algorithms, and the same is explored to the best extent, in this paper. The detailed procedure of allocating channels to all the contending nodes through game-based channel allocation has been discussed in this paper. Moreover, the performance of six different utility functions proposed which can be used for channel allocation using game theory has been evaluated for respective performances through MATLAB-based simulations.

APA, Harvard, Vancouver, ISO, and other styles

47

Témoa, Djorwé, Anna Förster, Kolyang, and Serge Doka Yamigno. "A Reinforcement Learning Based Intercell Interference Coordination in LTE Networks." Future Internet 11, no. 1 (2019): 19. http://dx.doi.org/10.3390/fi11010019.

Full text

Abstract:

Long Term Evolution networks, which are cellular networks, are subject to many impairments due to the nature of the transmission channel used, i.e. the air. Intercell interference is the main impairment faced by Long Term Evolution networks as it uses frequency reuse one scheme, where the whole bandwidth is used in each cell. In this paper, we propose a full dynamic intercell interference coordination scheme with no bandwidth partitioning for downlink Long Term Evolution networks. We use a reinforcement learning approach. The proposed scheme is a joint resource allocation and power allocation scheme and its purpose is to minimize intercell interference in Long Term Evolution networks. Performances of proposed scheme shows quality of service improvement in terms of SINR, packet loss and delay compared to other algorithms.

APA, Harvard, Vancouver, ISO, and other styles

48

Das, Debashis, Sourav Banerjee, Ayan Kundu, Swagata Chandra, Saptarshi Pal, and Utpal Biswas. "An approach towards development of a migration enabled improved datacenter broker policy." APTIKOM Journal on Computer Science and Information Technologies 4, no. 3 (2020): 112–24. http://dx.doi.org/10.34306/csit.v4i3.99.

Full text

Abstract:

Cloud computinghas left its remarkable note on the computing world over the last few years. Through itseffectiveness, litheness, scalability & availability cloud computinghas changed the nature of computer systemdeployment. The Quality of Service (QoS) of a cloud service provider (CSP) is an important element of research interestwhich includes different critical issues such as proper load, minimization of waiting time, turnaround time, makespanand suppressing the wastage of bandwidth of the system. The Datacenter Broker (DCB) policy helpsassigning acloudletto a VM. In present study, we proposed an algorithm, i.e., Migration enabled Cloudlet Allocation Policy(MCAP) for allocation of cloudlets to the VMs in a Datacenter by taking into accounttheload capacity of VMs andlength of the cloudlets. The experimental results obtained using CloudSim toolkit under extensive loads that establishperformance supremacy of MCAP algorithm over the existing algorithms.

APA, Harvard, Vancouver, ISO, and other styles

49

Zhou, Ke, Ying Deng, Wei He, and Xia Zhang. "Power Allocation Algorithm Based on QoS Strategy in Power-Line Communication." Advanced Materials Research 981 (July 2014): 450–56. http://dx.doi.org/10.4028/www.scientific.net/amr.981.450.

Full text

Abstract:

In order to maximize low power-line channel capacity within the limited transmission bandwidth, a new transmitting power allocation algorithm based on the quality of service (QoS) strategy is proposed in this paper.Orthogonal frequency-division multiplexing (OFDM) is considered to support remarkable capacity of power-line channel. In order to derive the closed form expression of the maximum channel capacity in an OFDM power communication system, the relationship between channel capacity, signal to noise ratio (SNR) and modulation scheme is analyzed.Furthermore, some influence factors of power-line channel capacity, such as branches number, branches length and end-load impendence are analyzed in this paper. Simulation result shows that the mainly factors that affect the channel capacity of low power-line are branch number and load impendence; the performance of proposed algorithm is superior to the existed water-filling algorithms at the same SNR.

APA, Harvard, Vancouver, ISO, and other styles

50

Lertsutthiwong, Monchai, Thinh Nguyen, and Alan Fern. "Scalable Video Streaming for Single-Hop Wireless Networks Using a Contention-Based Access MAC Protocol." Advances in Multimedia 2008 (2008): 1–21. http://dx.doi.org/10.1155/2008/928521.

Full text

Abstract:

Limited bandwidth and high packet loss rate pose a serious challenge for video streaming applications over wireless networks. Even when packet loss is not present, the bandwidth fluctuation, as a result of an arbitrary number of active flows in an IEEE 802.11 network, can significantly degrade the video quality. This paper aims to enhance the quality of video streaming applications in wireless home networks via a joint optimization of video layer-allocation technique, admission control algorithm, and medium access control (MAC) protocol. Using an Aloha-like MAC protocol, we propose a novel admission control framework, which can be viewed as an optimization problem that maximizes the average quality of admitted videos, given a specified minimum video quality for each flow. We present some hardness results for the optimization problem under various conditions and propose some heuristic algorithms for finding a good solution. In particular, we show that a simple greedy layer-allocation algorithm can perform reasonably well, although it is typically not optimal. Consequently, we present a more expensive heuristic algorithm that guarantees to approximate the optimal solution within a constant factor. Simulation results demonstrate that our proposed framework can improve the video quality up to 26% as compared to those of the existing approaches.

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!