Abstract
Nowadays the streaming technology provides a flexible platform for serving multimedia distribution over Internet. However, the service scalability may be restricted because the server load and network bandwidth are not resolved yet. One possible way to reduce the server load as well as the bandwidth is to reduce the requirement of resources from the server directly. The benefit of the multicast technology is usually helpful to do so. However, traditional multicast does not accommodated to on-demand applications owing to the requests are time-variant. On-demand multicast routing scheme [1] [2] can eliminate this limitation. By appropriately equipping caches on routing nodes, time-variant streams can be branched to serve distinct users. Furthermore, Su and Wang gave an efficient greedy routing mechanism to implement the on-demand multicast routing scheme over complete graphs. It demonstrates an amazing enhancement. Extending on-demand multicast routing scheme to tree-based networks is the thesis purpose. The primary strategy is integrating caches belong to the same path and employing these caches sequentially from the root to the leaf. In addition, re-route and threshold functionalities are embedded to enhance utilization.