7,946 research outputs found
Survey of Inter-satellite Communication for Small Satellite Systems: Physical Layer to Network Layer View
Small satellite systems enable whole new class of missions for navigation,
communications, remote sensing and scientific research for both civilian and
military purposes. As individual spacecraft are limited by the size, mass and
power constraints, mass-produced small satellites in large constellations or
clusters could be useful in many science missions such as gravity mapping,
tracking of forest fires, finding water resources, etc. Constellation of
satellites provide improved spatial and temporal resolution of the target.
Small satellite constellations contribute innovative applications by replacing
a single asset with several very capable spacecraft which opens the door to new
applications. With increasing levels of autonomy, there will be a need for
remote communication networks to enable communication between spacecraft. These
space based networks will need to configure and maintain dynamic routes, manage
intermediate nodes, and reconfigure themselves to achieve mission objectives.
Hence, inter-satellite communication is a key aspect when satellites fly in
formation. In this paper, we present the various researches being conducted in
the small satellite community for implementing inter-satellite communications
based on the Open System Interconnection (OSI) model. This paper also reviews
the various design parameters applicable to the first three layers of the OSI
model, i.e., physical, data link and network layer. Based on the survey, we
also present a comprehensive list of design parameters useful for achieving
inter-satellite communications for multiple small satellite missions. Specific
topics include proposed solutions for some of the challenges faced by small
satellite systems, enabling operations using a network of small satellites, and
some examples of small satellite missions involving formation flying aspects.Comment: 51 pages, 21 Figures, 11 Tables, accepted in IEEE Communications
Surveys and Tutorial
Information Centric Networking in the IoT: Experiments with NDN in the Wild
This paper explores the feasibility, advantages, and challenges of an
ICN-based approach in the Internet of Things. We report on the first NDN
experiments in a life-size IoT deployment, spread over tens of rooms on several
floors of a building. Based on the insights gained with these experiments, the
paper analyses the shortcomings of CCN applied to IoT. Several interoperable
CCN enhancements are then proposed and evaluated. We significantly decreased
control traffic (i.e., interest messages) and leverage data path and caching to
match IoT requirements in terms of energy and bandwidth constraints. Our
optimizations increase content availability in case of IoT nodes with
intermittent activity. This paper also provides the first experimental
comparison of CCN with the common IoT standards 6LoWPAN/RPL/UDP.Comment: 10 pages, 10 figures and tables, ACM ICN-2014 conferenc
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
Dataplane Specialization for High-performance OpenFlow Software Switching
OpenFlow is an amazingly expressive dataplane program-
ming language, but this expressiveness comes at a severe
performance price as switches must do excessive packet clas-
sification in the fast path. The prevalent OpenFlow software
switch architecture is therefore built on flow caching, but
this imposes intricate limitations on the workloads that can
be supported efficiently and may even open the door to mali-
cious cache overflow attacks. In this paper we argue that in-
stead of enforcing the same universal flow cache semantics
to all OpenFlow applications and optimize for the common
case, a switch should rather automatically specialize its dat-
aplane piecemeal with respect to the configured workload.
We introduce ES WITCH , a novel switch architecture that
uses on-the-fly template-based code generation to compile
any OpenFlow pipeline into efficient machine code, which
can then be readily used as fast path. We present a proof-
of-concept prototype and we demonstrate on illustrative use
cases that ES WITCH yields a simpler architecture, superior
packet processing speed, improved latency and CPU scala-
bility, and predictable performance. Our prototype can eas-
ily scale beyond 100 Gbps on a single Intel blade even with
complex OpenFlow pipelines
Optimizing IGP Link Costs for Improving IP-level Resilience
Recently, major vendors have introduced new router
platforms to the market that support fast IP-level failure pro-
tection out of the box. The implementations are based on the
IP Fast ReRoute–Loop Free Alternates (LFA) standard. LFA
is simple, unobtrusive, and easily deployable. This simplicity,
however, comes at a severe price, in that LFA usually cannot
protect all possible failure scenarios. In this paper, we give new
graph theoretical tools for analyzing LFA failure case coverage
and we seek ways for improvement. In particular, we investigate
how to optimize IGP link costs to maximize the number of
protected failure scenarios, we show that this problem is NP-
complete even in a very restricted formulation, and we give exact
and approximate algorithms to solve it. Our simulation studies
show that a deliberate selection of IGP costs can bring many
networks close to complete LFA-based protection
A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks
This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST),
Pakistan, and the Higher Education Commission, Pakistan
- …