Relevant bibliographies by topics / Bandwidth allocation algorithms

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Bandwidth allocation algorithms"

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
More sources

Dissertations / Theses on the topic "Bandwidth allocation algorithms"

1

Unlu, Eren. "Dynamic Bandwidth allocation algorithms for an RF on-chip interconnect." Thesis, CentraleSupélec, 2016. http://www.theses.fr/2016SUPL0006/document.

Full text
Abstract:
Avec l’augmentation du nombre de cœurs, les problèmes de congestion sont commencé avec les interconnexions conventionnelles. Afin de remédier à ces défis, WiNoCoD projet (Wired RF Network-on-Chip Reconfigurable-on-Demand) a été initié par le financement de l’Agence Nationale de Recherche (ANR). Ce travail de thèse contribue à WiNoCoD projet. Une structure de contrôleur de RF est proposé pour l’interconnexion OFDMA de WiNoCoD et plusieurs algorithmes d’allocation de bande passante efficaces (distribués et centralisés) sont développés, concernant les demandes et contraintes très spécifiques de l’environnement sur-puce. Un protocole innovante pour l’arbitrage des sous-porteuses pour des longueurs bimodales de paquets sur-puce, qui ne nécessite aucun signalisation supplémentaire est introduit. Utilisation des ordres de modulation élevés avec plus grande consommation d’énergie est évaluée<br>With rapidly increasing number of cores on a single chip, scalability problems have arised due to congestion and latency with conventional interconnects. In order to address these issues, WiNoCoD project (Wired RF Network-on-Chip Reconfigurable-on-Demand) has been initiated by the support of French National Research Agency (ANR). This thesis work contributes to WiNoCoD project. A special RF controller structure has been proposed for the OFDMA based wired RF interconnect of WiNoCoD. Based on this architecture, effective bandwidth allocation algorithms have been presented, concerning very specific requirements and constraints of on-chip environment. An innovative subcarrier allocation protocol for bimodal packet lengths of cache coherency traffic has been presented, which is proven to decrease average latency significantly. In addition to these, effective modulation order selection policies for this interconnect have been introduced, which seeks the optimal delay-power trade-off
APA, Harvard, Vancouver, ISO, and other styles
2

Fei, Ridong. "QoS-aware two-level dynamic bandwidth allocation algorithms in IEEE 802.16j-enabled vehicular networks." Thesis, University of Essex, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531555.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ou, Qi. "Bandwidth allocation algorithms for file distribution networks and location-aware topology construction in peer-to-peer networks /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20OU.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sen, Sanjoy Kumar. "Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing." Thesis, University of North Texas, 1997. https://digital.library.unt.edu/ark:/67531/metadc278885/.

Full text
Abstract:
The fusion of computers and communications has promised to herald the age of information super-highway over high speed communication networks where the ultimate goal is to enable a multitude of users at any place, access information from anywhere and at any time. This, in a nutshell, is the goal envisioned by the Personal Communication Services (PCS) and Xerox's ubiquitous computing. In view of the remarkable growth of the mobile communication users in the last few years, the radio frequency spectrum allocated by the FCC (Federal Communications Commission) to this service is still very limited and the usable bandwidth is by far much less than the expected demand, particularly in view of the emergence of the next generation wireless multimedia applications like video-on-demand, WWW browsing, traveler information systems etc. Proper management of available spectrum is necessary not only to accommodate these high bandwidth applications, but also to alleviate problems due to sudden explosion of traffic in so called hot cells. In this dissertation, we have developed simple load balancing techniques to cope with the problem of tele-traffic overloads in one or more hot cells in the system. The objective is to ease out the high channel demand in hot cells by borrowing channels from suitable cold cells and by proper assignment (or, re-assignment) of the channels among the users. We also investigate possible ways of improving system capacity by rescheduling bandwidth in case of wireless multimedia traffic. In our proposed scheme, traffic using multiple channels releases one or more channels to increase the carried traffic or throughput in the system. Two orthogonal QoS parameters, called carried traffic and bandwidth degradation, are identified and a cost function describing the total revenue earned by the system from a bandwidth degradation and call admission policy, is formulated. A channel sharing scheme is proposed for co-existing real-time and non-real-time traffic and analyzed using a Markov modulated Poisson process (MMPP) based queueing model. The location management problem in mobile computing deals with the problem of a combined management of location updates and paging in the network, both of which consume scarce network resources like bandwidth, CPU cycles etc. An easily implementable location update scheme is developed which considers per-user mobility pattern on top of the conventional location area based approach and computes an update strategy for each user by minimizing the average location management cost. The cost optimization problem is elegantly solved using a genetic algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Rasmusson, Lars. "Network capacity sharing with QoS as a financial derivative pricing problem : algorithms and network." Doctoral thesis, SICS, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-22556.

Full text
Abstract:
A design of an automatic network capacity markets, often referred to as a bandwidth market, is presented. Three topics are investigated. First, a network model is proposed. The proposed model is based upon a trisection of the participant roles into network users, network owners, and market middlemen. The network capacity is defined in a way that allows it to be traded, and to have a well defined price. The network devices are modeled as core nodes, access nodes, and border nodes. Requirements on these are given. It is shown how their functionalities can be implemented in a network. Second, a simulated capacity market is presented, and a statistical method for estimating the price dynamics in the market is proposed. A method for pricing network services based on shared capacity is proposed, in which the price of a service is equivalent to that of a financial derivative contract on a number of simple capacity shares.Third, protocols for the interaction between the participants are proposed. The market participants need to commit to contracts with an auditable protocol with a small overhead. The proposed protocol is based on a public key infrastructure and on known protocols for multi party contract signing. The proposed model allows network capacity to be traded in a manner that utilizes the network efficiently. A new feature of this market model, compared to other network capacity markets, is that the prices are not controlled by the network owners. It is the end-users who, by middlemen, trade capacity among each other. Therefore, financial, rather than control theoretic, methods are used for the pricing of capacity.
APA, Harvard, Vancouver, ISO, and other styles
6

Fan, Tianmin. "A novel dynamic bandwidth allocation algorithm with QoS support for EPON access networks." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27130.

Full text
Abstract:
Ethernet passive optical network (EPON) has been considered as an attractive solution to next-generation broadband access networks due to its low cost and high throughput. However, designing efficient bandwidth allocation algorithms is a critical issue in EPON. In this thesis, various dynamic bandwidth allocation (DBA) algorithms for EPON systems are first reviewed. A novel DBA algorithm, called per-slot DBA (PSDBA), is then presented to efficiently and fairly allocate bandwidth among different users. The PSDBA algorithm is based on the multi-point control protocol (MPCP) and allocates bandwidth on a per-slot basis. It is also combined with non-strict priority scheduling and priority queuing to support differentiated services in the design of an EPON system. Extensive simulation experiments are performed. Simulation results show that the PSDBA algorithm outperforms a well-known DBA algorithm using a per-frame bandwidth allocation strategy.
APA, Harvard, Vancouver, ISO, and other styles
7

Queiroz, Eduardo Martinelli Galvão de. "Algoritmo de alocação dinâmica de largura de faixa para redes de comunicação móvel celular." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/18/18155/tde-20062008-100444/.

Full text
Abstract:
O crescente aumento da demanda de tráfego nas redes celulares vem aumentando a necessidade de uma melhor utilização dos recursos do sistema, já que sua expansão é custosa. Nas estações rádio base (ERB), a disponibilidade de largura de faixa de freqüências é limitada e desta maneira, em uma rede de comunicação móvel celular, o controle de admissão de chamadas exerce grande influência no desempenho do sistema, pois determina a utilização de banda das ERBs e se uma determinada quantidade de recursos (banda) será alocado ou não para uma determinada chamada. O desempenho da rede pode ser atrelado a determinados parâmetros, como a probabilidade de bloqueio de novas chamadas, probabilidade de bloqueio de chamadas handoff e a utilização de banda da rede. Este trabalho propõe um controle de admissão de chamadas que, no atendimento de uma chamada, faz o empréstimo de banda de chamadas em andamento na célula no caso de banda insuficiente. O sistema adota um mecanismo heurístico que determina a banda disponível para novas chamadas conforme os valores de certos parâmetros do sistema. O empréstimo de banda é realizado em chamadas em andamento nas células até níveis mínimos estabelecidos para cada tipo de chamada, que se diferenciam pelas necessidades de banda de cada uma. O algoritmo foi aplicado às bandas e características de uma rede de terceira geração (3G), que possui chamadas de voz, videoconferência, interação multimídia, e-mail, downloads e transferência de arquivos e a uma rede GSM/GPRS (global system for mobile communications/ general packet radio service), que possui chamadas de voz e de dados. Os resultados mostram melhorias na probabilidade de bloqueio de novas chamadas, probabilidade de bloqueio de handoff e na utilização de banda do sistema.<br>The recent growth in traffic loads in cellular networks has seen the need for a better use of system resources as its expansion is expensive. In the base transceiver station (BTS), the bandwidth availability is limited. Thus, in cellular networks the call admission control greatly influences the system performance because it determines the bandwidth use of the BTSs and if an amount of resources will or will not be allocated to a call. The network performance can be evaluated by parameters such as blocking probability of new calls, dropping probability of handoff calls and bandwidth use. This work proposes a call admission control that carries out the bandwidth borrowing when a call arrives and there is not enough bandwidth. The system makes use of a heuristic mechanism that determines the available bandwidth for the new calls according to some parameter values of the system. The bandwidth borrowing is applied to the cell ongoing calls until the minimum levels for each type are met. The algorithm was applied to the bandwidths and characteristics of a third generation cellular network, which supports voice calls, videoconference, multimedia interaction, e-mails, downloads and file transfers. It was also applied to a GSM/GPRS (global system for mobile communications/ general packet radio service), which supports voice and data calls. The results show improvements in the blocking probability of new calls, dropping probability of handoff calls and in the bandwidth use of the system.
APA, Harvard, Vancouver, ISO, and other styles
8

Núñez, Benjamin. "Applying a router-based-distributed bandwidth allocation algorithm to dynamically implement traffic engineering over MPLS-based networks in order to increase the quality of service for non-elastic applications." Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1435226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Uznanski, Przemyslaw. "Large scale platform : Instantiable models and algorithmic design of communication schemes." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00878837.

Full text
Abstract:
The increasing popularity of Internet bandwidth-intensive applications prompts us to consider followingproblem: How to compute efficient collective communication schemes on large-scale platform?The issue of designing a collective communication in the context of a large scale distributed networkis a difficult and a multi-level problem. A lot of solutions have been extensively studied andproposed. But a new, comprehensive and systematic approach is required, that combines networkmodels and algorithmic design of solutions.In this work we advocate the use of models that are able to capture real-life network behavior,but also are simple enough that a mathematical analysis of their properties and the design of optimalalgorithms is achievable.First, we consider the problem of the measuring available bandwidth for a given point-topointconnection. We discuss how to obtain reliable datasets of bandwidth measurements usingPlanetLab platform, and we provide our own datasets together with the distributed software usedto obtain it. While those datasets are not a part of our model per se, they are necessary whenevaluating the performance of various network algorithms. Such datasets are common for latencyrelatedproblems, but very rare when dealing with bandwidth-related ones.Then, we advocate for a model that tries to accurately capture the capabilities of a network,named LastMile model. This model assumes that essentially the congestion happens at the edgesconnecting machines to the wide Internet. It has a natural consequence in a bandwidth predictionalgorithm based on this model. Using datasets described earlier, we prove that this algorithm is ableto predict with an accuracy comparable to best known network prediction algorithm (DistributedMatrix Factorization) available bandwidth between two given nodes. While we were unable toimprove upon DMF algorithm in the field of point-to-point prediction, we show that our algorithmhas a clear advantage coming from its simplicity, i.e. it naturally extends to the network predictionsunder congestion scenario (multiple connections sharing a bandwidth over a single link). We areactually able to show, using PlanetLab datasets, that LastMile prediction is better in such scenarios.In the third chapter, we propose new algorithms for solving the large scale broadcast problem.We assume that the network is modeled by the LastMile model. We show that under thisassumption, we are able to provide algorithms with provable, strong approximation ratios. Takingadvantage of the simplicity and elasticity of the model, we can even extend it, so that it captures theidea of connectivity artifacts, in our case firewalls preventing some nodes to communicate directlybetween each other. In the extended case we are also able to provide approximation algorithmswith provable performance.The chapters 1 to 3 form three successful steps of our program to develop from scratch amathematical network communication model, prove it experimentally, and show that it can beapplied to develop algorithms solving hard problems related to design of communication schemesin networks.In the chapter 4 we show how under different network cost models, using some simplifyingassumptions on the structure of network and queries, one can design very efficient communicationschemes using simple combinatorial techniques. This work is complementary to the previous chapter in the sense that previously when designing communication schemes, we assumed atomicityof connections, i.e. that we have no control over routing of simple connections. In chapter 4 weshow how to solve the problem of an efficient routing of network request, given that we know thetopology of the network. It shows the importance of instantiating the parameters and the structureof the network in the context of designing efficient communication schemes.
APA, Harvard, Vancouver, ISO, and other styles
10

Lourenço, André Luiz Ferraz. "Técnicas de proteção e restauração em redes ópticas elásticas." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/18/18155/tde-28012016-080915/.

Full text
Abstract:
As redes ópticas estão passando por mudanças significativas, impulsionadas pelo crescimento exponencial do tráfego, principalmente advindo de serviços multimídia e armazenamento em nuvem. Esta demanda exigirá aumento da capacidade da taxa de transmissão para padrões como 400 Gb/s e 1 Tb/s. Nesse contexto, foi proposta uma arquitetura de rede com grade de frequências granular flexível chamada elastic optical network (EON). A EON divide o espectro de frequências em fatias (slots) de tamanho fixo e aloca grupos de slots contíguos estritamente de acordo com os requisitos de banda das demandas de conexão, implicando eficiência de uso do espectro. Com o aumento significativo da taxa de transmissão, acentuou-se a preocupação em manter a sobrevivência da rede, já que pouco tempo de queda no serviço pode acarretar uma imensa perda de dados. Neste trabalho, investigamos esquemas de proteção baseados em caminhos compartilhados (shared-path protection, SPP) e esquemas de restauração de tráfego. Avaliamos esquemas divulgados na literatura como o dynamic load balancing shared-path protection (DLBSPP) e esquemas de restauração como o traffic aware restoration (TAR) e bandwidth squeezed restoration (BSR). Avaliamos também uma heurística de alocação de slots chamada inverted dual stack (IDS). O DLBSPP utiliza balanceamento dinâmico de carga para computar os caminhos primários e de proteção compartilhados. O TAR executa a restauração dinâmica ordenando as conexões por granularidade de banda. O BSR utiliza a capacidade de contração de banda do EON para restaurar conexões por meio da política de melhor esforço ou de banda garantida, dependendo do acordo de níveis de serviço do cliente. O esquema IDS concentra o maior número possível de slots compartilhados em uma região do espectro. As medidas de desempenho dos algoritmos são avaliadas segundo as métricas: probabilidade de bloqueio, taxa de utilização do espectro, número médio de hops e taxa de restauração falha. As simulações computacionais mostram o bom desempenho da utilização do esquema IDS com DLBSPP.<br>Optical networks are undergoing significant changes driven by the exponentially growing traffic, especially coming from multimedia and cloud storage services. This demand will require increasing of the transmission rate capacity as high as 400 Gb/s and 1 Tb/s. Within this context, it was proposed the elastic optical network (EON), which is a network architecture with flexible granular frequency grid. EON divides the frequency spectrum into slices (slots) of fixed size and allocates groups of contiguous slots strictly according to the bandwidth requirement of the connection demands, providing high spectrum use efficiency. The significant increase in transmission rate put emphasis on the need to maintain the survival of the network, since the occurrence of faults in the network nodes or links can cause huge loss of data. In this work, we investigate protection schemes based on shared-path protection (SPP) and traffic restoration schemes. We evaluate schemes related in the literature, such as the dynamic load balancing shared-path protection (DLBSPP), and restoration schemes such as the traffic aware restoration (TAR) and the bandwidth squeezed restoration (BSR). The DLBP scheme uses dynamic load balancing to compute primary and shared protection paths. The TAR performs dynamic restoration ordering the connections based on band granularity. The BSR uses EON\'s band squeezing feature to restore connections by means of the best effort or guaranteed bandwidth strategy, depending on the customer\'s service level agreement. IDS scheme concentrates the maximum possible number of shared slots in a given region of the spectrum. Performance of the algorithms are evaluated according to metrics: blocking probability, spectrum utilization rate, average number of hops and failure restoration rate. Computer simulations show that the use of the IDS scheme improves the performance of the investigated algorithms.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Bandwidth allocation algorithms"

1

Performance Analysis of a Dynamic Bandwidth Allocation Algorithm in a Circuit-Switched Communications Network. Storming Media, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bandwidth allocation algorithms"

1

Wang, Weiwei, Zihua Guo, Xuemin (Sherman) Shen, Changjia Chen, and Jun Cai. "Dynamic Bandwidth Allocation in IEEE 802.16." In Wireless Algorithms, Systems, and Applications. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814856_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jiang, Wanchun, Pan Ning, Zheyuan Zhang, Jintian Hu, Zhicheng Ren, and Jianxin Wang. "Practical Bandwidth Allocation for Video QoE Fairness." In Wireless Algorithms, Systems, and Applications. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85928-2_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kumar, Vijay. "Bandwidth allocation algorithms for tree and ring networks." In Multichannel Optical Networks: Theory and Practice. American Mathematical Society, 1998. http://dx.doi.org/10.1090/dimacs/046/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ogryczak, Włodzimierz, and Tomasz Śliwiński. "Sequential Algorithms for Max-Min Fair Bandwidth Allocation." In Lecture Notes in Electrical Engineering. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-84814-3_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kumar, Vijay. "Approximating circular arc colouring and bandwidth allocation in all-optical ring networks." In Approximation Algorithms for Combinatiorial Optimization. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053971.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Dong, Kai Liu, Feiyu Jin, Weiwei Wu, Xianlong Jiao, and Songtao Guo. "Adaptive Uplink/Downlink Bandwidth Allocation for Dual Deadline Information Services in Vehicular Networks." In Wireless Algorithms, Systems, and Applications. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86130-8_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ma, Teng, Xin Chen, Zhuo Ma, and Libo Jiao. "Deep Reinforcement Learning Based Dynamic Content Placement and Bandwidth Allocation in Internet of Vehicles." In Wireless Algorithms, Systems, and Applications. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86137-7_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Leonardi, Stefano, Alberto Marchetti-Spaccamela, and Andrea Vitaletti. "Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints." In FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44450-5_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aghdaee, Ehsan A., Nallasamy Mani, and Bala Srinivasan. "An Enhanced Bandwidth Allocation Algorithms for QoS Provision in IEEE 802.16 BWA." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89524-4_70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ali, Md Hayder, and Mohammad Hanif Ali. "A Priority-Based Deficit Weighted Round Robin Queuing for Dynamic Bandwidth Allocation Algorithm in Gigabit Passive Optical Network." In Algorithms for Intelligent Systems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8820-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bandwidth allocation algorithms"

1

Dan Huang and Changjia Chen. "Bandwidth allocation algorithms in the short video sharing system." In 4th IET International Conference on Wireless, Mobile & Multimedia Networks (ICWMMN 2011). IET, 2011. http://dx.doi.org/10.1049/cp.2011.1010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pan, Deng, and Yuanyuan Yang. "Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches." In 2007 IEEE International Parallel and Distributed Processing Symposium. IEEE, 2007. http://dx.doi.org/10.1109/ipdps.2007.370242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Simonov, Victor S., and Alexander A. Malyavko. "Performance Analysis of Dynamic Bandwidth Allocation Algorithms in GPON." In 2020 21st International Conference of Young Specialists on Micro/Nanotechnologies and Electron Devices (EDM). IEEE, 2020. http://dx.doi.org/10.1109/edm49804.2020.9153515.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nikolova, Dessislava, Benny Van Houdt, and Chris L. Blondia. "Dynamic bandwidth allocation algorithms in EPON: a simulation study." In OptiComm 2003: Optical Networking and Communications, edited by Arun K. Somani and Zhensheng Zhang. SPIE, 2003. http://dx.doi.org/10.1117/12.533543.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chowdhury, S., and K. Sohraby. "Alternative bandwidth allocation algorithms for packet video in ATM networks." In [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications. IEEE, 1992. http://dx.doi.org/10.1109/infcom.1992.263459.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Smith, Timothy G., Rodney S. Tucker, Kerry Hinton, and An V. Tran. "Packet delay variance and bandwidth allocation algorithms for extended-reach GPON." In 2009 14th OptoElectronics and Communications Conference (OECC). IEEE, 2009. http://dx.doi.org/10.1109/oecc.2009.5222078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Boggia, G., P. Camarda, L. A. Grieco, S. Mascolo, and A. Stefanelli. "Performance Evaluation of Feedback-based Bandwidth Allocation Algorithms for 802.11e MAC." In 2007 IEEE 65th Vehicular Technology Conference. IEEE, 2007. http://dx.doi.org/10.1109/vetecs.2007.181.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ogryczak, Wlodzimierz, and Tomasz Sliwinski. "Sequential algorithms for exact and approximate max-min fair bandwidth allocation." In 2012 XVth International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2012. http://dx.doi.org/10.1109/netwks.2012.6381707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jana, Neeharika, Ganesh C. Sankaran, Krishna M. Sivalingam, and Gerard Parr. "Performance analysis of Dynamic Bandwidth Allocation algorithms for long-reach PONs." In 2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems (ANTS). IEEE, 2010. http://dx.doi.org/10.1109/ants.2010.5983518.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fei, Ridong, Kun Yang, and Xueqi Cheng. "A cooperative social and vehicular network and its dynamic bandwidth allocation algorithms." In IEEE INFOCOM 2011 - IEEE Conference on Computer Communications Workshops. IEEE, 2011. http://dx.doi.org/10.1109/infcomw.2011.5928891.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bandwidth allocation algorithms' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography