61,506 research outputs found
The State of Network Neutrality Regulation
The Network Neutrality (NN) debate refers to the battle over the design of a regulatory framework for preserving the Internet as a public network and open innovation platform. Fueled by concerns that broadband access service providers might abuse network management to discriminate against third party providers (e.g., content or application providers), policymakers have struggled with designing rules that would protect the Internet from unreasonable network management practices. In this article, we provide an overview of the history of the debate in the U.S. and the EU and highlight the challenges that will confront network engineers designing and operating networks as the debate continues to evolve.BMBF, 16DII111, Verbundprojekt: Weizenbaum-Institut fĂĽr die vernetzte Gesellschaft - Das Deutsche Internet-Institut; Teilvorhaben: Wissenschaftszentrum Berlin fĂĽr Sozialforschung (WZB)EC/H2020/679158/EU/Resolving the Tussle in the Internet: Mapping, Architecture, and Policy Making/ResolutioNe
Recommended from our members
Survey of traffic control schemes and error control schemes for ATM networks
Among the techniques proposed for B-ISDN transfer mode, ATM concept is considered to be the most promising transfer technique because of its flexibility and efficiency. This paper surveys and reviews a number of topics related to ATM networks. Those topics cover congestion control, provision of multiple classes of traffic, and error control. Due to the nature of ATM networks, those issues are far more challenging than in conventional networks. Sorne of the more promising solutions to those issues are surveyed, and the corresponding results on performance are summarized. Future research problems in ATM protocol aspect are also presented
Graph-based Semi-Supervised & Active Learning for Edge Flows
We present a graph-based semi-supervised learning (SSL) method for learning
edge flows defined on a graph. Specifically, given flow measurements on a
subset of edges, we want to predict the flows on the remaining edges. To this
end, we develop a computational framework that imposes certain constraints on
the overall flows, such as (approximate) flow conservation. These constraints
render our approach different from classical graph-based SSL for vertex labels,
which posits that tightly connected nodes share similar labels and leverages
the graph structure accordingly to extrapolate from a few vertex labels to the
unlabeled vertices. We derive bounds for our method's reconstruction error and
demonstrate its strong performance on synthetic and real-world flow networks
from transportation, physical infrastructure, and the Web. Furthermore, we
provide two active learning algorithms for selecting informative edges on which
to measure flow, which has applications for optimal sensor deployment. The
first strategy selects edges to minimize the reconstruction error bound and
works well on flows that are approximately divergence-free. The second approach
clusters the graph and selects bottleneck edges that cross cluster-boundaries,
which works well on flows with global trends
Phase Synchronization in Railway Timetables
Timetable construction belongs to the most important optimization problems in
public transport. Finding optimal or near-optimal timetables under the
subsidiary conditions of minimizing travel times and other criteria is a
targeted contribution to the functioning of public transport. In addition to
efficiency (given, e.g., by minimal average travel times), a significant
feature of a timetable is its robustness against delay propagation. Here we
study the balance of efficiency and robustness in long-distance railway
timetables (in particular the current long-distance railway timetable in
Germany) from the perspective of synchronization, exploiting the fact that a
major part of the trains run nearly periodically. We find that synchronization
is highest at intermediate-sized stations. We argue that this synchronization
perspective opens a new avenue towards an understanding of railway timetables
by representing them as spatio-temporal phase patterns. Robustness and
efficiency can then be viewed as properties of this phase pattern
Internet's Critical Path Horizon
Internet is known to display a highly heterogeneous structure and complex
fluctuations in its traffic dynamics. Congestion seems to be an inevitable
result of user's behavior coupled to the network dynamics and it effects should
be minimized by choosing appropriate routing strategies. But what are the
requirements of routing depth in order to optimize the traffic flow? In this
paper we analyse the behavior of Internet traffic with a topologically
realistic spatial structure as described in a previous study (S-H. Yook et al.
,Proc. Natl Acad. Sci. USA, {\bf 99} (2002) 13382). The model involves
self-regulation of packet generation and different levels of routing depth. It
is shown that it reproduces the relevant key, statistical features of
Internet's traffic. Moreover, we also report the existence of a critical path
horizon defining a transition from low-efficient traffic to highly efficient
flow. This transition is actually a direct consequence of the web's small world
architecture exploited by the routing algorithm. Once routing tables reach the
network diameter, the traffic experiences a sudden transition from a
low-efficient to a highly-efficient behavior. It is conjectured that routing
policies might have spontaneously reached such a compromise in a distributed
manner. Internet would thus be operating close to such critical path horizon.Comment: 8 pages, 8 figures. To appear in European Journal of Physics B (2004
Communities in Networks
We survey some of the concepts, methods, and applications of community
detection, which has become an increasingly important area of network science.
To help ease newcomers into the field, we provide a guide to available
methodology and open problems, and discuss why scientists from diverse
backgrounds are interested in these problems. As a running theme, we emphasize
the connections of community detection to problems in statistical physics and
computational optimization.Comment: survey/review article on community structure in networks; published
version is available at
http://people.maths.ox.ac.uk/~porterm/papers/comnotices.pd
Motor proteins traffic regulation by supply-demand balance of resources
In cells and in vitro assays the number of motor proteins involved in
biological transport processes is far from being unlimited. The cytoskeletal
binding sites are in contact with the same finite reservoir of motors (either
the cytosol or the flow chamber) and hence compete for recruiting the available
motors, potentially depleting the reservoir and affecting cytoskeletal
transport. In this work we provide a theoretical framework to study,
analytically and numerically, how motor density profiles and crowding along
cytoskeletal filaments depend on the competition of motors for their binding
sites. We propose two models in which finite processive motor proteins actively
advance along cytoskeletal filaments and are continuously exchanged with the
motor pool. We first look at homogeneous reservoirs and then examine the
effects of free motor diffusion in the surrounding medium. We consider as a
reference situation recent in vitro experimental setups of kinesin-8 motors
binding and moving along microtubule filaments in a flow chamber. We
investigate how the crowding of linear motor proteins moving on a filament can
be regulated by the balance between supply (concentration of motor proteins in
the flow chamber) and demand (total number of polymerised tubulin
heterodimers). We present analytical results for the density profiles of bound
motors, the reservoir depletion, and propose novel phase diagrams that present
the formation of jams of motor proteins on the filament as a function of two
tuneable experimental parameters: the motor protein concentration and the
concentration of tubulins polymerized into cytoskeletal filaments. Extensive
numerical simulations corroborate the analytical results for parameters in the
experimental range and also address the effects of diffusion of motor proteins
in the reservoir.Comment: 31 pages, 10 figure
- …