Lin, Yi-FangYi-FangLinKang, Zhe-HaoZhe-HaoKangPANGFENG LIUWu, Jan-JanJan-JanWu2020-05-042020-05-04200603029743https://scholars.lib.ntu.edu.tw/handle/123456789/489369https://www.scopus.com/inward/record.uri?eid=2-s2.0-33745814338&doi=10.1007%2f11745693_17&partnerID=40&md5=e3ba5bef27a4e047ed597b39d7101034This paper describes an agent-based approach for scheduling multiple multicast on switch-based networks with irregular topologies. Our approach assigns an agent to each subtree of switches such that the agents can exchange information efficiently and independently. The entire multicast problem is then recursively solved with each agent sending message to those switches that it is responsible for. In this way, communication is localized by the assignment of agents to subtrees. This idea can be easily generalized to multiple multicast since the order of message passing among agents can be interleaved for different multicasts. The key to the performance of this agent-based approach is the message-passing scheduling between agents and the destination processors. We propose an optimal scheduling algorithm, called ForwardlnSwitch to solve this problem. We conduct experiments to demonstrate the efficiency of our approach by comparing the results with SPCCO, a highly efficient multicast algorithm. We found that SPCCO suffers link contention when the number of simultaneous multiple multicast becomes large. On the other hand, our agent-based approach achieves better performance in large cases. © Springer-Verlag Berlin Heidelberg 2006.Algorithms; Intelligent agents; Multicasting; Problem solving; Scheduling; Telecommunication networks; Multicast algorithms; Multiple multicast; Optimal scheduling algorithms; Switch-based networks; Optimal control systemsconference paper10.1007/11745693_172-s2.0-33745814338https://doi.org/10.1007/11745693_17