Show simple item record

dc.contributor.authorWoodward, Mike E.
dc.contributor.authorGao, Feng
dc.date.accessioned2009-07-20T11:38:06Z
dc.date.available2009-07-20T11:38:06Z
dc.date.issued2007
dc.identifier.citationGao, F. and Woodward, M.E. (2007). A Hybrid Topological-Stochastic Partitioning Method for Scaling QoS Routing Algorithms. Computer Networks. Vol. 51., No. 6, pp. 1705-1724.en
dc.identifier.urihttp://hdl.handle.net/10454/3063
dc.descriptionNoen
dc.description.abstractThis paper presents a new partitioning strategy with the objective of increasing scalability by reducing computational effort of routing in networks. The original network is partitioned into blocks (subnetworks) so that there is a bi-directional link between any two blocks. When there is a connection request between a pair of nodes, if the nodes are in the same block, we only use the small single block to derive routings. Otherwise we combine the two blocks where the two nodes locate and in this way the whole network will never be used. The strategy is generic in that it can be used in any underlying routing algorithms in the network layer and can be applied to any networks with fixed topology such as fixed wired subnetworks of the Internet. The performance of this strategy has been investigated by building a simulator in Java and a comparison with existing stochastic partitioning techniques is shown to give superior performance in terms of trade-off in blocking probability (the probability of failure to find a path between source and destination satisfying QoS constraints) and reduction of computational effort.en
dc.language.isoenen
dc.relation.isreferencedbyhttp://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6VRG-4M3B6GG-5-16&_cdi=6234&_user=122861&_orig=search&_coverDate=04%2F25%2F2007&_sk=999489993&view=c&wchp=dGLbVlz-zSkzV&md5=e51a70eca11a21f1c483b34ec108f2f9&ie=/sdarticle.pdfen
dc.subjectTelecommunication networken
dc.subjectFailuresen
dc.subjectJAVA languageen
dc.subjectPerformance evaluationen
dc.subjectSimulatoren
dc.subjectInterneten
dc.subjectTopological structureen
dc.subjectNetwork architectureen
dc.subjectBidirectional linken
dc.subjectNetwork routingen
dc.subjectComputational complexityen
dc.subjectRouting algorithmen
dc.subjectStochastic methoden
dc.subjectPartition methoden
dc.titleA Hybrid Topological-Stochastic Partitioning Method for Scaling QoS Routing Algorithms.en
dc.status.refereedYesen
dc.typeArticleen
dc.type.versionNo full-text available in the repositoryen


This item appears in the following Collection(s)

Show simple item record