检索结果-内蒙古大学图书馆

7th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)

作者： Michopoulos, Vasilis Guan, Lin Oikonomou, George Phillips, Iain Univ Loughborough Dept Comp Sci Loughborough LE11 3TU Leics England

ISBN: (纸本)9781457705137

In Wireless Sensor Networks (WSNs), congestion can cause a plethora of malfunctions such as packet loss, lower throughput and energy inefficiency, potentially resulting in reduced deployment lifetime and under-performing applications. This has led to several proposals describing congestion control (CC) mechanisms for sensor networks. Furthermore, the WSN research community has made significant efforts towards power saving MAC protocols with Radio Duty Cycling (RDC). However, careful study of previous work reveals that RDC schemes are often neglected during the design and evaluation of congestion control algorithms. In this paper, we argue that the presence (or lack) of RDC can drastically influence the performance of congestion detection. In addition, most WSN CC mechanisms are evaluated under traditional sensor network topologies and protocols (e. g. trickle data dissemination, tree data collection). The emerging IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) and related standards pose a new requirement: we now need to investigate if previous findings regarding congestion control are still applicable. In this context, this paper contributes a comprehensive evaluation of existing congestion detection mechanisms in a simulated, multi-node 6LoWPAN sensor network. We present results from two sets of experiments, differentiated by the presence or lack of RDC.

关键词： 6LoWPAN IP networks IPv6 over Low power Wireless Personal Area Networks IPv6 wireless sensor networks Monitoring Multiaccess communication Protocols Receivers Routing Throughput Wireless sensor networks congestion control algorithms congestion detection p

来源：评论

学校读者我要写书评

暂无评论

Traditional TCP congestion control algorithms Evaluation in Wired-cum-Wireless Networks A performance evaluation of wired-cum-wireless networks 11

Traditional TCP Congestion Control Algorithms Evaluation in ...

引用

11th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC)

作者： Dias, M. C. Caldeira, L. A. Perkusich, A. Fed Inst Educ Sci & Technol Paraiba IFPB Elect Engn Coordinat Lab Telephony & Convergent Networks LTCON Joao Pessoa Paraiba Brazil Fed Univ Campina Grande UFCG Dept Elect Engn Postgrad Program Elect Engn PpgEE COPELE Campina Grande Brazil

ISBN: (纸本)9781479953448

congestion control algorithms exist for decades to prevent package loss in intense traffic networks. Several solutions developed over the years tried to solve this problem, including the creation of new algorithms. However, hybrid wired and wireless networks, or wired-cum-wireless, common in modern days, bring new challenges to programmers and engineers who try to overcome the numerous new problems that this kind of network presents. This work carries out a performance comparison, in a wired-cum-wireless network, using TCP congestion control algorithms variants: New Reno and CUBIC. The comparison is to determine which of those algorithms performs better in several situations, like multiple disconnections caused by mobility, interference and congested links. The results showed that the CUBIC is a more stable and fair algorithm, but it has a significantly less data flow than New Reno.

关键词： congestion control algorithms Mobility in networks Wired-cum-wireless networks

来源：评论

学校读者我要写书评

暂无评论

Measurement Analysis of TCP congestion control algorithms in LTE Uplink 2

Measurement Analysis of TCP Congestion Control Algorithms in...

引用

2nd Network Traffic Measurement and Analysis Conference (TMA)

作者： Parichehreh, Ali Alfredsson, Stefan Brunstrom, Anna Karlstad Univ Dept Math & Comp Sci Karlstad Sweden

ISBN: (纸本)9781538671528

The unprecedented growth of user generated contents yielded by the proliferation of social networks applications, cellular based video surveillance and device-to-device (D2D) communication, makes the cellular uplink communication an attractive topic. In this paper we conduct a systematic evaluation and measurement analysis to characterize cellular uplink traffic and compare its interplay with different TCP congestion control algorithms (CCA), namely NewReno, Cubic, and BBR, in both stationary and mobility scenarios. The evaluation encompasses average throughput, average round trip time (RTT), fairness among simultaneous flows, and packet retransmission. The intended behavior of BBR has been observed in LTE uplink, but some severe issues such as lack of fairness among simultaneous flows and massive on device packet losses have been observed. It is observed that the lack of fairness among simultaneous flows can unpredictably change the throughput of multi-flow applications.

关键词： Measurement Analysis congestion control algorithms Long Term Evolution Uplink Communications

来源：评论

学校读者我要写书评

暂无评论

TCP FlexiS: A New Approach to Incipient congestion Detection and control

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2024年第2期32卷 1245-1260页

作者： Li, Qian Univ Oslo Dept Informat Oslo Norway

Best effort congestion controls strive to achieve an equitable distribution of network resources among competing flows. However, fair resource allocation becomes undesirable when a bandwidth/delay sensitive application shares a bottleneck with a greedy background application. Less than Best Effort (LBE) congestion control algorithms (CCA) are specially designed for background applications, which do not have strict bandwidth/delay requirements. LBE CCAs give foreground applications higher priority in resource allocation by only utilizing spare bandwidth. This can greatly improve network utility at times of congestion. We propose FlexiS - a Flexible Sender side LBE CCA. Unlike most conventional LBE CCAs, which use queue size based congestion detectors and linear rate controllers, FlexiS employs a queue trend based congestion detector and a cubic increase multiplicative decrease rate controller. We have compared FlexiS with LEDBAT and LEDBAT ++ . Extensive emulation and preliminary Internet tests showed that: 1) FlexiS has comparatively low impact on concurrent best effort TCP flows;2) it scales to a wide range of available bandwidths;3) FlexiS flows in aggregation can effectively utilize available bandwidth;4) contending FlexiS flows can, in most cases, equally share available bandwidth;5) FlexiS adapts to route changes quickly;and 6) it maintains low priority even when AQM algorithms or shallow buffers are deployed.

关键词： Lower than best effort LBE low priority congestion control algorithms

来源：评论

学校读者我要写书评

暂无评论

Fair flow control for ATM-ABR multipoint connections

引用

COMPUTER COMMUNICATIONS 2002年第8期25卷 741-755页

作者： Fahmy, S Jain, R Goyal, R Vandalore, B Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Ohio State Univ Dept CIS Columbus OH 43210 USA Axiowave Networks Marlborough MA USA Nokia Mountain View CA USA

Multipoint-to-multipoint communication can be implemented by combining the point-to-multipoint and multipoint-to-point connection algorithms. In an ATM multipoint-to-point connection, multiple sources send data to the same destination on a shared tree. Traffic from multiple branches is merged into a single stream after every merge point. It is sometimes impossible for the network to determine any source-specific characteristics since all sources in the multipoint connection may use the same connection identifiers. The challenge is to develop a fair rate allocation algorithm without per-source accounting as this is inequivalent to per-connection or per-flow accounting in this case. We define fairness objectives for multipoint connections, and we design and simulate an O(1) fair ATM-ABR rate allocation scheme for point-to-point and multipoint connections sharing the same links. Simulation results show that the algorithm performs well and exhibits many desirable properties. We list key modifications necessary for any ATM-ABR rate allocation scheme to fairly accommodate multiple sources. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： available bit rate asynchronous transfer mode bandwidth allocation algorithms congestion control algorithms fairness multicasting

来源：评论

学校读者我要写书评

暂无评论

Experimentation and Analysis of Multipath TCP 9

Experimentation and Analysis of Multipath TCP

引用

9th IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)

作者： Anilal, P. Sainandan, B. V. Sai, Siva Sankara S. Yellai, Prabhakara Sri Sathya Sai Inst Higher Learning Dept Phys Prasanthinilayam AP India Cisco Syst Inc Bangalore Karnataka India

ISBN: (纸本)9781509002931

In this paper we experiment and analyze the Multi-path TCP (MPTCP) proposed by Internet Engineering Task Force (IETF). The authors consider MPTCP offerings such as multipath aggregation, increased throughput, enhanced resilience, network handover and employing various congestion control algorithms over multipaths to aggregate available bandwidth as key factors to assess experiments with various topologies.

关键词： MPTCP congestion control algorithms Experimentation Analysis

来源：评论

学校读者我要写书评

暂无评论

Automated Identification of BBR Traffic based on Packet Inter-Arrival Times Analysis 35

Automated Identification of BBR Traffic based on Packet Inte...

引用

35th International Teletraffic Congress (ITC)

作者： Tlaiss, Ziad Ferrieux, Alexandre Amigo, Isabel Hamchaoui, Isabelle Vaton, Sandrine IMT Atlantique Lab STICC Lab Brest France Orange Labs Networks Lannion France

ISBN: (纸本)9798350360080;9798350360073

The Internet is a complex and constantly evolving system, and congestion control algorithms play a crucial role in ensuring its functioning by managing network performance. These algorithms regulate the flow of data within a network and optimize data transmission for efficiency and effectiveness. They do this by continuously estimating available network resources and adjusting the data transmission rate accordingly. For network operators, identifying the congestion control algorithms being used on their network is essential to gain valuable insights into network performance and device behavior. This information can help them gain a better understanding of how the network is being utilized and which algorithms are most effective in different scenarios. With a clear understanding of the congestion control algorithms in use, they can make decisions about network design, configuration, and management. Nowadays, over 85% of total Internet traffic is TCP traffic. TCP uses different congestion control algorithms, of which BBR and CUBIC represent 73% of the total TCP traffic. In this work, we present a method for automatically identifying BBR traffic on the Internet. Our method relies on analyzing packet inter-arrival times, specifically comparing the distribution of packet inter-arrival times during the Slow-Start state of a BBR capture with those of a CUBIC capture. We introduce a model that allows us to detect the silence period after packet bursts that are present in almost all non-BBR congestion control algorithms. This method is characterized by a very simple frontend signal processing that exploits the algorithms' core principles, allowing for a tiny parameter space dimension (two), which is sufficient for robust discrimination: an error rate of 4.1% was obtained on a test dataset independent from training.

关键词： Packet trace TCP variants packet inter-arrival times Slow-Start state congestion control algorithms BBR.

来源：评论

学校读者我要写书评

暂无评论

Prudentia: Findings of an Internet Fairness Watchdog 24

Prudentia: Findings of an Internet Fairness Watchdog

引用

ACM SIGCOMM Conference

作者： Philip, Adithya Abraham Athapathu, Rukshani Ware, Ranysha Mkocheko, Fabian Francis Schlomer, Alexis Shou, Mengrou Meng, Zili Seshan, Srinivasan Sherry, Justine Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Calif San Diego San Diego CA USA HKUST Hong Kong Peoples R China

ISBN: (纸本)9798400706141

With the rise of heterogeneous congestion control algorithms and increasingly complex application control loops (e.g. adaptive bitrate algorithms), the Internet community has expressed growing concern that network bandwidth allocations are unfairly skewed, and that some Internet services are 'winners' at the expense of 'losing' services when competing over shared bottlenecks. In this paper, we provide the first study of fairness between live, end-to-end services with distinct workloads. Rather than focusing on individual components of an application stack (e.g., studying the fairness of an individual congestion control algorithm), we want to provide a direct study over real-world deployed applications. Among our findings, we observe that services typically achieve less-than-fair outcomes: on average, the 'losing' service achieves only 72% of its max-min fair share of link bandwidth. We also find that some services are significantly more contentious than others: for example, one popular file distribution service causes competing applications to obtain as low as 16% of their max-min fair share of bandwidth when competing in a moderately-constrained setting.

关键词： computer networks internet fairness internet measurement internet services congestion control algorithms

来源：评论

学校读者我要写书评

暂无评论

Sammy: smoothing video traffic to be a friendly internet neighbor 23

Sammy: smoothing video traffic to be a friendly internet nei...

引用

ACM SIGCOMM Conference (SIGCOMM)

作者： Spang, Bruce Kunamalla, Shravya Teixeira, Renata Huang, Te-Yuan Armitage, Grenville Johari, Ramesh McKeown, Nick Stanford Univ Stanford CA 94305 USA Netflix Los Gatos CA USA

ISBN: (纸本)9798400702365

On-demand streaming video traffic is managed by an adaptive bitrate (ABR) algorithm whose job is to optimize quality of experience (QoE) for a single video session. ABR algorithms leave the question of sharing network resources up to transport-layer algorithms. We observe that as the internet gets faster relative to video streaming rates, this delegation of responsibility gives video traffic a burstier on-off traffic pattern. In this paper, we show we can substantially smooth video traffic to improve its interactions with the rest of the internet, while maintaining the same or better QoE for streaming video. We smooth video traffic with two design principles: application-informed pacing, which allows ABR algorithms to set an upper limit on packet-by-packet throughput, and by designing ABR algorithms that work with pacing. We propose a joint ABR and rate-control scheme, called Sammy, which selects both video quality and pacing rates. We implement our scheme and evaluate it at a large video streaming service. Our approach smooths video, making it a more friendly neighbor to other internet applications. One surprising result is that being friendlier requires no compromise for the video traffic: in large scale, production experiments, Sammy improves video QoE over an existing, extensively tested and tuned production ABR algorithm.

关键词： Video streaming Adaptive bitrate algorithms congestion control algorithms Network friendliness

来源：评论

学校读者我要写书评

暂无评论

HOW TO MODEL A TCP/IP NETWORK USING ONLY 20 PARAMETERS

HOW TO MODEL A TCP/IP NETWORK USING ONLY 20 PARAMETERS

引用

2010 Winter Simulation Conference

作者： Mills, Kevin L. Schwartz, Edward J. Yuan, Jian Natl Inst Stand & Technol Informat Technol Lab Gaithersburg MD 20899 USA Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)9781424498642

Most simulation models for data communication networks encompass hundreds of parameters that can each take on millions of values. Such models are difficult to understand, parameterize and investigate. This paper explains how to model a modern data communication network concisely, using only 20 parameters. Further, the paper demonstrates how this concise model supports efficient design of simulation experiments. The model has been implemented as a sequential simulation called MesoNet, which uses Simulation Language with Extensibility (SLX). The paper discusses model resource requirements and the performance of SLX. The model and principles delineated in this paper have been used to investigate parameter spaces for large (hundreds of thousands of simultaneously active flows), fast (hundreds of Gigabits/second) simulated networks under a variety of congestion control algorithms.

关键词： 20 parameters MesoNet SLX TCP/IP network congestion control algorithms data communication data communication networks sequential simulation simulation language with extensibility telecommunication computing transport protocols

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：