• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 11,865
Next 10 →

Table 2: Parameters of the new Optimized and Reliable Periodic Broadcast Protocols

in unknown title
by unknown authors 2001
"... In PAGE 5: ... RELIABLE PERIODIC BROADCAST In this section we develop optimized periodic broadcast protocols that (1) assume a maximum aggregate transmis- sion rate to any given client that is a tunable parameter, n, which may be less than (or greater than) twice the me- dia play rate, and (2) enable clients with heterogeneous loss probability to recover from packet loss. The notation used in developing the RPB protocols is given in Table2 . To deal with the fundamental challenges involved in designing such optimized protocols, we proceed in four stages.... ..."
Cited by 56

Table 1: Reliable transport protocols for WSNs. Transport

in END-TO-END RELIABILITY IN WIRELESS SENSOR NETWORKS: SURVEY AND RESEARCH CHALLENGES
by P. Pereira (ed, Paulo Rogério Pereira, António Grilo, Francisco Rocha, Mário Serafim Nunes, Augusto Casaca, Claude Chaudet, Peter Almström, Mikael Johansson
"... In PAGE 2: ... Reliable transport protocols can be further subdivided into upstream (mostly unicast/convergecast transmission to aggregator or sink nodes) and downstream (mostly multicast/broadcast of code or configuration updates from sink nodes to sensor nodes). Table1 presents a taxonomy of reliable transport protocols for WSNs. It is a well established fact that providing some reliability support at intermediate nodes (hop-by-hop in the extreme) is more energy-efficient than treating reliability end-to-end only.... ..."

Table 1: Time complexities of the three protocols (asynchronous rounds).

in From consensus to atomic broadcast: Time-free byzantine-resistant protocols without signatures
by Miguel Correia, Nuno Ferreira Neves, Paulo Veríssimo 2006
"... In PAGE 23: ... This optimization reduces the 3 rounds of the reliable broadcast protocol to 2 rounds. Table1 presents both the expected time complexity of the protocol (Lmvc) and the time complexity in the best case (lmvc). The best case for the multi-valued consensus protocol is when the binary consensus runs in lbc = 10 rounds instead of the expected Lbc = 20 rounds (see appendix).... ..."
Cited by 7

Table 1: The TM-interface to the application program

in The RelaX Architecture - Overview and Interfaces
by R. Krüger, M. Mock, R. Schumann
"... In PAGE 8: ...escribed above. Especially, the TM manages the redundant recovery graph. The TMs communicate via the Reliable Broadcast Protocol (RBP) as described above. The operations offered by the TM at the TM-Interface are summarized in Table1 . A resource manager (RM) provides synchronized and recoverable resources via a specific resource manager interface to the application.... ..."

Table 2: Broadcast protocols

in Development of an Autonomous Transport System using UML-RT
by Robert S, Alle Rechte Vorbehalten, Technischen Universität München, Ingolf Krüger, Ingolf Krüger, Wolfgang Prenninger, Wolfgang Prenninger, Robert Sandner 2001

Table 1. Format of the three messages used in the protocol.

in A Mesh-based Robust Topology Discovery Algorithm
by For Hybrid Wireless, Ranveer Chandra, Christof Fetzer, Karin Högstedt
"... In PAGE 7: ...ent sent as part of the reliable broadcast described in Section 4.2.3, and GathResp is the message used to propagate the topology information up to the coordinator during the second phase of the protocol. The fields of the three mes- sages are described in Table1 , the data structures maintained locally at each node are presented in Table 2. The details of how these data structures are used and updated will be described in Section 4.... ..."

Table 5.2 Summary of transport protocols

in work has not been submitted elsewhere for a degree.
by Railway Bridges, Dr. Kameswari, Chebrolu Dr, Bhaskaran Raman, Iitkanpur Iitkanpur 2007

Table 1 The Minimal Broadcast Causal Protocol (MBCP)

in The Immediate Dependency Relation: an Optimal Way to Ensure Causal Group Communication
by Saul Pomares Hernández, Jean Fanchon, Khalil Drira 2004
"... In PAGE 12: ...Table1 (lines 1.ii, 4.... ..."
Cited by 3

Table 2 Untraceable broadcast

in Unconditionally Untraceable and Fault-tolerant Broadcast and Secret Ballot Election
by Birgit Pfitzmann, Michael Waidner 1992
"... In PAGE 4: ... Table 1 summarizes general fault-tolerant multi-party protocols because they can be used to implement untraceable broadcast and secret ballot election. Table2 summarizes untraceable broadcast protocols, Table 3 secret ballot election protocols. The assumptions for untraceability and fault tolerance are independent.... ..."

TABLE I MESSAGE CONFLICT RELATION BETWEEN RELIABLY AND ATOMICALLY BROADCAST MESSAGES

in Towards JMS Compliant Group Communication
by Arnas Kupsys, Stefan Pleisch, André Schiper, Matthias Wiesmann 2004
Cited by 2
Next 10 →
Results 1 - 10 of 11,865
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University