Algorithms
A distributed algorithm for delay-constrained unicast routing
IEEE/ACM Transactions on Networking (TON)
Networks for computer scientists and engineers
Networks for computer scientists and engineers
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Electronic Commerce Research
Topology Discovery by Active Probing
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
DCMC - Delay-Constrained Multipoint Communication with Multiple Sources
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Web-based Distributed Topology Discovery of IP Networks
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
The Delay-Constrained Minimum Spanning Tree Problem
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Modeling and algorithm for topology construction with delay and traffic constraints
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Global access network evolution
IEEE/ACM Transactions on Networking (TON)
Leveraging saving-based algorithms by master-slave genetic algorithms
Engineering Applications of Artificial Intelligence
Optimal multicast loop algorithm for multimedia traffic distribution
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Multimedia traffic distribution using capacitated multicast tree
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Hi-index | 0.24 |
This study deals with the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem arising in topology discovery of local network. While the traditional Capacitated Minimum Spanning Tree (CMST) problem deals with only traffic capacity constraint of a port of a source node, and Delay-Constrained Minimum Spanning Tree (DCMST) considers only the maximum end-to-end delay constraint, the DC-CMST problem deals with mean network delay and traffic capacity constraints simultaneously. The DC-CMST problem consists of finding a set of minimum cost spanning trees to link end-nodes to a source node which satisfy the traffic requirements at end-nodes and the required mean delay of a network. We formulate the DC-CMST problem and present the Least-Cost DC-CMST Heuristic, which consists of node exchange algorithm, node shift algorithm, and mean delay link capacity algorithm to solve the DC-CMST problem. Results from performance analysis show that the proposed heuristic can produce, in a very short computation time, better results than the previous CMST algorithms modified to solve the DC-CMST problem. The proposed Least-Cost DC-CMST Heuristic can be applied to the topological design of large local networks and to the construction of least cost broadcast and multicast trees for efficient routing algorithms.