Bum Hwan Park

Learn More
We propose an algorithm forfinding a multicast tree in packet-switched networks. The objective is to minimize total cost incurred at the multicast path. The routing model is based on the minimum cost Steiner tree problem The Steiner problem is extended, in our papes to incorpomte two additional requirements. First , the delay experienced along the path from(More)
  • 1