IEEE/ACM Transactions on Networking (TON)
Profiling and reducing processing overheads in TCP/IP
IEEE/ACM Transactions on Networking (TON)
Java Message Service
Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocls
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
Multicast transport protocols: a survey and taxonomy
IEEE Communications Magazine
End system optimizations for high-speed TCP
IEEE Communications Magazine
A comparison of sender-initiated and receiver-initiated reliable multicast protocols
IEEE Journal on Selected Areas in Communications
The many faces of the integration of instruments and the grid
International Journal of Web and Grid Services
Grid meets sensors, sensors meet grid
SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
Delay analysis of real-time data dissemination
Proceedings of the 11th communications and networking simulation symposium
Dr. multicast: Rx for data center communication scalability
Proceedings of the 5th European conference on Computer systems
Dynamic system reconfiguration via service composition for dependable computing
Proceedings of the 12th Monterey conference on Reliable systems on unreliable networked platforms
Optimizing information flow in the gossip objects platform
ACM SIGOPS Operating Systems Review
A hybrid multicast-unicast infrastructure for efficient publish-subscribe in enterprise networks
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
Tuning paxos for high-throughput with batching and pipelining
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Optimizing Paxos with batching and pipelining
Theoretical Computer Science
| Hi-index | 0.00 |
We consider applications that require high rate, reliable message dissemination in a many-to-many environment. Examples of such applications include stock market centers and synchronized server clusters. As network capacity increases, the achievable throughput of messaging applications becomes bounded by processing times rather than communication speed. To reduce processing times we suggest the use of message aggregation. We consider performing message aggregation at either the sender, a message-server, or a network switch. The performance of each of these methods in terms of throughput and delay is analytically evaluated and compared against that of a naive implementation that does not perform message aggregation. We show that in typical real-world messaging applications, performing message aggregation can increase throughput by order of magnitude.We base our results on experiments that have been conducted using various operating systems running on different hardware platforms. Our results indicate that the achievable throughput of messaging applications is determined by the number of packets-per-second, rather than bytes-per-second, a receiver or a transmitter should handle.