New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing

2011 ◽  
Vol 7 (4) ◽  
pp. 32-51 ◽  
Author(s):  
Mohamed Aissa ◽  
Adel Ben Mnaouer ◽  
Rion Murray ◽  
Abdelfettah Belghith
Keyword(s):  
Multicast Routing ◽  
Delay Bound ◽  
Delay Jitter ◽  
Selection Strategies ◽  
Multicast Trees ◽  
Reduced Complexity ◽  
Distinguishing Features ◽  
New Strategies ◽  
Load Conditions

Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS (Extended Kruskal), for constructing multicast trees. The EKRUS’ distinguishing features consists of a better management of Kruskal’s priority queues, and in the provision of edge priority aggregation. Preliminary results show that the proposed EKRUS algorithm performs as well as the best-known algorithms (such as the DDMC, DMCTc algorithms) while exhibiting reduced complexity. The authors conducted an intensive analysis and evaluations of different strategies of assigning edges into the classes of the queue as well as edge selection. As a result, the EKRUS algorithm was further extended with different edge assignment and selection strategies. Through extensive simulations, the authors have evaluated various versions of the EKRUS and analyzed their performance under different load conditions.

New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing

2013 ◽  
pp. 274-293
Author(s):  
Mohamed Aissa ◽  
Adel Ben Mnaouer ◽  
Rion Murray ◽  
Abdelfettah Belghith
Keyword(s):  
Multicast Routing ◽  
Delay Bound ◽  
Delay Jitter ◽  
Selection Strategies ◽  
Multicast Trees ◽  
Reduced Complexity ◽  
Distinguishing Features ◽  
New Strategies ◽  
Load Conditions

Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS (Extended Kruskal), for constructing multicast trees. The EKRUS’ distinguishing features consists of a better management of Kruskal’s priority queues, and in the provision of edge priority aggregation. Preliminary results show that the proposed EKRUS algorithm performs as well as the best-known algorithms (such as the DDMC, DMCTc algorithms) while exhibiting reduced complexity. The authors conducted an intensive analysis and evaluations of different strategies of assigning edges into the classes of the queue as well as edge selection. As a result, the EKRUS algorithm was further extended with different edge assignment and selection strategies. Through extensive simulations, the authors have evaluated various versions of the EKRUS and analyzed their performance under different load conditions.

ANALISIS DE CALIDAD DE SERVICIO EN REDES IPv6

2016 ◽  
Vol 26 (1) ◽  
pp. 7
Author(s):  
Jose Carlos Tavara Carbajal
Keyword(s):  
Quality Of Service ◽  
Packet Loss ◽  
Traffic Control ◽  
Video Traffic ◽  
Control Software ◽  
Delay Jitter ◽  
End To End Delay ◽  
Analysis Of Results ◽  
Ipv6 Protocol

RESUMENEste documento tiene como objetivo analizar el comportamiento de la calidad del servicio del protocolo IPv6 sobre el tráfico de video, para esto se realizó sobre un entorno real y se llevó acabo el análisis de resultados a través de un software estadístico de control del tráfico.Palabras Clave.-  Calidad de Servicio, Ancho de Banda, Retardo, Fluctuación de Retardo, Pérdidas de Paquetes.ABSTRACTThis paper has aimed to analyze of the service quality of the IPv6 protocol on video traffic, this was about a real environment and was conducted analysis of results through statistical traffic control software. Key words- Quality of Service, Bandwidth, End to end delay, Jitter, Packet loss.

ANALISIS DE CALIDAD DE SERVICIO EN REDES IPv6

2016 ◽  
Vol 26 (1) ◽  
pp. 1
Author(s):  
Jose Carlos Tavara Carbajal
Keyword(s):  
Quality Of Service ◽  
Packet Loss ◽  
Traffic Control ◽  
Video Traffic ◽  
Control Software ◽  
Delay Jitter ◽  
End To End Delay ◽  
Analysis Of Results ◽  
Ipv6 Protocol

Este documento tiene como objetivo analizar el comportamiento de la calidad del servicio del protocolo IPv6 sobre el tráfico de video, para esto se realizó sobre un entorno real y se llevó acabo el análisis de resultados a través de un software estadístico de control del tráfico.Palabras Clave.-  Calidad de Servicio, Ancho de Banda, Retardo, Fluctuación de Retardo, Pérdidas de Paquetes.ABSTRACT  This paper has aimed to analyze of the service quality of the IPv6 protocol on video traffic, this was about a real environment and was conducted analysis of results through statistical traffic control software.  Key words.- Quality of Service, Bandwidth, End to end delay, Jitter, Packet loss.

ANALISIS DE CALIDAD DE SERVICIO EN REDES IPv6

2016 ◽  
Vol 26 (1) ◽  
pp. 7
Author(s):  
Jose Carlos Tavara Carbajal
Keyword(s):  
Quality Of Service ◽  
Packet Loss ◽  
Traffic Control ◽  
Video Traffic ◽  
Control Software ◽  
Delay Jitter ◽  
End To End Delay ◽  
Analysis Of Results ◽  
Ipv6 Protocol

RESUMENEste documento tiene como objetivo analizar el comportamiento de la calidad del servicio del protocolo IPv6 sobre el tráfico de video, para esto se realizó sobre un entorno real y se llevó acabo el análisis de resultados a través de un software estadístico de control del tráfico.Palabras Clave.-  Calidad de Servicio, Ancho de Banda, Retardo, Fluctuación de Retardo, Pérdidas de Paquetes.ABSTRACTThis paper has aimed to analyze of the service quality of the IPv6 protocol on video traffic, this was about a real environment and was conducted analysis of results through statistical traffic control software. Keywords- Quality of Service, Bandwidth, End to end delay, Jitter, Packet loss.

scholarly journals New Orthophoto Generation Strategies from UAV and Ground Remote Sensing Platforms for High-Throughput Phenotyping

2021 ◽  
Vol 13 (5) ◽  
pp. 860
Author(s):  
Yi-Chun Lin ◽  
Tian Zhou ◽  
Taojun Wang ◽  
Melba Crawford ◽  
Ayman Habib
Keyword(s):  
Remote Sensing ◽  
Control Strategies ◽  
Target Function ◽  
Canopy Cover ◽  
Surface Model ◽  
Flowering Date ◽  
Sensing Platforms ◽  
Geolocation Accuracy ◽  
New Strategies

Remote sensing platforms have become an effective data acquisition tool for digital agriculture. Imaging sensors onboard unmanned aerial vehicles (UAVs) and tractors are providing unprecedented high-geometric-resolution data for several crop phenotyping activities (e.g., canopy cover estimation, plant localization, and flowering date identification). Among potential products, orthophotos play an important role in agricultural management. Traditional orthophoto generation strategies suffer from several artifacts (e.g., double mapping, excessive pixilation, and seamline distortions). The above problems are more pronounced when dealing with mid- to late-season imagery, which is often used for establishing flowering date (e.g., tassel and panicle detection for maize and sorghum crops, respectively). In response to these challenges, this paper introduces new strategies for generating orthophotos that are conducive to the straightforward detection of tassels and panicles. The orthophoto generation strategies are valid for both frame and push-broom imaging systems. The target function of these strategies is striking a balance between the improved visual appearance of tassels/panicles and their geolocation accuracy. The new strategies are based on generating a smooth digital surface model (DSM) that maintains the geolocation quality along the plant rows while reducing double mapping and pixilation artifacts. Moreover, seamline control strategies are applied to avoid having seamline distortions at locations where the tassels and panicles are expected. The quality of generated orthophotos is evaluated through visual inspection as well as quantitative assessment of the degree of similarity between the generated orthophotos and original images. Several experimental results from both UAV and ground platforms show that the proposed strategies do improve the visual quality of derived orthophotos while maintaining the geolocation accuracy at tassel/panicle locations.

scholarly journals The Prisoners’ Dilemma in collaborative carriers’ request selection

2021 ◽  
Vol 29 (1) ◽  
pp. 73-87 ◽  
Author(s):  
Margaretha Gansterer ◽  
Richard F. Hartl
Keyword(s):  
Computational Study ◽  
Logistics Industry ◽  
Individual Outcomes ◽  
Selection Strategies ◽  
Prisoners Dilemma ◽  
Trading Mechanisms ◽  
And Behavior ◽  
The Impact ◽  
Idle Capacity

AbstractLogistics providers have to utilize available capacities efficiently in order to cope with increasing competition and desired quality of service. One possibility to reduce idle capacity is to build coalitions with other players on the market. While the willingness to enter such coalitions does exist in the logistics industry, the success of collaborations strongly depends on mutual trust and behavior of participants. Hence, a proper mechanism design, where carriers do not have incentives to deviate from jointly established rules, is needed. We propose to use a combinatorial auction system, for which several properties are already well researched but little is known about the auction’s first phase, where carriers have to decide on the set of requests offered to the auction. Profitable selection strategies, aiming at maximization of total collaboration gains, do exist. However, the impact on individual outcomes, if one or more players deviate from jointly agreed selection rules is yet to be researched. We analyze whether participants in an auction-based transport collaboration face a Prisoners’ Dilemma. While it is possible to construct such a setting, our computational study reveals that carriers do not profit from declining the cooperative strategy. This is an important and insightful finding, since it further strengthens the practical applicability of auction-based trading mechanisms in collaborative transportation.

An Energy Balanced Ad Hoc Multicast Routing Algorithm

2012 ◽  
Vol 466-467 ◽  
pp. 425-429
Author(s):  
Qi Zhang ◽  
Hai Jun Xiong
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Energy Model ◽  
Specific Data ◽  
Routing Technology ◽  
Multicast Routing Algorithm ◽  
Energy Network

Multicast routing technology of Ad hoc network is a method of transferring specific data to a group of clients selectively; therefore, quality of the services is the key to evaluate the method. After the analysis of energy model and other routing algorithms ,an energy model and a balanced energy network multicast routing algorithm EBAMRA have been proposed in this article,. Experiments had been done, the simulation results show that this algorithm is feasible and effective, which provides a new and effective way of Ad hoc multicast routing technology.

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

Cross layer scheme for quality of service aware multicast routing in mobile ad hoc networks

2016 ◽  
Vol 24 (1) ◽  
pp. 329-343 ◽  
Author(s):  
Alireza Shams Shafigh ◽  
Beatriz Lorenzo Veiga ◽  
Savo Glisic
Keyword(s):  
Quality Of Service ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Cross Layer ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Solving Multi-Objective Multicast Routing Problem Using a New Hybrid Approach

2018 ◽  
Vol 9 (4) ◽  
pp. 22-36
Author(s):  
Mohammed Mahseur ◽  
Abdelmadjid Boukra ◽  
Yassine Meraihi
Keyword(s):  
Multicast Routing ◽  
Hybrid Approach ◽  
Bat Algorithm ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Multi Objective ◽  
Strength Pareto Evolutionary Algorithm ◽  
Quality Of Service Parameters

Multicast routing is the problem of finding the spanning tree of a set of destinations whose roots are the source node and its leaves are the set of destination nodes by optimizing a set of quality of service parameters and satisfying a set of transmission constraints. This article proposes a new hybrid multicast algorithm called Hybrid Multi-objective Multicast Algorithm (HMMA) based on the Strength Pareto Evolutionary Algorithm (SPEA) to evaluate and classify the population in dominated solutions and non-dominated solutions. Dominated solutions are evolved by the Bat Algorithm, and non-dominated solutions are evolved by the Firefly Algorithm. Old and weak solutions are replaced by new random solutions by a process of mutation. The simulation results demonstrate that the proposed algorithm is able to find good Pareto optimal solutions compared to other algorithms.

Sign in / Sign up

Export Citation Format

Share Document