Conference Paper

A low latency, loss tolerant architecture and protocol for widearea group communication

Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD
DOI: 10.1109/ICDSN.2000.857557 Conference: Dependable Systems and Networks, 2000. DSN 2000. Proceedings International Conference on
Source: IEEE Xplore

ABSTRACT Group communication systems are proven tools upon which to build fault-tolerant systems. As the demands for fault-tolerance increase and more applications require reliable distributed computing over wide area networks, wide area group communication systems are becoming very useful. However, building a wide area group communication system is a challenge. This paper presents the design of the transport protocols of the spread wide area group communication system. We focus on two aspects of the system. First, the value of using overlay networks for application level group communication services. Second, the requirements and design of effective low latency link protocols used to construct wide area group communication. We support our claims with the results of live experiments conducted over the Internet

  • Source
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Dynamic systems become more and more widespread in many application fields. This observation highlights the trend that systems are no more considered as running in a static, predefined environment. Evolution has to be taken into account and fault tolerance does not make an exception. When the executive or environmental context has changed, hypothesis or fault model may become outdated or invalid. On-line adaptation of fault tolerance has to be tackled. This paper deals with the design of fault tolerance for its on-line adaptation. It describes a reflective architecture, suitable for modifying fault tolerance at runtime. Then it shows how fault tolerance may be componentized into small components to enable its runtime modification.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The ConcurTaskTrees (CTT) is one of the most widely used nota- tions for task modeling, specifically tailored for user interface model-based de- sign. The integration of CTT with a de facto standard modeling language was already identified as an import issue, but there is no consensus about the best approach to achieve this goal. The purpose of this paper is to examine the rela- tive strengths and weaknesses of control and data flow specification in UML 2.0 Activity Diagrams to represent CTT semantics. The analysis is conducted by the definition of pattern-based activities for the temporal operators in CTT. Here, we propose an extension to the UML 2.0 abstract syntax that fully sup- ports the concepts behind CTTs and provides an adapted graphical notation for an UML like representation.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 01/2006