Relevant bibliographies by topics / Congestion control algorithms

Academic literature on the topic 'Congestion control algorithms'

Author: Grafiati
Published: 7 July 2024
Last updated: 7 July 2024

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 'Congestion control 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.

Contents

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

Journal articles on the topic "Congestion control algorithms":

1

Hasan, Husam H., and Zainab T. Alisa. "Effective IoT Congestion Control Algorithm." Future Internet 15, no. 4 (March 31, 2023): 136. http://dx.doi.org/10.3390/fi15040136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The Internet of Things (IoT) connects devices via the Internet. Network congestion is one of the key problems that has been identified by researchers in the IoT field. When there is a huge number of IoT devices connected to the internet, this creates network congestion. Transfer control protocol is a transport layer protocol that provides a reliable end-to-end connection between two devices. Many Congestion Control Algorithms have been proposed to solve network congestion. However, there is no perfect solution to this problem. This paper proposes an effective loss-based Congestion Control Algorithm to effectively adapt the congestion window in the IoT environment. It uses simple experiment scenarios to test the algorithm for wired and wireless channels and observes important performance metrics: link utilization, inter-protocol fairness, intra-protocol fairness and throughput. The results are impressive, and the proposed algorithm is shown to outperform other standard algorithms.
2

Tessler, Chen, Yuval Shpigelman, Gal Dalal, Amit Mandelbaum, Doron Haritan Kazakov, Benjamin Fuhrer, Gal Chechik, and Shie Mannor. "Reinforcement Learning for Datacenter Congestion Control." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 11 (June 28, 2022): 12615–21. http://dx.doi.org/10.1609/aaai.v36i11.21535.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
We approach the task of network congestion control in datacenters using Reinforcement Learning (RL). Successful congestion control algorithms can dramatically improve latency and overall network throughput. Until today, no such learning-based algorithms have shown practical potential in this domain. Evidently, the most popular recent deployments rely on rule-based heuristics that are tested on a predetermined set of benchmarks. Consequently, these heuristics do not generalize well to newly-seen scenarios. Contrarily, we devise an RL-based algorithm with the aim of generalizing to different configurations of real-world datacenter networks. We overcome challenges such as partial-observability, non-stationarity, and multi-objectiveness. We further propose a policy gradient algorithm that leverages the analytical structure of the reward function to approximate its derivative and improve stability. We show that these challenges prevent standard RL algorithms from operating within this domain. Our experiments, conducted on a realistic simulator that emulates communication networks' behavior, show that our method exhibits improved performance concurrently on the multiple considered metrics compared to the popular algorithms deployed today in real datacenters. Our algorithm is being productized to replace heuristics in some of the largest datacenters in the world.
3

LE, Tuan Anh, Choong Seon HONG, and Sungwon LEE. "Multipath Binomial Congestion Control Algorithms." IEICE Transactions on Communications E95.B, no. 6 (2012): 1934–43. http://dx.doi.org/10.1587/transcom.e95.b.1934.

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

Tessler, Chen, Yuval Shpigelman, Gal Dalal, Amit Mandelbaum, Doron Haritan Kazakov, Benjamin Fuhrer, Gal Chechik, and Shie Mannor. "Reinforcement Learning for Datacenter Congestion Control." ACM SIGMETRICS Performance Evaluation Review 49, no. 2 (January 17, 2022): 43–46. http://dx.doi.org/10.1145/3512798.3512815.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
We approach the task of network congestion control in datacenters using Reinforcement Learning (RL). Successful congestion control algorithms can dramatically improve latency and overall network throughput. Until today, no such learning-based algorithms have shown practical potential in this domain. Evidently, the most popular recent deployments rely on rule-based heuristics that are tested on a predetermined set of benchmarks. Consequently, these heuristics do not generalize well to newly-seen scenarios. Contrarily, we devise an RL-based algorithm with the aim of generalizing to different configurations of real-world datacenter networks. We overcome challenges such as partial-observability, nonstationarity, and multi-objectiveness. We further propose a policy gradient algorithm that leverages the analytical structure of the reward function to approximate its derivative and improve stability. We show that this scheme outperforms alternative popular RL approaches, and generalizes to scenarios that were not seen during training. Our experiments, conducted on a realistic simulator that emulates communication networks' behavior, exhibit improved performance concurrently on the multiple considered metrics compared to the popular algorithms deployed today in real datacenters. Our algorithm is being productized to replace heuristics in some of the largest datacenters in the world.
5

Mahawish, Amar A., and Hassan J. Hassan. "Survey on: A variety of AQM algorithm schemas and intelligent techniques developed for congestion control." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 3 (September 1, 2021): 1419. http://dx.doi.org/10.11591/ijeecs.v23.i3.pp1419-1431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The congestion on the internet is the main issue that affects the performance of transition data over the network. An algorithm for congestion control is required to keep any network efficient and reliable for transfer traffic data of the users. Many Algorithms had been suggested over the years to improve the control of congestion that occurs in the network such as drop tail packets. Recently there are many algorithms have been developed to overcome the drawback of the drop tail procedure. One of the important algorithms developed is active queue management (AQM) that provides efficient congestion control by reducing drop packets, this technique considered as a base for many other congestion control algorithms schema. It works at the network core (router) for controlling the drop and marking of packets in the router's buffer before the congestion inception. In this study, a comprehensive survey is done on the AQM Algorithm schemas that proposed and modification these algorithms to achieve the best performance, the classification of AQM algorithms based on queue length, queue delay, or both. The advantages and limitations of each algorithm have been discussed. Also, debate the intelligent techniques procedure with AQM algorithm to achieve optimization in performance of algorithm operation. Finally, the comparison has been discussed among algorithms to find the weakness and powerful of each one based on different metrics.
6

Mudassir, Mumajjed Ul, and M. Iram Baig. "MFVL HCCA: A Modified Fast-Vegas-LIA Hybrid Congestion Control Algorithm for MPTCP Traffic Flows in Multihomed Smart Gas IoT Networks." Electronics 10, no. 6 (March 18, 2021): 711. http://dx.doi.org/10.3390/electronics10060711.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Multihomed smart gas meters are Internet of Things (IoT) devices that transmit information wirelessly to a cloud or remote database via multiple network paths. The information is utilized by the smart gas grid for accurate load forecasting and several other important tasks. With the rapid growth in such smart IoT networks and data rates, reliable transport layer protocols with efficient congestion control algorithms are required. The small Transmission Control Protocol/Internet Protocol (TCP/IP) stacks designed for IoT devices still lack efficient congestion control schemes. Multipath transmission control protocol (MPTCP) based congestion control algorithms are among the recent research topics. Many coupled and uncoupled congestion control algorithms have been proposed by researchers. The default congestion control algorithm for MPTCP is coupled congestion control by using the linked-increases algorithm (LIA). In battery powered smart meters, packet retransmissions consume extra power and low goodput results in poor system performance. In this study, we propose a modified Fast-Vegas-LIA hybrid congestion control algorithm (MFVL HCCA) for MPTCP by considering the requirements of a smart gas grid. Our novel algorithm operates in uncoupled congestion control mode as long as there is no shared bottleneck and switches to coupled congestion control mode otherwise. We have presented the details of our proposed model and compared the simulation results with the default coupled congestion control for MPTCP. Our proposed algorithm in uncoupled mode shows a decrease in packet loss up to 50% and increase in average goodput up to 30%.
7

Wang, Jiashuai, Xiaoping Yang, Ying Liu, and Zhihong Qian. "A Contention-Based Hop-By-Hop Bidirectional Congestion Control Algorithm for Ad-Hoc Networks." Sensors 19, no. 16 (August 9, 2019): 3484. http://dx.doi.org/10.3390/s19163484.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Existing hop-by-hop congestion control algorithms are mainly divided into two categories: those improving the sending rate and those suppressing the receiving rate. However, these congestion control algorithms have problems with validity and limitations. It is likely that the network will be paralyzed due to the unreasonable method of mitigating congestion. In this paper, we present a contention-based hop-by-hop bidirectional congestion control algorithm (HBCC). This algorithm uses the congestion detection method with queue length as a parameter. By detecting the queue length of the current node and the next hop node, the congestion conditions can be divided into the following four categories: 0–0, 0–1, 1–0, 1–1 (0 means no congestion, 1 means congestion). When at least one of the two nodes is congested, the HBCC algorithm adaptively adjusts the contention window of the current node, which can change the priority of the current node to access the channel. In this way, the buffer queue length of the congested node is reduced. When the congestion condition is 1–1, the hop-by-hop priority congestion control (HPCC) method proposed in this paper is used. This algorithm adaptively changes the adjustment degree of the current node competition window and improves the priority of congestion processing of the next hop node. The NS2 simulation shows that by using the HBCC algorithm, when compared with distributed coordination function (DCF) without congestion control, the proposed unidirectional congestion control algorithms hop-by-hop receiving-based congestion control (HRCC) and hop-by-hop sending-based congestion control (HSCC), and the existing congestion control algorithm congestion alleviation—MAC (CA-MAC), the average saturation throughput increased by approximately 90%, 62%, 12%, and 62%, respectively, and the buffer overflow loss ratio reduced by approximately 80%, 79%, 44%, and 79%.
8

Liu, Lei, Feng Mei Zhang, Cun Wu Han, Song Bi, and De Hui Sun. "Adaptive Fault-Tolerant Congestion Control for Internet." Applied Mechanics and Materials 644-650 (September 2014): 2467–70. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2467.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Existing Internet congestion control algorithms did not consider any faults. This paper presents a state feedback fault-tolerant congestion control algorithm which is based on adaptive and robust H∞ approaches. Simulation result shows that the proposed algorithm has good performance.
9

Utsumi, Satoshi. "Congestion Control Algorithms for the Internet – A Secondary Publication." Journal of Electronic Research and Application 8, no. 2 (March 29, 2024): 33–48. http://dx.doi.org/10.26689/jera.v8i2.6452.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In the last five years, there has been a V-shaped recovery in the number of papers on congestion controlalgorithms on the Internet. In this paper, congestion problems on the Internet are discussed, such as congestion collapse and bufferbloat from the perspective of the necessity of congestion control algorithms. The typical congestion control algorithms are introduced, and the research areas and methods of congestion control algorithms are described. Recent research trends and future prospects of congestion control algorithms are also presented.
10

Han, Cun Wu, De Hui Sun, and Lei Liu. "Adaptive Congestion Control with Time-Varying Uncertainties." Applied Mechanics and Materials 556-562 (May 2014): 2285–88. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.2285.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Existing Internet congestion control algorithms did not consider time-varying uncertainties. This paper presents a new congestion control algorithm based on adaptive technique and robust H∞ approach, which can effectively compensate for the time-varying uncertainties. Simulation result shows that the proposed algorithm has good performance.
More sources
You might also be interested in the extended bibliographies on the topic 'Congestion control algorithms' for particular source types:
Journal articles Dissertations / Theses

Dissertations / Theses on the topic "Congestion control algorithms":

1

Edwan, Talal A. "Improved algorithms for TCP congestion control." Thesis, Loughborough University, 2010. https://dspace.lboro.ac.uk/2134/7141.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Reliable and efficient data transfer on the Internet is an important issue. Since late 70's the protocol responsible for that has been the de facto standard TCP, which has proven to be successful through out the years, its self-managed congestion control algorithms have retained the stability of the Internet for decades. However, the variety of existing new technologies such as high-speed networks (e.g. fibre optics) with high-speed long-delay set-up (e.g. cross-Atlantic links) and wireless technologies have posed lots of challenges to TCP congestion control algorithms. The congestion control research community proposed solutions to most of these challenges. This dissertation adds to the existing work by: firstly tackling the highspeed long-delay problem of TCP, we propose enhancements to one of the existing TCP variants (part of Linux kernel stack). We then propose our own variant: TCP-Gentle. Secondly, tackling the challenge of differentiating the wireless loss from congestive loss in a passive way and we propose a novel loss differentiation algorithm which quantifies the noise in packet inter arrival times and use this information together with the span (ratio of maximum to minimum packet inter arrival times) to adapt the multiplicative decrease factor according to a predefined logical formula. Finally, extending the well-known drift model of TCP to account for wireless loss and some hypothetical cases (e.g. variable multiplicative decrease), we have undertaken stability analysis for the new version of the model.
2

Bhandarkar, Sumitha. "Congestion control algorithms of TCP in emerging networks." [College Station, Tex. : Texas A&M University, 2006. http://hdl.handle.net/1969.1/ETD-TAMU-1757.

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

Voice, Thomas David. "Stability of congestion control algorithms with multi-path routing and linear stochastic modelling of congestion control." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614022.

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

Lai, Chengdi, and 賴成迪. "Systematic design of internet congestion control : theory and algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/206356.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The Internet is dynamically shared by numerous flows of data traffic. Network congestion occurs when the aggregate flow rate persistently exceeds the network capacity, leading to excessive delivery delay and loss of user data. To control network congestion, a flow needs to adapt the sending rate to its inferred level of congestion, and a packet switch needs to report its local level of congestion. In this framework of Internet congestion control, it is important for flows to react promptly against congestion, and robustly against interfering network events resembling congestion. This is challenging due to the highly dynamic interactions of various network components over a global scale. Prior approaches rely predominantly on empirical observations in experiments for constructing and validating designs. However, without a careful, systematic examination of all viable options, more efficient designs may be overlooked. Moreover, experimental results have limited applicability to scenarios beyond the specific experimental settings. In this thesis, I employ a novel, systematic design approach. I formalize the design process of Internet congestion control from a minimal set of empirical observations. I prove the robustness and optimality of the attained design in general settings, and validate these properties in practical experimental settings. First, I develop a systematic method for enhancing the robustness of flows against interfering events resembling congestion. The class of additive-increase-multiplicative-decrease (AIMD) algorithms in Transmission Control Protocol (TCP) is the set of dominant algorithms governing the flow rate adaptation process. Over the present Internet, packet reordering and non-congestive loss occur frequently and are misinterpreted by TCP AIMD as packet loss due to congestion. This leads to underutilization of network resources. With a complete, formal characterization of the design space of TCP AIMD, I formulate designing wireless TCP AIMD as an optimal control problem over this space. The derived optimal algorithm attains a significant performance improvement over existing enhancements in packet-level simulation. Second, I propose a novel design principle, known as pricing-link-by-time (PLT), that specifies how to set the measure of congestion, or “link price”, at a router to provide prompt feedback to flows. Existing feedback mechanisms require sophisticated parameter tuning, and experience drastic performance degradation with improperly tuned parameters. PLT makes parameter tuning a simple, optional process. It increases the link price as the backlog stays above a threshold value, and resets the price once the backlog goes below the threshold. I prove that such a system exhibits cyclic behavior that is robust against changes in network environment and protocol parameters. Moreover, changing the threshold value can control delay without undermining system performance. I validate these analytical results using packet-level simulation. The incremental deployment of various enhancements have made Internet congestion control highly heterogeneous. The final part of the thesis studies this issue by analyzing the competition among flows with heterogeneous robustness against interfering network events. While rigorous theories have been a major vehicle for understanding system designs, the thesis involves them directly in the design process. This systematic design approach can fully exploit the structural characteristics, and lead to generally applicable, effective solutions.
published_or_final_version
Electrical and Electronic Engineering
Doctoral
Doctor of Philosophy
5

Chen, Hanliu. "Performance evaluation and analysis of datagram congestion control algorithms in IP networks." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27964.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Providing a TCP-friendly congestion control protocol to support multimedia applications has been a great challenge for many researchers. DCCP (Datagram Congestion Control Protocol) is a promising protocol that was proposed recently. This thesis proposes to use VCP (Variable-structure congestion Control Protocol) to overcome the shortcomings of RED (Random Early Detection). We make mathematical analysis and run OPNET simulation to validate DCCP/VCP congestion control strategy. We have also conducted some performance analysis and made comparison with some other related traffic congestion control strategies under both wired and WiMAX environments. The simulation results show that DCCP/VCP can maintain a shorter buffer queue size than the other congestion control strategies. DCCP/VCP also provides zero packet drop rate which solves the random packet loss problem in RED router.
6

Jia, Guihua. "Performance evaluation of congestion control protocols and loss differentiation algorithms over wireless networks." Thesis, University of Ottawa (Canada), 2007. http://hdl.handle.net/10393/27857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Congestion control protocols for wireless networks must be efficient, TCP-friendly, and robust to random wireless loss. Based on these criteria we have evaluated several different congestion control protocols, such as TCP Westwood, TFRC, MULTFRC, RAP, and IFTP. In wireless network environments, most of these protocols do not work well since wireless losses are counted as congestion losses. Therefore, it is necessary to extend these congestion control protocols with end-to-end Loss Differentiation Algorithms (LDA). We evaluate several existing LDA schemes, including Biaz, mBiaz, Spike, ZigZag, ZBS, PLC, SPLD, and TD, with simulation results showing different drawbacks for each scheme. We thus propose a new LDA scheme: the mSpike scheme. The mSpike scheme classifies the loss type according to the mean and deviation of the relative one-way trip time. The simulation results show that the mSpike scheme has better performance and fewer problems in most of the situations evaluated. We also test the combination of MULTFRC and mSpike under different wireless lossy environments. The simulation results show that they have a high utilization of the available bandwidth. Therefore, this combination would be a good choice for applications with high bandwidth requirements.
7

Özbay, Kaan. "A framework for dynamic traffic diversion during non-recurrent congestion: models and algorithms." Diss., Virginia Tech, 1996. http://hdl.handle.net/10919/39210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Real-time control of traffic diversion during non-recurrent congestion continues to be a challenging topic. Especially, with the advent of Intelligent Transportation Systems (ITS), the need for models and algorithms that will control the diversion in real-time, responding to the current traffic conditions has become evident. Several researchers have tried to solve this on-line control problem by adopting different approaches such as, expert systems, feedback control, and mathematical programming. In order to ensure the effectiveness of real-time traffic diversion, an implementation framework capable of predicting the impact of the incident on the traffic flow, generating feasible alternate routes in real-time, and controlling traffic in order to achieve a pre-set goal based on a system optimal or a user equilibrium concept is required. In this dissertation, a framework that would satisfy these requirements is adopted consisting of a "diversion initiation module", a "diversion strategy planning module", and a "control and routing module" which determines the route guidance commands in real-time. The incident duration data collected by the Northern Virginia incident management agencies is analyzed to determine major factors that affect the incident clearance duration. Next, prediction/decision trees are developed for different types of incidents. Based on the validation of these trees using the data that is not employed for the development of the trees, it is found that they perform well for the majority of the incidents. A simple deterministic queuing approach is used to predict the delays that will be caused by the incident for which the clearance duration is predicted using the prediction/decision trees. The diversion strategy planning module, Network Generator, is developed as a knowledge based expert system that uses simple expert rules in conjunction with historical and realtime data to determine the incident impact zone, and to eliminate links that are not suitable for diversion. Finally, it generates alternate routes for diversion using this modified network. Network generator is tested using simulation on a small portion of the Fairfax network. Finally, feedback control models for dynamic traffic routing models, both in distributed and lumped parameter settings, are developed. Methods for developing controllers for these models are also discussed. Two heuristic and analytic feedback controllers for the space discretized lumped parameter models are developed and their effectiveness for realtime traffic control is shown by simulating several scenarios on a simple network. An analytic feedback controller is also designed using a feedback linearization technique for the space discretized model. This controller also performed very well during simulations of various scenarios and proved to be an effective solution to this feedback control problem.
Ph. D.
8

Braga, Andrà Ribeiro. "Controle de congestionamento para voz sobre IP em HSDPA." Universidade Federal do CearÃ, 2006. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
nÃo hÃ
O crescimento do nÃmero dos usuÃrios do serviÃo de Voice over IP(VoIP) faz dele o serviÃo com o maior interesse de ser provido por operadoras de telefonia celular. Por outro lado, este demanda um controle de Quality of Service (QoS) bastante rÃgido, o que torna-se mais complicado em redes sem fio, porque alÃm de congestionamentos na rede, os pacotes podem ser perdidos devido à erros nas transmissÃes no enlace de rÃdio. Dentro deste paradigma, estratÃgias de controle de congestionamento aparecem como uma boa soluÃÃo para lidar com as garantias de QoS em situaÃÃes de sobrecarga do sistema, onde os recursos se encontram exauridos e os requerimentos de qualidade se encontram ameaÃados. Este trabalho consiste na avaliaÃÃo de algoritmos de controle de congestionamento objetivando um aumento de capacidade e das garantias de QoS para serviÃos de voz. Os algoritmos avaliados neste trabalho sÃo os escalonamentos de pacotes e os controles de admissÃo. A anÃlise em cenÃrios de serviÃos mistos composto por usuÃrios VoIP e Web tambÃm està contida neste trabalho. O maior foco està no controle do atraso de pacote, jà que este à um requerimento crucial para serviÃos de tempo-real, como o VoIP. Os resultados mostram que um arcabouÃo de controle de congestionamento projetado para este serviÃo à capaz de melhorar o desempenho do sistema e mitigar os efeitos de congestionamento da rede. No cenÃrio de serviÃos mistos, os algoritmos sÃo capazes de efetuar reserva de recursos dependendo da prioridade definida para cada serviÃo, levando a um aumento na qualidade percebida pelo serviÃo mais sensÃvel atravÃs de uma leve degradaÃÃo no serviÃo mais robusto.
The growth in the number of Voice over IP(VoIP) users on the internet makes it the service with the highest interest to be provided by cellular operators. On the other hand, it demands very strict Quality of Service (QoS) control, which becomes even more complicated in wireless networks, because packets can be lost due to radio link transmission erros, as well as networks congestion. Within this paradigm, congestion control strategies appear as a good solution to cope with QoS guarantees under high loads, where the resources are exhausted and the service quality is threatened. This works comprises the evaluation of congestion control algorithms aiming to improve system capacity and QoS guarantees for speech users. The evaluated alagorithms within this work are packet scheduling and admission control. The analysys in mixed services scenarios composed of VoIP and Web users is also provid in this works. The main focus of the framework is to control the packet delay, since it is a crucial requirement for real-time services. The results show thata suitable congestion control framework is able to provid perfomace improvements and mitigation of the the effects from overloaded conditions. In the mixed services scenario, the algorithms are capable to perform resource reservation depending on the priority defined to each service, leanding to an increase in the quality of more sensitive service by degrading the more robust service
9

TRAVERSO, STEFANO. "Design of Algorithms and Protocols for Peer-To-Peer Streaming Systems." Doctoral thesis, Politecnico di Torino, 2012. http://hdl.handle.net/11583/2497192.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Peer-to-Peer Streaming (P2P-TV) systems have been studied in the literature for some time and they are becoming popular among users as well. P2P-TV systems target the real time delivery of a video stream, therefore posing different challenges compared to more traditional peer-to-peer applications such as file sharing (BitTor-rent) or VoIP (Skype). This document focuses on mesh based P2P-TV systems in which the peers form a generic overlay topology at application level upon which peers exchange small “chunks” of video. In particular, we study two problems related with this kind of systems: i) how to induce peers to share their available resources – such as their available upload bandwidth – in a totally automatic and distributed way; ii) how to localize P2P-TV traffic in order to lower the load on the underlying transport network without impairing the quality of experience (QoE) perceived by users. Goal i) can be achieved playing on two key aspects of P2P-TV systems that are: • the design of the trading phase needed to exchange chunks among neighbors; • the strategy adopted by peers to choose the neighbors to connect with, i.e., the policy employed to build and maintain the overlay topology at application level. The former task has been successfully accomplished with the development of algorithms that aim at adapting the rate at which peers offer chunks to their neighbors to both peer’s available upload bandwidth and to the system demand. The results presented in this document show that the automatic adjustment of transmission rate to available upload capacity reduce delivery delays of chunks, thus improving the experience of users. Focusing on the latter problem, we prove that the topological properties of the overlay have a deep effect on both users’ QoE and network impact. We developed a smart, flexible and fully distributed algorithm for neighbors selection and implemented it in a real P2P-TV client. This let us compare several different strategies for overlay construction in a large campaign of test-bed experiments. Results show that we can actually achieve the goal of leading peers to efficiently share their available resources – goal i) – while keeping a good degree of traffic localization, hence lowering the load on the underlying network – goal ii). Furthermore, our experimental results show that a proper selection of the neighborhood leads to a win-win situation where the performance of the application and QoE are both improved, while the network stress is nicely reduced.
10

Roverso, Roberto. "A System, Tools and Algorithms for Adaptive HTTP-live Streaming on Peer-to-peer Overlays." Doctoral thesis, KTH, Programvaruteknik och Datorsystem, SCS, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-134351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In recent years, adaptive HTTP streaming protocols have become the de facto standard in the industry for the distribution of live and video-on-demand content over the Internet. In this thesis, we solve the problem of distributing adaptive HTTP live video streams to a large number of viewers using peer-to-peer (P2P) overlays. We do so by assuming that our solution must deliver a level of quality of user experience which is the same as a CDN while trying to minimize the load on the content provider’s infrastructure. Besides that, in the design of our solution, we take into consideration the realities of the HTTP streaming protocols, such as the pull-based approach and adaptive bitrate switching. The result of this work is a system which we call SmoothCache that provides CDN-quality adaptive HTTP live streaming utilizing P2P algorithms. Our experiments on a real network of thousands of consumer machines show that, besides meeting the the CDN-quality constraints, SmoothCache is able to consistently deliver up to 96% savings towards the source of the stream in a single bitrate scenario and 94% in a multi-bitrate scenario. In addition, we have conducted a number of pilot deployments in the setting of large enterprises with the same system, albeit tailored to private networks. Results with thousands of real viewers show that our platform provides an average offloading of bottlenecks in the private network of 91.5%. These achievements were made possible by advancements in multiple research areas that are also presented in this thesis. Each one of the contributions is novel with respect to the state of the art and can be applied outside of the context of our application. However, in our system they serve the purposes described below. We built a component-based event-driven framework to facilitate the development of our live streaming application. The framework allows for running the same code both in simulation and in real deployment. In order to obtain scalability of simulations and accuracy, we designed a novel flow-based bandwidth emulation model. In order to deploy our application on real networks, we have developed a network library which has the novel feature of providing on-the-fly prioritization of transfers. The library is layered over the UDP protocol and supports NAT Traversal techniques. As part of this thesis, we have also improved on the state of the art of NAT Traversal techniques resulting in higher probability of direct connectivity between peers on the Internet. Because of the presence of NATs on the Internet, discovery of new peers and collection of statistics on the overlay through peer sampling is problematic. Therefore, we created a peer sampling service which is NAT-aware and provides one order of magnitude fresher samples than existing peer sampling protocols. Finally, we designed SmoothCache as a peer-assisted live streaming system based on a distributed caching abstraction. In SmoothCache, peers retrieve video fragments from the P2P overlay as quickly as possible or fall back to the source of the stream to keep the timeliness of the delivery. In order to produce savings, the caching system strives to fill up the local cache of the peers ahead of playback by prefetching content. Fragments are efficiently distributed by a self-organizing overlay network that takes into account many factors such as upload bandwidth capacity, connectivity constraints, performance history and the currently being watched bitrate.

QC 20131122

More sources

Books on the topic "Congestion control algorithms":

1

Hon, Herbert. An adaptive bandwidth enforcement and congestion control algorithm for broadband ISDN. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1992.

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

Klein, Lawrence A. Sensor and Data Fusion for Intelligent Transportation Systems. SPIE, 2019.

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

Book chapters on the topic "Congestion control algorithms":

1

Liu, Wu, Hai-Xin Duan, Jian-Ping Wu, Xing Li, and Ping Ren. "Algorithms for Congestion Detection and Control." In Grid and Cooperative Computing - GCC 2004 Workshops, 374–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30207-0_47.

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

Syam Kumar, S., and T. A. Sumesh. "A New Congestion Control Algorithm for SCTP." In Algorithms for Intelligent Systems, 27–36. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5243-4_3.

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

Gecse, Roland, and Péter Krémer. "Automated Test of TCP Congestion Control Algorithms." In IFIP Advances in Information and Communication Technology, 149–63. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-0-387-35567-2_10.

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

Abdelfattah, Eman. "Performance Evaluation of TCP Congestion Control Mechanisms." In Novel Algorithms and Techniques in Telecommunications and Networking, 251–56. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-3662-9_43.

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

Iliev, Teodor, Tsviatko Bikov, Grigor Mihaylov, Elena Ivanova, Ivaylo Stoyanov, and Ventsislav Keseev. "Algorithms for Congestion Control in LTE Mobile Networks." In Advances in Intelligent Systems and Computing, 474–84. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91186-1_49.

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

Srikant, Rayadurgam. "Models and Methods for Analyzing Internet Congestion Control Algorithms." In Advances in Communication Control Networks, 65–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-31597-1_4.

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

Zhang, Bo, Ying Wang, and Xiya Yang. "Fairness Analysis and Optimization of BBR Congestion Control Algorithm." In Algorithms and Architectures for Parallel Processing, 77–88. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-0798-0_5.

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

Vahidnia, R., M. Najafi, H. Firouzi, and M. T. H. Beheshti. "Nonlinear Congestion Control Scheme for Time Delayed Differentiated-Services Networks." In Novel Algorithms and Techniques in Telecommunications and Networking, 93–97. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-3662-9_15.

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

Suma, S., and Bharati Harsoor. "Congestion Control Algorithms for Traffic and Resource Control in Wireless Sensor Networks." In Learning and Analytics in Intelligent Systems, 750–58. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24322-7_88.

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

Capone, Antonio, Luigi Fratta, and Fabio Martignon. "Enhanced Bandwidth Estimation Algorithms in the TCP Congestion Control Scheme." In IFIP Advances in Information and Communication Technology, 469–80. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-0-387-35620-4_42.

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

Conference papers on the topic "Congestion control algorithms":

1

Ferreira, Margarida, Akshay Narayan, Inês Lynce, Ruben Martins, and Justine Sherry. "Counterfeiting Congestion Control Algorithms." In HotNets '21: The 20th ACM Workshop on Hot Topics in Networks. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3484266.3487381.

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

Turkovic, Belma, Fernando A. Kuipers, and Steve Uhlig. "Interactions between Congestion Control Algorithms." In 2019 Network Traffic Measurement and Analysis Conference (TMA). IEEE, 2019. http://dx.doi.org/10.23919/tma.2019.8784674.

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

Lavaei, Javad, John C. Doyle, and Steven H. Low. "Congestion control algorithms from optimal control perspective." In 2009 Joint 48th IEEE Conference on Decision and Control (CDC) and 28th Chinese Control Conference (CCC). IEEE, 2009. http://dx.doi.org/10.1109/cdc.2009.5399554.

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

Sterca, Adrian. "Primal Congestion Control Algorithms for Multimedia Streams." In 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2008. http://dx.doi.org/10.1109/synasc.2008.83.

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

Simaiakis, Ioannis, and Hamsa Balakrishnan. "Design and simulation of airport congestion control algorithms." In 2014 American Control Conference - ACC 2014. IEEE, 2014. http://dx.doi.org/10.1109/acc.2014.6859480.

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

Hu, Haina, and Lin Yao. "Improvement for Congestion Control Algorithms under DDoS Attacks." In 2009 International Conference on Computational Intelligence and Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cise.2009.5365324.

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

Bansal, Deepak, Hari Balakrishnan, Sally Floyd, and Scott Shenker. "Dynamic behavior of slowly-responsive congestion control algorithms." In the 2001 conference. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/383059.383080.

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

Shen, Yixin, Zili Meng, Jing Chen, and Mingwei Xu. "Quantifying the transient performance of congestion control algorithms." In SIGCOMM '21: ACM SIGCOMM 2021 Conference. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472716.3472861.

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

Voice, Thomas. "Stability of multi-path dual congestion control algorithms." In the 1st international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1190095.1190167.

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

Lavaei, Javad, John C. Doyle, and Steven H. Low. "Utility Functionals Associated With Available Congestion Control Algorithms." In IEEE INFOCOM 2010 - IEEE Conference on Computer Communications. IEEE, 2010. http://dx.doi.org/10.1109/infcom.2010.5462103.

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

Reports on the topic "Congestion control algorithms":

1

Floyd, S., and M. Allman. Specifying New Congestion Control Algorithms. RFC Editor, August 2007. http://dx.doi.org/10.17487/rfc5033.

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

Long, Robert Michael. Evaluation of TCP congestion control algorithms. Office of Scientific and Technical Information (OSTI), December 2003. http://dx.doi.org/10.2172/918389.

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

Li, Yee-Ting, and /SLAC. Evaluation of TCP Congestion Control Algorithms on the Windows Vista Platform. Office of Scientific and Technical Information (OSTI), July 2006. http://dx.doi.org/10.2172/885508.

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

To the bibliography