119,125 research outputs found
Dynamic Subcarrier Allocation for 100 Gbps, 40 km OFDMA-PONs with SLA and CoS
This paper was published in Journal of Lightwave Technology and is made available as an electronic reprint with the permission of OSA. The paper can be found at the following URL on the OSA website: http://www.opticsinfobase.org/jlt/issue.cfm?volume=31&issue=7 Systematic or multiple reproduction or distribution to multiple locations via electronic or other means is prohibited and is subject to penalties under lawThe quality of service of 100Gbps orthogonal frequency division multiple access passive optical networks (OFDMA-PONs) performing dynamic bandwidth allocation is evaluated. New medium access control protocols and frame formats have been developed, exhibiting hybrid OFDMA/time division multiple access scheduling, for capacity enhancement and granular bandwidth allocation. The sequential dynamic subcarrier allocation algorithms allow the network optical line terminal to grant the optical network units (ONUs) bandwidth using both status and non-status based algorithm. Simulations of a 100 Gbps network with 256 ONUs, 256 subcarriers and 40 km extended-reach demonstrate best network throughputs of 87.5 Gbps and 3 ms packet delays for high priority service classes, even at maximum ONU load. In addition, high service level agreement (SLA) ONUs exhibit 1.56 Gbps maximum capacity and 48.82 kbps granularity.Peer reviewedFinal Accepted Versio
Why (and How) Networks Should Run Themselves
The proliferation of networked devices, systems, and applications that we
depend on every day makes managing networks more important than ever. The
increasing security, availability, and performance demands of these
applications suggest that these increasingly difficult network management
problems be solved in real time, across a complex web of interacting protocols
and systems. Alas, just as the importance of network management has increased,
the network has grown so complex that it is seemingly unmanageable. In this new
era, network management requires a fundamentally new approach. Instead of
optimizations based on closed-form analysis of individual protocols, network
operators need data-driven, machine-learning-based models of end-to-end and
application performance based on high-level policy goals and a holistic view of
the underlying components. Instead of anomaly detection algorithms that operate
on offline analysis of network traces, operators need classification and
detection algorithms that can make real-time, closed-loop decisions. Networks
should learn to drive themselves. This paper explores this concept, discussing
how we might attain this ambitious goal by more closely coupling measurement
with real-time control and by relying on learning for inference and prediction
about a networked application or system, as opposed to closed-form analysis of
individual protocols
Exploiting the Synergy Between Gossiping and Structured Overlays
In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes
Formal analysis techniques for gossiping protocols
We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them
Extremal Properties of Three Dimensional Sensor Networks with Applications
In this paper, we analyze various critical transmitting/sensing ranges for
connectivity and coverage in three-dimensional sensor networks. As in other
large-scale complex systems, many global parameters of sensor networks undergo
phase transitions: For a given property of the network, there is a critical
threshold, corresponding to the minimum amount of the communication effort or
power expenditure by individual nodes, above (resp. below) which the property
exists with high (resp. a low) probability. For sensor networks, properties of
interest include simple and multiple degrees of connectivity/coverage. First,
we investigate the network topology according to the region of deployment, the
number of deployed sensors and their transmitting/sensing ranges. More
specifically, we consider the following problems: Assume that nodes, each
capable of sensing events within a radius of , are randomly and uniformly
distributed in a 3-dimensional region of volume , how large
must the sensing range be to ensure a given degree of coverage of the region to
monitor? For a given transmission range, what is the minimum (resp. maximum)
degree of the network? What is then the typical hop-diameter of the underlying
network? Next, we show how these results affect algorithmic aspects of the
network by designing specific distributed protocols for sensor networks
Context-based Normalization of Histological Stains using Deep Convolutional Features
While human observers are able to cope with variations in color and
appearance of histological stains, digital pathology algorithms commonly
require a well-normalized setting to achieve peak performance, especially when
a limited amount of labeled data is available. This work provides a fully
automated, end-to-end learning-based setup for normalizing histological stains,
which considers the texture context of the tissue. We introduce Feature Aware
Normalization, which extends the framework of batch normalization in
combination with gating elements from Long Short-Term Memory units for
normalization among different spatial regions of interest. By incorporating a
pretrained deep neural network as a feature extractor steering a pixelwise
processing pipeline, we achieve excellent normalization results and ensure a
consistent representation of color and texture. The evaluation comprises a
comparison of color histogram deviations, structural similarity and measures
the color volume obtained by the different methods.Comment: In: 3rd Workshop on Deep Learning in Medical Image Analysis (DLMIA
2017
MODLEACH: A Variant of LEACH for WSNs
Wireless sensor networks are appearing as an emerging need for mankind.
Though, Such networks are still in research phase however, they have high
potential to be applied in almost every field of life. Lots of research is done
and a lot more is awaiting to be standardized. In this work, cluster based
routing in wireless sensor networks is studied precisely. Further, we modify
one of the most prominent wireless sensor network's routing protocol "LEACH" as
modified LEACH (MODLEACH) by introducing \emph{efficient cluster head
replacement scheme} and \emph{dual transmitting power levels}. Our modified
LEACH, in comparison with LEACH out performs it using metrics of cluster head
formation, through put and network life. Afterwards, hard and soft thresholds
are implemented on modified LEACH (MODLEACH) that boast the performance even
more. Finally a brief performance analysis of LEACH, Modified LEACH (MODLEACH),
MODLEACH with hard threshold (MODLEACHHT) and MODLEACH with soft threshold
(MODLEACHST) is undertaken considering metrics of throughput, network life and
cluster head replacements.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
- ā¦