The Experts below are selected from a list of 35124 Experts worldwide ranked by ideXlab platform
Geoffrey C Fox - One of the best experts on this subject based on the ideXlab platform.
-
fault tolerant Reliable Delivery of messages in distributed publish subscribe systems
International Conference on Autonomic Computing, 2007Co-Authors: Shrideep Pallickara, Hasan Bulut, Geoffrey C FoxAbstract:Reliable Delivery of messages is an important problem that needs to be addressed in distributed systems. In this paper we briefly describe our basic strategy to enable Reliable Delivery of messages in the presence of link and node failures. This is facilitated by a specialized repository node. We then present our strategy to make this scheme even more failure resilient, by incorporating support for repository redundancy. Each repository functions autonomously. The scheme enables updates to the redundancy scheme depending on the failure resiliency requirements. If there are N available repositories, Reliable Delivery guarantees will be met even if N-1 repositories fail.
-
ICAC - Fault-Tolerant Reliable Delivery of Messages in Distributed Publish/Subscribe Systems
Fourth International Conference on Autonomic Computing (ICAC'07), 2007Co-Authors: Shrideep Pallickara, Hasan Bulut, Geoffrey C FoxAbstract:Reliable Delivery of messages is an important problem that needs to be addressed in distributed systems. In this paper we briefly describe our basic strategy to enable Reliable Delivery of messages in the presence of link and node failures. This is facilitated by a specialized repository node. We then present our strategy to make this scheme even more failure resilient, by incorporating support for repository redundancy. Each repository functions autonomously. The scheme enables updates to the redundancy scheme depending on the failure resiliency requirements. If there are N available repositories, Reliable Delivery guarantees will be met even if N-1 repositories fail.
-
an analysis of Reliable Delivery specifications for web services
International Conference on Information Technology: Coding and Computing, 2005Co-Authors: Geoffrey C Fox, Sangmi Lee PallickaraAbstract:Reliable Delivery of messages is now a key component of the Web Services roadmap, with two promising, and competing, specifications in this area viz. WS-reliability (WSR) from OASIS and WS-Reliable messaging (WSRM) from IBM and Microsoft. In this paper we provide an analysis of these specifications. Our investigations have been aimed at identifying the similarities and divergence in philosophies of these specifications. We also include a gap analysis and recommendations regarding the gaps identified by the gap analysis.
-
ITCC (1) - An analysis of Reliable Delivery specifications for Web services
International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II, 2005Co-Authors: Geoffrey C Fox, Sangmi Lee PallickaraAbstract:Reliable Delivery of messages is now a key component of the Web Services roadmap, with two promising, and competing, specifications in this area viz. WS-reliability (WSR) from OASIS and WS-Reliable messaging (WSRM) from IBM and Microsoft. In this paper we provide an analysis of these specifications. Our investigations have been aimed at identifying the similarities and divergence in philosophies of these specifications. We also include a gap analysis and recommendations regarding the gaps identified by the gap analysis.
-
a scheme for Reliable Delivery of events in distributed middleware systems
International Conference on Autonomic Computing, 2004Co-Authors: Shrideep Pallickara, Geoffrey C FoxAbstract:Increasingly interactions that services and entities have with each other, and among themselves, are network bound. These interactions can be encapsulated in events. We describe a scheme for the Reliable Delivery of events in the presence of link and node failures.
Shrideep Pallickara - One of the best experts on this subject based on the ideXlab platform.
-
fault tolerant Reliable Delivery of messages in distributed publish subscribe systems
International Conference on Autonomic Computing, 2007Co-Authors: Shrideep Pallickara, Hasan Bulut, Geoffrey C FoxAbstract:Reliable Delivery of messages is an important problem that needs to be addressed in distributed systems. In this paper we briefly describe our basic strategy to enable Reliable Delivery of messages in the presence of link and node failures. This is facilitated by a specialized repository node. We then present our strategy to make this scheme even more failure resilient, by incorporating support for repository redundancy. Each repository functions autonomously. The scheme enables updates to the redundancy scheme depending on the failure resiliency requirements. If there are N available repositories, Reliable Delivery guarantees will be met even if N-1 repositories fail.
-
ICAC - Fault-Tolerant Reliable Delivery of Messages in Distributed Publish/Subscribe Systems
Fourth International Conference on Autonomic Computing (ICAC'07), 2007Co-Authors: Shrideep Pallickara, Hasan Bulut, Geoffrey C FoxAbstract:Reliable Delivery of messages is an important problem that needs to be addressed in distributed systems. In this paper we briefly describe our basic strategy to enable Reliable Delivery of messages in the presence of link and node failures. This is facilitated by a specialized repository node. We then present our strategy to make this scheme even more failure resilient, by incorporating support for repository redundancy. Each repository functions autonomously. The scheme enables updates to the redundancy scheme depending on the failure resiliency requirements. If there are N available repositories, Reliable Delivery guarantees will be met even if N-1 repositories fail.
-
a scheme for Reliable Delivery of events in distributed middleware systems
International Conference on Autonomic Computing, 2004Co-Authors: Shrideep Pallickara, Geoffrey C FoxAbstract:Increasingly interactions that services and entities have with each other, and among themselves, are network bound. These interactions can be encapsulated in events. We describe a scheme for the Reliable Delivery of events in the presence of link and node failures.
-
ICAC - A scheme for Reliable Delivery of events in distributed middleware systems
International Conference on Autonomic Computing 2004. Proceedings., 1Co-Authors: Shrideep Pallickara, Geoffrey C FoxAbstract:Increasingly interactions that services and entities have with each other, and among themselves, are network bound. These interactions can be encapsulated in events. We describe a scheme for the Reliable Delivery of events in the presence of link and node failures.
Cormac J Sreenan - One of the best experts on this subject based on the ideXlab platform.
-
fault tolerant relay deployment based on length constrained connectivity and rerouting centrality in wireless sensor networks
International Conference on Embedded Wireless Systems and Networks, 2012Co-Authors: Lanny Sitanayah, Kenneth N Brown, Cormac J SreenanAbstract:Wireless Sensor Networks (WSNs) are prone to failures. To be robust to failures, the network topology should provide alternative routes to the sinks so when failures occur the routing protocol can still offer Reliable Delivery. We define l-CRC, a new centrality index which measures a node's importance to connectivity and efficient Delivery in the network. We then use this centrality index to concentrate on the most important nodes, providing alternative paths around the nodes with high centrality. Varying l-CRC allows us to trade off cost for robustness. We introduce GRASP-ABP, a local search algorithm for initial robust topology design. We evaluate the algorithm empirically in terms of the number of additional nodes it suggests and its runtime. We then evaluate the robustness of the designs against node failures in simulation, and we demonstrate that the centrality-based GRASP-ABP's designs are able to offer Reliable Delivery, comparable to competitor algorithms, but with fewer additional relays and faster runtime.
-
EWSN - Fault-Tolerant relay deployment based on length-constrained connectivity and rerouting centrality in wireless sensor networks
Lecture Notes in Computer Science, 2012Co-Authors: Lanny Sitanayah, Kenneth N Brown, Cormac J SreenanAbstract:Wireless Sensor Networks (WSNs) are prone to failures. To be robust to failures, the network topology should provide alternative routes to the sinks so when failures occur the routing protocol can still offer Reliable Delivery. We define l-CRC, a new centrality index which measures a node's importance to connectivity and efficient Delivery in the network. We then use this centrality index to concentrate on the most important nodes, providing alternative paths around the nodes with high centrality. Varying l-CRC allows us to trade off cost for robustness. We introduce GRASP-ABP, a local search algorithm for initial robust topology design. We evaluate the algorithm empirically in terms of the number of additional nodes it suggests and its runtime. We then evaluate the robustness of the designs against node failures in simulation, and we demonstrate that the centrality-based GRASP-ABP's designs are able to offer Reliable Delivery, comparable to competitor algorithms, but with fewer additional relays and faster runtime.
Gheorghe Zaharia - One of the best experts on this subject based on the ideXlab platform.
-
Analysis of Coding Strategies Within File Delivery Protocol Framework for HbbTV Based Push-VoD Services Over DVB Networks
IEEE Access, 2019Co-Authors: Ferdaouss Mattoussi, Matthieu Crussière, Jean-francois Helard, Gheorghe ZahariaAbstract:Hybrid broadcast broadband TV is a technique providing Push-VoD services over an interactive hybrid TV. These services are broadcast using a file Delivery protocol (I-DP), which includes different coding strategies to ensure Reliable Delivery. This protocol is characterized by three levels of data representation giving rise to segmentation of packet losses, which may result in poor recovery capabilities. This paper provides a first thorough investigation of the coding FDP framework for Reliable Delivery of Push-VoD service over DVB networks. We propose Markov modeling for characterizing inter-layer loss propagation within FDP on a wide variety of burst erasure channels. Based on this analytical analysis and a simulation study, we determine the possible recovering areas and the accurate loss measurements within FDP. The latter is then used to effectively investigate and configure the different coding strategies provided within FDP. In addition, we present a suitable recovering strategy for FDP, which guarantees transmission robustness against the broadcast network impairments.
-
A Reliable Delivery of HbbTV based Push-VoD services over DVB networks using RS codes
2017Co-Authors: Ferdaouss Mattoussi, Jean-francois Helard, Gheorghe Zaharia, Matthieu CrussièreAbstract:Hybrid broadcast broadband TV (HbbTV) is a technique providing Push-VOD services over an interactive hybrid TV. These services are broadcast using File Delivery Protocol (FDP) characterized by three levels of data representation and give rise to three loss distributions that may result in poor Forward Error Correction (FEC) recovery capabilities. In this paper, we first analyze the behaviour of the FDP protocol system over a large variety of bursty erasure channels to characterize and to understand effectively the loss patterns seen within FDP protocol and at the AL-FEC input in order to be able to dimension the AL-FEC codes. Then, we propose and investigate a novel solution based on RS AL-FEC codes for the FDP protocol to increase the robustness of HbbTV based Push-VoD services Delivery over DVB networks. This paper represents a first reference work for a Reliable HbbTV based Push-VOD services Delivery over burst-loss channels. © 2017 IEEE.
-
BMSB - A Reliable Delivery of HbbTV based Push-VoD services over DVB networks using RS codes
2017 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), 2017Co-Authors: Ferdaouss Mattoussi, Matthieu Crussière, Jean-francois Heiard, Gheorghe ZahariaAbstract:Hybrid broadcast broadband TV (HbbTV) is a technique providing Push-VOD services over an interactive hybrid TV. These services are broadcast using File Delivery Protocol (FDP) characterized by three levels of data representation and give rise to three loss distributions that may result in poor Forward Error Correction (FEC) recovery capabilities. In this paper, we first analyze the behaviour of the FDP protocol system over a large variety of bursty erasure channels to characterize and to understand effectively the loss patterns seen within FDP protocol and at the AL-FEC input in order to be able to dimension the AL-FEC codes. Then, we propose and investigate a novel solution based on RS AL-FEC codes for the FDP protocol to increase the robustness of HbbTV based Push-VoD services Delivery over DVB networks. This paper represents a first reference work for a Reliable HbbTV based Push-VOD services Delivery over burst-loss channels.
Johnathan M Reason - One of the best experts on this subject based on the ideXlab platform.
-
delay cognizant Reliable Delivery for publish subscribe overlay networks
International Conference on Distributed Computing Systems, 2011Co-Authors: Shuo Guo, Kyriakos Karenos, Minkyong Kim, Hui Lei, Johnathan M ReasonAbstract:The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub)messaging paradigm, which provides loosely coupled many-to-many communication. Many QoS-aware systems use overlay networks as they allow flexible routing. To provide QoS-aware pub/sub messaging in overlay networks, the messaging system should be adaptive to the changes in network conditions (such as delay and failures). However, many pub/sub systems depend on a flexed routing topology and it is costly to rebuild this topology in case of failures. This study seeks to address this challenge with Delay-Cognizant Reliable Delivery (DCRD), a novel and delay-aware dynamic routing algorithm to provide Reliable message Delivery for pub/sub overlay networks. For Reliable message Delivery, DCRD no longer uses a flxed routing topology. Instead, it dynamically switches among different links to bypass link failures and increase the chance to meet QoS requirement. Each node tries different neighboring nodes in an order that is mathematically proven to minimize the expected delay of packet Delivery. With all possible neighboring nodes sorted this way, DCRD guarantees that packets are delivered as long as there exists a path between the publisher and subscriber and that the expected delay is minimized. DCRD is extensively evaluated in simulation with comparison to existing tree-based routing approaches as well as a multi path approach using different network topologies, delay constraints, and loss probabilities. Simulation results show that DCRD performs better than all the baselines, providing Reliable message Delivery and satisfying the delay requirement for more than 98% of messages when the link failure probability is 4% or less.
-
ICDCS - Delay-Cognizant Reliable Delivery for Publish/Subscribe Overlay Networks
2011 31st International Conference on Distributed Computing Systems, 2011Co-Authors: Shuo Guo, Kyriakos Karenos, Minkyong Kim, Hui Lei, Johnathan M ReasonAbstract:The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub)messaging paradigm, which provides loosely coupled many-to-many communication. Many QoS-aware systems use overlay networks as they allow flexible routing. To provide QoS-aware pub/sub messaging in overlay networks, the messaging system should be adaptive to the changes in network conditions (such as delay and failures). However, many pub/sub systems depend on a flexed routing topology and it is costly to rebuild this topology in case of failures. This study seeks to address this challenge with Delay-Cognizant Reliable Delivery (DCRD), a novel and delay-aware dynamic routing algorithm to provide Reliable message Delivery for pub/sub overlay networks. For Reliable message Delivery, DCRD no longer uses a flxed routing topology. Instead, it dynamically switches among different links to bypass link failures and increase the chance to meet QoS requirement. Each node tries different neighboring nodes in an order that is mathematically proven to minimize the expected delay of packet Delivery. With all possible neighboring nodes sorted this way, DCRD guarantees that packets are delivered as long as there exists a path between the publisher and subscriber and that the expected delay is minimized. DCRD is extensively evaluated in simulation with comparison to existing tree-based routing approaches as well as a multi path approach using different network topologies, delay constraints, and loss probabilities. Simulation results show that DCRD performs better than all the baselines, providing Reliable message Delivery and satisfying the delay requirement for more than 98% of messages when the link failure probability is 4% or less.
