Show simple item record

dc.contributor.advisorBaras, John S.en_US
dc.contributor.authorLiu, Mingyan D.en_US
dc.contributor.authorBaras, John S.en_US
dc.date.accessioned2007-05-23T10:09:48Z
dc.date.available2007-05-23T10:09:48Z
dc.date.issued2000en_US
dc.identifier.urihttp://hdl.handle.net/1903/6154
dc.description.abstractIn this paper we present a hierarchical loss network model for estimatingthe end-to-end blocking probabilities for large networks. <p>As networks grow in size, nodes tendto form clusters geographically and hierarchical routing schemes are morecommonly used. Loss network and reduced load models are often used toapproximate end-to-endcall blocking probabilities, and hence, throughput. However so far all workbeing done in this area is for flat networks with flat routing schemes.<p>We aim at developing a more efficient approximation method for networksthat have a natural hierarchy and/or when some form of hierarchical routingpolicy is used. We present two hierarchical models in detail for fixedhierarchical routing and dynamic hierarchical routing policies,respectively, via the notion of network abstraction, route segmentation, traffic segregationand aggregation. Computation is done separately within each cluster (local)and among clusters (global), and the fixed point is obtained by iterationbetween local and global computations. We also present numerical resultsfor the first case.en_US
dc.format.extent260155 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2000-2en_US
dc.relation.ispartofseriesCSHCN; TR 2000-1en_US
dc.subjecthierarchical networken_US
dc.subjecthierarchical routingen_US
dc.subjectfixed point approximationen_US
dc.subjectblocking probabilityen_US
dc.titleHierarchical Loss Network Model for Performance Evaluationen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record