1,205 research outputs found
Asynchronous spiking neurons, the natural key to exploit temporal sparsity
Inference of Deep Neural Networks for stream signal (Video/Audio) processing in edge devices is still challenging. Unlike the most state of the art inference engines which are efficient for static signals, our brain is optimized for real-time dynamic signal processing. We believe one important feature of the brain (asynchronous state-full processing) is the key to its excellence in this domain. In this work, we show how asynchronous processing with state-full neurons allows exploitation of the existing sparsity in natural signals. This paper explains three different types of sparsity and proposes an inference algorithm which exploits all types of sparsities in the execution of already trained networks. Our experiments in three different applications (Handwritten digit recognition, Autonomous Steering and Hand-Gesture recognition) show that this model of inference reduces the number of required operations for sparse input data by a factor of one to two orders of magnitudes. Additionally, due to fully asynchronous processing this type of inference can be run on fully distributed and scalable neuromorphic hardware platforms
Performance and configuration of link adaptation algorithms with mobile speed
Link Adaptation is an adaptive radio link technique that selects a transport mode, from a set of predefined modes of varying robustness, depending on the channel quality conditions and dynamics. Previous work has shown the need to adapt the configuration of the Link Adaptation algorithm to certain operating conditions such as the system load. Since the channel quality dynamics are also influenced by the user speed, this paper investigates the impact of the mobile speed on the performance and configuration of Link Adaptation algorithm
Methods of Congestion Control for Adaptive Continuous Media
Since the first exchange of data between machines in different locations in early 1960s,
computer networks have grown exponentially with millions of people now using the
Internet. With this, there has also been a rapid increase in different kinds of services offered
over the World Wide Web from simple e-mails to streaming video. It is generally accepted
that the commonly used protocol suite TCP/IP alone is not adequate for a number of
modern applications with high bandwidth and minimal delay requirements. Many
technologies are emerging such as IPv6, Diffserv, Intserv etc, which aim to replace the onesize-fits-all approach of the current lPv4. There is a consensus that the networks will have
to be capable of multi-service and will have to isolate different classes of traffic through
bandwidth partitioning such that, for example, low priority best-effort traffic does not cause
delay for high priority video traffic. However, this research identifies that even within a
class there may be delays or losses due to congestion and the problem will require different
solutions in different classes.
The focus of this research is on the requirements of the adaptive continuous media
class. These are traffic flows that require a good Quality of Service but are also able to
adapt to the network conditions by accepting some degradation in quality. It is potentially
the most flexible traffic class and therefore, one of the most useful types for an increasing
number of applications.
This thesis discusses the QoS requirements of adaptive continuous media and
identifies an ideal feedback based control system that would be suitable for this class. A
number of current methods of congestion control have been investigated and two methods
that have been shown to be successful with data traffic have been evaluated to ascertain if
they could be adapted for adaptive continuous media. A novel method of control based on
percentile monitoring of the queue occupancy is then proposed and developed. Simulation
results demonstrate that the percentile monitoring based method is more appropriate to this
type of flow. The problem of congestion control at aggregating nodes of the network
hierarchy, where thousands of adaptive flows may be aggregated to a single flow, is then
considered. A unique method of pricing mean and variance is developed such that each
individual flow is charged fairly for its contribution to the congestion
Final report on the evaluation of RRM/CRRM algorithms
Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin
MPLS Automatic Bandwidth Allocation via Adaptive Hysteresis
Cataloged from PDF version of article.MPLS automatic bandwidth allocation (or provisioning) refers to the process of dynamically updating the bandwidth allocation of a label switched path on the basis of actual aggregate traffic demand on this path. Since bandwidth updates require signaling, it is common to limit the rate of updates to reduce signaling costs. In this article, we propose a model-free asynchronous adaptive hysteresis algorithm for MPLS automatic bandwidth allocation under bandwidth update rate constraints. We validate the effectiveness of the proposed approach by comparing it against existing schemes in (i) voice and (ii) data traffic scenarios. The proposed method can also be used in more general GMPLS networks. (C) 2010 Elsevier B.V. All rights reserved
On-board closed-loop congestion control for satellite based packet switching networks
NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time
Dynamic threshold-based algorithms for communication networks
Ankara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 2009.Thesis (Master's) -- Bilkent University, 2009.Includes bibliographical references leaves 68-72.A need to use dynamic thresholds arises in various communication networking
scenarios under varying traffic conditions. In this thesis, we propose novel dynamic
threshold-based algorithms for two different networking problems, namely
the problem of burst assembly in Optical Burst Switching (OBS) networks and
of bandwidth reservation in connection-oriented networks. Regarding the first
problem, we present dynamic threshold-based burst assembly algorithms that attempt
to minimize the average burst assembly delay due to burstification process
while taking the burst rate constraints into consideration. Using synthetic and
real traffic traces, we show that the proposed algorithms perform significantly
better than the conventional timer-based schemes. In the second problem, we
propose a model-free adaptive hysteresis algorithm for dynamic bandwidth reservation
in a connection-oriented network subject to update frequency constraints.
The simulation results in various traffic scenarios show that the proposed technique
considerably outperforms the existing schemes without requiring any prior
traffic information.Toksöz, Mehmet AltanM.S
Soft handover issues in radio resource management for 3G WCDMA networks
PhDMobile terminals allow users to access services while on the move. This unique
feature has driven the rapid growth in the mobile network industry, changing it from a
new technology into a massive industry within less than two decades.
Handover is the essential functionality for dealing with the mobility of the mobile
users. Compared with the conventional hard handover employed in the GSM mobile
networks, the soft handover used in IS-95 and being proposed for 3G has better
performance on both link and system level.
Previous work on soft handover has led to several algorithms being proposed and
extensive research has been conducted on the performance analysis and parameters
optimisation of these algorithms. Most of the previous analysis focused on the uplink
direction. However, in future mobile networks, the downlink is more likely to be the
bottleneck of the system capacity because of the asymmetric nature of new services,
such as Internet traffic.
In this thesis, an in-depth study of the soft handover effects on the downlink
direction of WCDMA networks is carried out, leading to a new method of optimising
soft handover for maximising the downlink capacity and a new power control
approach
- …