4,372 research outputs found
Adaptive Routing Approaches for Networked Many-Core Systems
Through advances in technology, System-on-Chip design is moving towards integrating tens to hundreds of intellectual property blocks into a single chip. In such a many-core system, on-chip communication becomes a performance bottleneck for high performance designs. Network-on-Chip (NoC) has emerged as a viable solution for the communication challenges in highly complex chips. The NoC architecture paradigm, based on a modular packet-switched mechanism, can address many of the on-chip communication challenges such as wiring complexity, communication latency, and bandwidth. Furthermore, the combined benefits of 3D IC and NoC schemes provide the possibility of designing a high performance system in a limited chip area. The major advantages of 3D NoCs are the considerable reductions in average latency and power consumption.
There are several factors degrading the performance of NoCs. In this thesis, we investigate three main performance-limiting factors: network congestion, faults, and the lack of efficient multicast support. We address these issues by the means of routing algorithms.
Congestion of data packets may lead to increased network latency and power consumption. Thus, we propose three different approaches for alleviating such congestion in the network. The first approach is based on measuring the congestion information in different regions of the network, distributing the information over the network, and utilizing this information when making a routing decision. The second approach employs a learning method to dynamically find the less congested routes according to the underlying traffic. The third approach is based on a fuzzy-logic technique to perform better routing decisions when traffic information of different routes is available.
Faults affect performance significantly, as then packets should take longer paths in order to be routed around the faults, which in turn increases congestion around the faulty regions. We propose four methods to tolerate faults at the link and switch level by using only the shortest paths as long as such path exists. The unique characteristic among these methods is the toleration of faults while also maintaining the performance of NoCs. To the best of our knowledge, these algorithms are the first approaches to bypassing faults prior to reaching them while avoiding unnecessary misrouting of packets.
Current implementations of multicast communication result in a significant performance loss for unicast traffic. This is due to the fact that the routing rules of multicast packets limit the adaptivity of unicast packets. We present an approach in which both unicast and multicast packets can be efficiently routed within the network. While suggesting a more efficient multicast support, the proposed approach does not affect the performance of unicast routing at all. In addition, in order to reduce the overall path length of multicast packets, we present several partitioning methods along with their analytical models for latency measurement. This approach is discussed in the context of 3D mesh networks.Siirretty Doriast
Relieving the Wireless Infrastructure: When Opportunistic Networks Meet Guaranteed Delays
Major wireless operators are nowadays facing network capacity issues in
striving to meet the growing demands of mobile users. At the same time,
3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g.,
Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a
content dissemination framework that harnesses ad hoc communication
opportunities to minimize the load on the wireless infrastructure while
guaranteeing tight delivery delays. It achieves this through a control loop
that collects user-sent acknowledgements to determine if new copies need to be
reinjected into the network through the 3G interface. Push-and-Track includes
multiple strategies to determine how many copies of the content should be
injected, when, and to whom. The short delay-tolerance of common content, such
as news or road traffic updates, make them suitable for such a system. Based on
a realistic large-scale vehicular dataset from the city of Bologna composed of
more than 10,000 vehicles, we demonstrate that Push-and-Track consistently
meets its delivery objectives while reducing the use of the 3G network by over
90%.Comment: Accepted at IEEE WoWMoM 2011 conferenc
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
Previous hop routing: exploiting opportunism in VANETs
Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks
(VANETs) is a challenging task due to frequent topology changes. Sustaining
a transmission path between peers in such network environment is difficult. In
this thesis, Previous Hop Routing (PHR) is poposed; an opportunistic forwarding
protocol exploiting previous hop information and distance to destination to
make the forwarding decision on a packet-by-packet basis. It is intended for use in
highly dynamic network where the life time of a hop-by-hop path between source
and destination nodes is short. Exploiting the broadcast nature of wireless communication
avoids the need to copy packets, and enables redundant paths to be
formed. To save network resources, especially under high network loads, PHR
employs probabilistic forwarding. The forwarding probability is calculated based
on the perceived network load as measured by the arrival rate at the network
interface. We evaluate PHR in an urban VANET environment using NS2 (for
network traffic) and SUMO (for vehicular movement) simulators, with scenarios
configured to re
ect real-world conditions. The simulation scenarios are configured
to use two velocity profiles i.e. Low and high velocity. The results show that the
PHR networks able to achieve best performance as measured by Packet Delivery
Ratio (PDR) and Drop Burst Length (DBL) compared to conventional routing
protocols in high velocity scenarios
A trajectory-driven opportunistic routing protocol for VCPS
By exploring sensing, computing and communication capabilities on vehicles, Vehicular Cyber-Physical Systems (VCPS) are promising solutions to provide road safety and traffic efficiency in Intelligent Transportation Systems (ITS). Due to high mobility and sparse network density, VCPS could be severely affected by intermittent connectivity. In this paper, we propose a Trajectory-Driven Opportunistic Routing (TDOR) protocol, which is primarily applied for sparse networks, e.g., Delay/Disruption Tolerant Networks (DTNs). With geographic routing protocol designed in DTNs, existing works primarily consider the proximity to destination as a criterion for nexthop selections. Differently, by utilizing GPS information of onboard vehicle navigation system to help with data transmission, TDOR selects the relay node based on the proximity to trajectory. This aims to provide reliable and efficient message delivery, i.e., high delivery ratio and low transmission overhead. TDOR is more immune to disruptions, due to unfavorable mobility of intermediate nodes. Performance evaluation results show TDOR outperforms well known opportunistic geographic routing protocols, and achieves much lower routing overhead for comparable delivery ratio
- …