20,412 research outputs found
Virtual-Mobile-Core Placement for Metro Network
Traditional highly-centralized mobile core networks (e.g., Evolved Packet
Core (EPC)) need to be constantly upgraded both in their network functions and
backhaul links, to meet increasing traffic demands. Network Function
Virtualization (NFV) is being investigated as a potential cost-effective
solution for this upgrade. A virtual mobile core (here, virtual EPC, vEPC)
provides deployment flexibility and scalability while reducing costs,
network-resource consumption and application delay. Moreover, a distributed
deployment of vEPC is essential for emerging paradigms like Multi-Access Edge
Computing (MEC). In this work, we show that significant reduction in
networkresource consumption can be achieved as a result of optimal placement of
vEPC functions in metro area. Further, we show that not all vEPC functions need
to be distributed. In our study, for the first time, we account for vEPC
interactions in both data and control planes (Non-Access Stratum (NAS)
signaling procedure Service Chains (SCs) with application latency requirements)
using a detailed mathematical model
Recommended from our members
Automatic synthesis of analog layout : a survey
A review of recent research in the automatic synthesis of physical geometry for analog integrated circuits is presented. On introduction, an explanation of the difficulties involved in analog layout as opposed to digital layout is covered. Review of the literature then follows. Emphasis is placed on the exposition of general methods for addressing problems specific to analog layout, with the details of specific systems only being given when they surve to illustrate these methods well. The conclusion discusses problems remaining and offers a prediction as to how technology will evolve to solve them. It is argued that although progress has been and will continue to be made in the automation of analog IC layout, due to fundamental differences in the nature of analog IC design as opposed to digital design, it should not be expected that the level of automation of the former will reach that of the latter any time soon
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
How do Wireless Chains Behave? The Impact of MAC Interactions
In a Multi-hop Wireless Networks (MHWN), packets are routed between source
and destination using a chain of intermediate nodes; chains are a fundamental
communication structure in MHWNs whose behavior must be understood to enable
building effective protocols. The behavior of chains is determined by a number
of complex and interdependent processes that arise as the sources of different
chain hops compete to transmit their packets on the shared medium. In this
paper, we show that MAC level interactions play the primary role in determining
the behavior of chains. We evaluate the types of chains that occur based on the
MAC interactions between different links using realistic propagation and packet
forwarding models. We discover that the presence of destructive interactions,
due to different forms of hidden terminals, does not impact the throughput of
an isolated chain significantly. However, due to the increased number of
retransmissions required, the amount of bandwidth consumed is significantly
higher in chains exhibiting destructive interactions, substantially influencing
the overall network performance. These results are validated by testbed
experiments. We finally study how different types of chains interfere with each
other and discover that well behaved chains in terms of self-interference are
more resilient to interference from other chains
GraphMaps: Browsing Large Graphs as Interactive Maps
Algorithms for laying out large graphs have seen significant progress in the
past decade. However, browsing large graphs remains a challenge. Rendering
thousands of graphical elements at once often results in a cluttered image, and
navigating these elements naively can cause disorientation. To address this
challenge we propose a method called GraphMaps, mimicking the browsing
experience of online geographic maps.
GraphMaps creates a sequence of layers, where each layer refines the previous
one. During graph browsing, GraphMaps chooses the layer corresponding to the
zoom level, and renders only those entities of the layer that intersect the
current viewport. The result is that, regardless of the graph size, the number
of entities rendered at each view does not exceed a predefined threshold, yet
all graph elements can be explored by the standard zoom and pan operations.
GraphMaps preprocesses a graph in such a way that during browsing, the
geometry of the entities is stable, and the viewer is responsive. Our case
studies indicate that GraphMaps is useful in gaining an overview of a large
graph, and also in exploring a graph on a finer level of detail.Comment: submitted to GD 201
Recommended from our members
BioScript: programming safe chemistry on laboratories-on-a-chip
This paper introduces BioScript, a domain-specific language (DSL) for programmable biochemistry which executes on emerging microfluidic platforms. The goal of this research is to provide a simple, intuitive, and type-safe DSL that is accessible to life science practitioners. The novel feature of the language is its syntax, which aims to optimize human readability; the technical contributions of the paper include the BioScript type system and relevant portions of its compiler. The type system ensures that certain types of errors, specific to biochemistry, do not occur, including the interaction of chemicals that may be unsafe. The compiler includes novel optimizations that place biochemical operations to execute concurrently on a spatial 2D array platform on the granularity of a control flow graph, as opposed to individual basic blocks. Results are obtained using both a cycle-accurate microfluidic simulator and a software interface to a real-world platform
- …