Early evaluation of direct large-scale InfiniBand networks with adaptive routing

In contrast with current operational products of burned area, which are generally available one month after the fire, active fires are readily available, with potential application for early evaluation of approximate fire perimeters to support fire management decision making in near real time. While previous coarse-scale studies have focused on relating the number of active fires to a burned area, some local-scale studies have proposed the spatial aggregation of active fires to directly obtain early estimate perimeters from active fires. Nevertheless, further analysis of this latter technique, including the definition of aggregation distance and large-scale testing, is still required. There is a need for studies that evaluate the potential of active fire aggregation for rapid initial fire perimeter delineation, particularly taking advantage of the improved spatial resolution of the Visible Infrared Imaging Radiometer (VIIRS) 375 m, over large areas and long periods of study. The current study tested the use of convex hull algorithms for deriving coarse-scale perimeters from Moderate Resolution Imaging Spectroradiometer (MODIS) and Visible Infrared Imaging Radiometer Suite (VIIRS) active fire detections, compared against the mapped perimeter of the MODIS collection 6 (MCD64A1) burned area. We analyzed the effect of aggregation distance (750, 1000, 1125 and 1500 m) on the relationships of active fire perimeters with MCD64A1, for both individual fire perimeter prediction and total burned area estimation, for the period 2012–2108 in Mexico. The aggregation of active fire detections from MODIS and VIIRS demonstrated a potential to offer coarse-scale early estimates of the perimeters of large fires, which can be available to support fire monitoring and management in near real time. Total burned area predicted from aggregated active fires followed the same temporal behavior as the standard MCD64A1 burned area, with potential to also account for the role of smaller fires detected by the thermal anomalies. The proposed methodology, based on easily available algorithms of point aggregation, is susceptible to be utilized both for near real-time and historical fire perimeter evaluation elsewhere. Future studies might test active fires aggregation between regions or biomes with contrasting fuel characteristics and human activity patterns against medium resolution (e.g., Landsat and Sentinel) fire perimeters. Furthermore, coarse-scale active fire perimeters might be utilized to locate areas where such higher-resolution imagery can be downloaded to improve the evaluation of fire extent and impact.

Download Full-text

Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks

International Journal of Grid and High Performance Computing ◽

10.4018/jghpc.2010040105 ◽

2010 ◽

Vol 2 (2) ◽

pp. 53-63 ◽

Cited By ~ 1

Author(s):

Amitabha Chakrabarty ◽

Martin Collier ◽

Sourav Mukhopadhyay

Keyword(s):

Large Scale ◽

Blocking Probability ◽

Routing Algorithm ◽

Adaptive Routing ◽

Low Complexity ◽

Deterministic Algorithms ◽

Routing Strategy ◽

The Status ◽

Extensive Computation ◽

Symmetric Networks

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 × 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors’ algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This method provides a low complexity solution, but with much better blocking performance than random routing algorithms. This paper presents simulation results for various input loads, demonstrating the tradeoffs involved.

Download Full-text

An Experimental Analysis of Modified EEECARP

Advances in Library and Information Science - Novel Theories and Applications of Global Information Resource Management ◽

10.4018/978-1-7998-1786-4.ch012 ◽

2020 ◽

pp. 318-336

Author(s):

Venkata Ramana Sarella ◽

Deshai Nakka ◽

Sekhar B. V. D. S. ◽

Krishna Rao Sala ◽

Sameer Chakravarthy V. V. S. S.

Keyword(s):

Large Scale ◽

Cluster Formation ◽

Adaptive Routing ◽

Dynamic Routing ◽

Energy Utilization ◽

Relay Nodes ◽

Hop Count ◽

Iot Applications ◽

Event Clustering ◽

Event Based

Designing various energy-saving routing protocols for real-time internet of things (IoT) applications in modern secure wireless sensor networks (MS-WSN) is a tough task. Many hierarchical protocols for WSNs were not well scalable to large-scale IoT applications. Low energy adaptive two-level-CH clustering hierarchy (LEATCH) is an optimized technique reduces the energy-utilization of few cluster heads, but the LEATCH is not suitable for scalable and dynamic routing. For dynamic routing in MS-WSN, energy efficiency and event clustering adaptive routing protocol (EEECARP) with event-based dynamic clustering and relay communication by selecting intermediates nodes as relay-nodes is necessary. However, EEECARP cannot consider the hop-count, different magnitude ecological conditions, and energy wastage in cluster formation while collisions occur. So, the authors propose the modified EEECARP to address these issues for better dynamic event clustering adaptive routing to improve the lifetime of MS-WSNs. The experimental outcomes show that proposed protocol achieves better results than EEECARP and LEATCH.

Download Full-text