4,414 research outputs found
Performance of active multicast congestion control
This paper aims to provide insight into the behavior of congestion control mechanisms for reliable multicast protocols. A multicast congestion control based on active networks has been proposed and simulated using ns-2 over a network topology obtained using the Tiers tool. The congestion control mechanism has been simulated under different network conditions and with different settings of its configuration parameters. The objective is to analyze its performance and the impact of the different configuration parameters on its behavior. The simulation results show that the performance of the protocol is good in terms of delay and bandwidth utilization. The compatibility of the protocol with TCP flows has not been demonstrated, but the simulations performed show that by altering the parameter settings, the proportion of total bandwidth taken up by the two types of flow, multicast and TCP, may be modified.Publicad
ABC: A Simple Explicit Congestion Controller for Wireless Networks
We propose Accel-Brake Control (ABC), a simple and deployable explicit
congestion control protocol for network paths with time-varying wireless links.
ABC routers mark each packet with an "accelerate" or "brake", which causes
senders to slightly increase or decrease their congestion windows. Routers use
this feedback to quickly guide senders towards a desired target rate. ABC
requires no changes to header formats or user devices, but achieves better
performance than XCP. ABC is also incrementally deployable; it operates
correctly when the bottleneck is a non-ABC router, and can coexist with non-ABC
traffic sharing the same bottleneck link. We evaluate ABC using a Wi-Fi
implementation and trace-driven emulation of cellular links. ABC achieves
30-40% higher throughput than Cubic+Codel for similar delays, and 2.2X lower
delays than BBR on a Wi-Fi path. On cellular network paths, ABC achieves 50%
higher throughput than Cubic+Codel
On-Line End-to-End Congestion Control
Congestion control in the current Internet is accomplished mainly by TCP/IP.
To understand the macroscopic network behavior that results from TCP/IP and
similar end-to-end protocols, one main analytic technique is to show that the
the protocol maximizes some global objective function of the network traffic.
Here we analyze a particular end-to-end, MIMD (multiplicative-increase,
multiplicative-decrease) protocol. We show that if all users of the network use
the protocol, and all connections last for at least logarithmically many
rounds, then the total weighted throughput (value of all packets received) is
near the maximum possible. Our analysis includes round-trip-times, and (in
contrast to most previous analyses) gives explicit convergence rates, allows
connections to start and stop, and allows capacities to change.Comment: Proceedings IEEE Symp. Foundations of Computer Science, 200
Inferring Person-to-person Proximity Using WiFi Signals
Today's societies are enveloped in an ever-growing telecommunication
infrastructure. This infrastructure offers important opportunities for sensing
and recording a multitude of human behaviors. Human mobility patterns are a
prominent example of such a behavior which has been studied based on cell phone
towers, Bluetooth beacons, and WiFi networks as proxies for location. However,
while mobility is an important aspect of human behavior, understanding complex
social systems requires studying not only the movement of individuals, but also
their interactions. Sensing social interactions on a large scale is a technical
challenge and many commonly used approaches---including RFID badges or
Bluetooth scanning---offer only limited scalability. Here we show that it is
possible, in a scalable and robust way, to accurately infer person-to-person
physical proximity from the lists of WiFi access points measured by smartphones
carried by the two individuals. Based on a longitudinal dataset of
approximately 800 participants with ground-truth interactions collected over a
year, we show that our model performs better than the current state-of-the-art.
Our results demonstrate the value of WiFi signals in social sensing as well as
potential threats to privacy that they imply
Economic FAQs About the Internet
This is a set of Frequently Asked Questions (and answers) about the economic, institutional, and technological structure of the Internet. We describe the history and current state of the Internet, discuss some of the pressing economic and regulatory problems, and speculate about future developments.Internet, telecommunications, congestion pricing, National Information Infrastructure
Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing
Data transfer is one of the main functions of the Internet. The Internet
consists of a large number of interconnected subnetworks or domains, known as
Autonomous Systems. Due to privacy and other reasons the information about what
route to use to reach devices within other Autonomous Systems is not readily
available to any given Autonomous System. The Border Gateway Protocol is
responsible for discovering and distributing this reachability information to
all Autonomous Systems. Since the topology of the Internet is highly dynamic,
all Autonomous Systems constantly exchange and update this reachability
information in small chunks, known as routing control packets or Border Gateway
Protocol updates. Motivated by scalability and predictability issues with the
dynamics of these updates in the quickly growing Internet, we conduct a
systematic time series analysis of Border Gateway Protocol update rates. We
find that Border Gateway Protocol update time series are extremely volatile,
exhibit long-term correlations and memory effects, similar to seismic time
series, or temperature and stock market price fluctuations. The presented
statistical characterization of Border Gateway Protocol update dynamics could
serve as a ground truth for validation of existing and developing better models
of Internet interdomain routing
IDEALIST control and service management solutions for dynamic and adaptive flexi-grid DWDM networks
Wavelength Switched Optical Networks (WSON) were designed with the premise that all channels in a network have the same spectrum needs, based on the ITU-T DWDM grid. However, this rigid grid-based approach is not adapted to the spectrum requirements of the signals that are best candidates for long-reach transmission and high-speed data rates of 400Gbps and beyond. An innovative approach is to evolve the fixed DWDM grid to a flexible grid, in which the optical spectrum is partitioned into fixed-sized spectrum slices. This allows facilitating the required amount of optical bandwidth and spectrum for an elastic optical connection to be dynamically and adaptively allocated by assigning the necessary number of slices of spectrum. The ICT IDEALIST project will provide the architectural design, protocol specification, implementation, evaluation and standardization of a control plane and a network and service management system. This architecture and tools are necessary to introduce dynamicity, elasticity and adaptation in flexi-grid DWDM networks. This paper provides an overview of the objectives, framework, functional requirements and use cases of the elastic control plane and the adaptive network and service management system targeted in the ICT IDEALIST project
- …