| J.-F. Hermant and G. LeLann, "A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks," Proc. IEEE Conf. Distributed Computing Systems, pp. 360-369, 1998. |
....Table 1. Performance comparison of Neko and Java sockets. performance Neko Java relative TCP RR 1 [1 s] 4743 8634 55 UDP RR 1 [1 s] 4799 9185 52 TCP STREAM 8K [kbyte s] 6688 8174 82 3. 2 Simulated Networks Currently, Neko can simulate simplified versions of Ethernet, FDDI and CSMA DCR [12] networks. Complex phenomena, like collision in Ethernet networks, are not modeled, as they do not influence the network behavior significantly at low loads. The models are motivated and described in detail in [13, 14] Other models can be plugged into Neko easily, due to the simplicity of the ....
....in [19, 20] which improve on the time and message complexity metrics by incorporating contention on the network and the hosts. Neko was also used in an extensive evaluation of five representative total order broadcast algorithms [19, 20] Robust replicated service. The FLP impossibility result [12] states that the problem of Consensus cannot be solved in asynchronous distributed systems if processes may crash. We ran experiments to determine the robustness of a replicated service, which can be affected by the FLP impossibility result [22] The experimental setup consisted of an actively ....
J.-F. Hermant and G. L. Lann, "A protocol and correctness proofs for real-time high-performance broadcast networks," in Proceedings of 18 on Distributed Computing Systems (ICDS-18), 1998, pp. 360-369.
....Neko; Section 2.4 mentions the issues to consider at the integration. 6 Even more strangely, UDP performance got worse from JDK 1.1.5 to JDK 1.2.2 05 and JDK 1.2.2 05 to JDK 1.3.0 beta according to our measurements. Currently, Neko can simulate simplified versions of Ethernet, FDDI and CSMA DCR [16] networks. Complex phenomena, like collision in Ethernet networks, are not modeled, as they do not influence the network behavior significantly at low loads. The models are motivated and described in detail in [22, 25] Other models can be plugged into Neko easily, due to the simplicity of the ....
J.-F. Hermant and G. Le Lann. A protocol and correctness proofs for real-time high-performance broadcast networks. In Proc. 18th Int'l Conf. on Distributed Computing Systems (ICDCS-18), pages 360--369, Amsterdam, The Netherlands, May 1998.
No context found.
J.-F. Hermant and G. LeLann, "A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks," Proc. IEEE Conf. Distributed Computing Systems, pp. 360-369, 1998.
No context found.
J.-F. Hermant and G. Le Lann, "A protocol and correctness proofs for real-time highperformance broadcast networks," in Proceedings of the 18th IEEE International Conference on Distributed Computing Systems, 1998, pp. 360--369.
No context found.
J.-F. Hermant and G. Le Lann, "A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks," Proceedings of the Eighteenth International Conference on Distributed Computing Systems, pages, pages 360-369, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC