10,664 research outputs found
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
We show that complex (scale-free) network topologies naturally emerge from
hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient
greedy forwarding in these networks. Greedy forwarding is topology-oblivious.
Nevertheless, greedy packets find their destinations with 100% probability
following almost optimal shortest paths. This remarkable efficiency sustains
even in highly dynamic networks. Our findings suggest that forwarding
information through complex networks, such as the Internet, is possible without
the overhead of existing routing protocols, and may also find practical
applications in overlay networks for tasks such as application-level routing,
information sharing, and data distribution
MIPv6 Experimental Evaluation using Overlay Networks
The commercial deployment of Mobile IPv6 has been hastened by the concepts of Integrated
Wireless Networks and Overlay Networks, which are present in the notion of the
forthcoming generation of wireless communications. Individual wireless access networks
show limitations that can be overcome through the integration of different technologies
into a single unified platform (i.e., 4G systems). This paper summarises practical experiments
performed to evaluate the impact of inter-networking (i.e. vertical handovers) on
the Network and Transport layers. Based on our observations, we propose and evaluate a
number of inter-technology handover optimisation techniques, e.g., Router Advertisements
frequency values, Binding Update simulcasting, Router Advertisement caching, and Soft
Handovers. The paper concludes with the description of a policy-based mobility support
middleware (PROTON) that hides 4G networking complexities from mobile users, provides
informed handover-related decisions, and enables the application of different vertical
handover methods and optimisations according to context.Publicad
Friends for Free: Self-Organizing Artificial Social Networks for Trust and Cooperation
By harvesting friendship networks from e-mail contacts or instant message
"buddy lists" Peer-to-Peer (P2P) applications can improve performance in low
trust environments such as the Internet. However, natural social networks are
not always suitable, reliable or available. We propose an algorithm (SLACER)
that allows peer nodes to create and manage their own friendship networks.
We evaluate performance using a canonical test application, requiring
cooperation between peers for socially optimal outcomes. The Artificial Social
Networks (ASN) produced are connected, cooperative and robust - possessing many
of the disable properties of human friendship networks such as trust between
friends (directly linked peers) and short paths linking everyone via a chain of
friends.
In addition to new application possibilities, SLACER could supply ASN to P2P
applications that currently depend on human social networks thus transforming
them into fully autonomous, self-managing systems
Mobile Oriented Future Internet (MOFI)
This Special Issue consists of seven papers that discuss how to enhance mobility management and its associated performance in the mobile-oriented future Internet (MOFI) environment. The first two papers deal with the architectural design and experimentation of mobility management schemes, in which new schemes are proposed and real-world testbed experimentations are performed. The subsequent three papers focus on the use of software-defined networks (SDN) for effective service provisioning in the MOFI environment, together with real-world practices and testbed experimentations. The remaining two papers discuss the network engineering issues in newly emerging mobile networks, such as flying ad-hoc networks (FANET) and connected vehicular networks
Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks
Soaring capacity and coverage demands dictate that future cellular networks
need to soon migrate towards ultra-dense networks. However, network
densification comes with a host of challenges that include compromised energy
efficiency, complex interference management, cumbersome mobility management,
burdensome signaling overheads and higher backhaul costs. Interestingly, most
of the problems, that beleaguer network densification, stem from legacy
networks' one common feature i.e., tight coupling between the control and data
planes regardless of their degree of heterogeneity and cell density.
Consequently, in wake of 5G, control and data planes separation architecture
(SARC) has recently been conceived as a promising paradigm that has potential
to address most of aforementioned challenges. In this article, we review
various proposals that have been presented in literature so far to enable SARC.
More specifically, we analyze how and to what degree various SARC proposals
address the four main challenges in network densification namely: energy
efficiency, system level capacity maximization, interference management and
mobility management. We then focus on two salient features of future cellular
networks that have not yet been adapted in legacy networks at wide scale and
thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and
device-to-device (D2D) communications. After providing necessary background on
CoMP and D2D, we analyze how SARC can particularly act as a major enabler for
CoMP and D2D in context of 5G. This article thus serves as both a tutorial as
well as an up to date survey on SARC, CoMP and D2D. Most importantly, the
article provides an extensive outlook of challenges and opportunities that lie
at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201
Epidemics on contact networks: a general stochastic approach
Dynamics on networks is considered from the perspective of Markov stochastic
processes. We partially describe the state of the system through network motifs
and infer any missing data using the available information. This versatile
approach is especially well adapted for modelling spreading processes and/or
population dynamics. In particular, the generality of our systematic framework
and the fact that its assumptions are explicitly stated suggests that it could
be used as a common ground for comparing existing epidemics models too complex
for direct comparison, such as agent-based computer simulations. We provide
many examples for the special cases of susceptible-infectious-susceptible (SIS)
and susceptible-infectious-removed (SIR) dynamics (e.g., epidemics propagation)
and we observe multiple situations where accurate results may be obtained at
low computational cost. Our perspective reveals a subtle balance between the
complex requirements of a realistic model and its basic assumptions.Comment: Main document: 16 pages, 7 figures. Electronic Supplementary Material
(included): 6 pages, 1 tabl
- …