87,034 research outputs found
Evaluating Native Load Distribution of ARP- Path Bridging Protocol in Mesh and Data Center
RP-Path is a simple, low latency, shortest path bridging protocol for campus, enterprise and data center networks. We recently found that this protocol natively distributes the traffic load in networks having redundant paths of similar characteristics. The reason is that every new path between hosts is selected on-demand in a race among ARP Request packet replicas over all available paths: the first arriving replica gets its path selected on the fly. This means a continuous adaptation of new paths to variations on the load at links and bridges. To show this unique load distribution capability and path diversity property we use a number of simulations for complex scenarios, including two different simulators: one flow- based and one packet-based, and two basic topologies: data center and a regular mesh. We also verify this behavior on real hardware on a network of nine ARP-Path NetFPGA switches. The conclusion is that the ARP-Path protocol efficiently distributes traffic via alternative paths at all load levels, provided that multiple paths of similar propagation delays are availableComunidad de Madri
Datacenter Traffic Control: Understanding Techniques and Trade-offs
Datacenters provide cost-effective and flexible access to scalable compute
and storage resources necessary for today's cloud computing needs. A typical
datacenter is made up of thousands of servers connected with a large network
and usually managed by one operator. To provide quality access to the variety
of applications and services hosted on datacenters and maximize performance, it
deems necessary to use datacenter networks effectively and efficiently.
Datacenter traffic is often a mix of several classes with different priorities
and requirements. This includes user-generated interactive traffic, traffic
with deadlines, and long-running traffic. To this end, custom transport
protocols and traffic management techniques have been developed to improve
datacenter network performance.
In this tutorial paper, we review the general architecture of datacenter
networks, various topologies proposed for them, their traffic properties,
general traffic control challenges in datacenters and general traffic control
objectives. The purpose of this paper is to bring out the important
characteristics of traffic control in datacenters and not to survey all
existing solutions (as it is virtually impossible due to massive body of
existing research). We hope to provide readers with a wide range of options and
factors while considering a variety of traffic control mechanisms. We discuss
various characteristics of datacenter traffic control including management
schemes, transmission control, traffic shaping, prioritization, load balancing,
multipathing, and traffic scheduling. Next, we point to several open challenges
as well as new and interesting networking paradigms. At the end of this paper,
we briefly review inter-datacenter networks that connect geographically
dispersed datacenters which have been receiving increasing attention recently
and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial
Using data network metrics, graphics, and topology to explore network characteristics
Yehuda Vardi introduced the term network tomography and was the first to
propose and study how statistical inverse methods could be adapted to attack
important network problems (Vardi, 1996). More recently, in one of his final
papers, Vardi proposed notions of metrics on networks to define and measure
distances between a network's links, its paths, and also between different
networks (Vardi, 2004). In this paper, we apply Vardi's general approach for
network metrics to a real data network by using data obtained from special data
network tools and testing procedures presented here. We illustrate how the
metrics help explicate interesting features of the traffic characteristics on
the network. We also adapt the metrics in order to condition on traffic passing
through a portion of the network, such as a router or pair of routers, and show
further how this approach helps to discover and explain interesting network
characteristics.Comment: Published at http://dx.doi.org/10.1214/074921707000000058 in the IMS
Lecture Notes Monograph Series
(http://www.imstat.org/publications/lecnotes.htm) by the Institute of
Mathematical Statistics (http://www.imstat.org
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much
interest within the last four decades. In this paper, some of the existing
literature dealing with routing and scheduling problems with environmental
issues is reviewed, and a description is provided of the problems that have
been investigated and how they are treated using combinatorial optimization
tools
- …