Logo des Repositoriums

Auflistung nach Autor:in "Messmer, Roman"

1 - 3 von 3
  • Zeitschriftenartikel
    A Parallel Fault-tolerant Routing Algorithm for Real-Time Media Transmission
    (FERS-Mitteilungen: Vol. 30, No. 1, 2012) Messmer, Roman; Keller, Jörg
    Roman Messmer, FernUniversit¨ at in Hagen, Faculty of Mathematics and Computer Science, 58084 Hagen, Germany J¨ org Keller, FernUniversit¨ at in Hagen, Faculty of Mathematics and Computer Science, 58084 Hagen, Germany
  • Zeitschriftenartikel
    Real-Time Fault-Tolerant Routing in High-Availability Multicast-Aware Video Networks
    (FERS-Mitteilungen: Vol. 29, No. 1, 2011) Messmer, Roman; Keller, Jörg
    Live-videostream networks based on multimedia switches are the most recent products used in television production and distribution facilities to transport the live signal from sources like cameras or microphones to dedicated sinks like video monitors, loudspeakers and transmission lines. To switch signals from a single source to several destinations multicasting or point-to-multipoint technology is considered. To compute multicast trees for multimedia communication, constrained shortest paths algorithms are needed. They are fundamental to important network functionality such as Quality of Service (QoS) routing or Multiprotocol label switching (MPLS) path selection and the problems they attempt to solve are known to be NP-complete. In previous work, we have introduced a heuristic called Multimedia Multicast algorithm (MulMic), which delivers nearly optimal multicast trees in a short time. Here, we propose the combination of MulMic and two models for fault-tolerant routing: disjoint paths and reservation of backup paths. Furthermore we introduce a realtime algorithm we call ZirkumFlex to handle one or even several simultaneous node or line failures in a multicast network by a local search to bypass the failed node or line. We also apply our algorithm to example graphs to demonstrate its feasibility.
  • Konferenzbeitrag
    Real-time fault-tolerant routing in high-availability multicast-aware video networks
    (Sicherheit 2010. Sicherheit, Schutz und Zuverlässigkeit, 2010) Messmer, Roman; Keller, Jörg
    Live-videostream networks based on multimedia switches are the most recent products used in television production and distribution facilities to transport the live signal from sources like cameras or microphones to dedicated sinks like video monitors, loudspeakers and transmission lines. To switch signals from a single source to several destinations multicasting or point-to-multipoint technology is considered. To compute multicast trees for multimedia communication, constrained shortest paths algorithms are needed. They are fundamental to important network functionality such as Quality of Service (QoS) routing or Multiprotocol label switching (MPLS) path selection and the problems they attempt to solve are known to be NP-complete. In previous work, we have introduced a heuristic called Multimedia Multicast algorithm (MulMic), which delivers nearly optimal multicast trees in a short time. Here, we propose the combination of MulMic and two models for fault-tolerant routing: disjoint paths and reservation of backup paths. Furthermore we introduce a realtime algorithm we call ZirkumFlex to handle one or even several simultaneous node or line failures in a multicast network by a local search to bypass the failed node or line. We also apply our algorithm to example graphs to demonstrate its feasibility.