421 research outputs found
NeuRoute: Predictive Dynamic Routing for Software-Defined Networks
This paper introduces NeuRoute, a dynamic routing framework for Software
Defined Networks (SDN) entirely based on machine learning, specifically, Neural
Networks. Current SDN/OpenFlow controllers use a default routing based on
Dijkstra algorithm for shortest paths, and provide APIs to develop custom
routing applications. NeuRoute is a controller-agnostic dynamic routing
framework that (i) predicts traffic matrix in real time, (ii) uses a neural
network to learn traffic characteristics and (iii) generates forwarding rules
accordingly to optimize the network throughput. NeuRoute achieves the same
results as the most efficient dynamic routing heuristic but in much less
execution time.Comment: Accepted for CNSM 201
WiLiTV: A Low-Cost Wireless Framework for Live TV Services
With the evolution of HDTV and Ultra HDTV, the bandwidth requirement for
IP-based TV content is rapidly increasing. Consumers demand uninterrupted
service with a high Quality of Experience (QoE). Service providers are
constantly trying to differentiate themselves by innovating new ways of
distributing content more efficiently with lower cost and higher penetration.
In this work, we propose a cost-efficient wireless framework (WiLiTV) for
delivering live TV services, consisting of a mix of wireless access
technologies (e.g. Satellite, WiFi and LTE overlay links). In the proposed
architecture, live TV content is injected into the network at a few residential
locations using satellite dishes. The content is then further distributed to
other homes using a house-to-house WiFi network or via an overlay LTE network.
Our problem is to construct an optimal TV distribution network with the minimum
number of satellite injection points, while preserving the highest QoE, for
different neighborhood densities. We evaluate the framework using realistic
time-varying demand patterns and a diverse set of home location data. Our study
demonstrates that the architecture requires 75 - 90% fewer satellite injection
points, compared to traditional architectures. Furthermore, we show that most
cost savings can be obtained using simple and practical relay routing
solutions
Load sharing in a computer-communication network
Bibliography: p.124-126.Prepared under Advanced Research Projects Agency Contract ONR/N00014-75-C-1183. Originally presented as the author's thesis, (M.S.) in the M.I.T. Dept. of Electrical Engineering and Computer Science, 1975.by Eberhard Frank Wunderlich
Dynamic algorithms for multicast with intra-session network coding
The problem of multiple multicast sessions with
intra-session network coding in time-varying networks is considered.
The network-layer capacity region of input rates that can be
stably supported is established. Dynamic algorithms for multicast
routing, network coding, power allocation, session scheduling, and
rate allocation across correlated sources, which achieve stability
for rates within the capacity region, are presented. This work
builds on the back-pressure approach introduced by Tassiulas
et al., extending it to network coding and correlated sources. In
the proposed algorithms, decisions on routing, network coding,
and scheduling between different sessions at a node are made
locally at each node based on virtual queues for different sinks.
For correlated sources, the sinks locally determine and control
transmission rates across the sources. The proposed approach
yields a completely distributed algorithm for wired networks.
In the wireless case, power control among different transmitters
is centralized while routing, network coding, and scheduling
between different sessions at a given node are distributed
Performance Improvement of Multicommodity Flow of Tactile and Best Effort Packet in Internet Network
- …