Network Traffic Optimisation

This chapter discusses in details a traffic-constrained SOAP multicast routing protocol, called tc-SMP, which is an extension of the similarity-based SOAP multicast protocol (SMP) proposed in the previous chapter. Tc-SMP offers improvements over SMP in terms of network traffic size by using its own routing protocol instead of the shortest path algorithm that conventionally sends messages between nodes along shortest paths first. Tc-SMP looks at the network optimisation aspect of the SMP protocol and proposes alternative message delivery paths that minimise the number of bytes transmitted over the network. Two tc-SMP algorithms, greedy and incremental approaches, are proposed and compared for their efficiency and performance advantages over SMP. Simple heuristic methods are also proposed for incorporating with the two tc-SMP algorithms to improve results. Theoretical analysis is also presented to show the differences in total traffic and average response time between tc-SMP and SMP.