Design of network topology based on delay-cost sink tree Online publication date: Tue, 30-Jul-2013
by Mou Dasgupta; G.P. Biswas; Chandan Bhar
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 10, No. 2, 2013
Abstract: The design of network topology is a challenging task and in this paper, a delay-cost sink-tree-based approach has been presented for its efficient design. Four delay costs like network-load delay cost, link-bandwidth delay cost, link delay cost and processing delay cost have been identified and defined, and a multi-objective delay-cost model based on these four delays has been developed to represent the total data transmission delay of a given data network. Now based on the delay model, a sink-tree for each and every node of the network is developed, which are then analysed and integrated together to design the final topology such that the links, whose contributions are not significant, are not considered. A network reliability check-point is kept so that on removal of the link(s) from the existing network, the reliability is decreased minimally. Two numerical examples, one of which is an existing network connecting ten major cities of China, are given to elaborate the proposed technique of designing network topology.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook