An inquiry into PBNM system performance required for massive scale telecommunication applications

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor Magrath, Shane en_AU
dc.date.accessioned 2007-03-14T01:53:00Z
dc.date.accessioned 2012-12-15T03:52:42Z
dc.date.available 2007-03-14T01:53:00Z
dc.date.available 2012-12-15T03:52:42Z
dc.date.issued 2006
dc.identifier.uri http://hdl.handle.net/2100/287
dc.identifier.uri http://hdl.handle.net/10453/20204
dc.description University of Technology, Sydney. Faculty of Engineering.
dc.description.abstract PBNM systems have been proposed as a feasible techology for managing massive scale applications including telecommunication service management. What is not known is how this class of system performs under carrier-scale traffic loads. This research investigates this open question and concludes, subject to the considerations herein, this technology can provide services to large scale applications. An in depth examination of several inferencing algorithms is made using experimental methods. The inferencing operation has been implicated as the major source of performance problems in rule based systems and we examine this. Moreover, these algorithms are of central importance to current and future context-aware, pervasive, mobile services. A novel algorithm, JukeBox, is proposed that is a correct, general and pure bindspace conjunctive match algorithm. It is compared to the current state of the art algorithm - Rete. We find that Rete is the superior algorithm when implemented using the hashed-equality variant. We also conclude that IO is an important cause of PBNM system performace limitations and is perhaps of more significance than the implicated inferencing operations. However, inferencing can be a bottleneck to performance and we document the factors associated with this. We describe a generally useful policy system benchmarking procedure that provides a visible, repeatable and measurable process for establishing a policy server's service rate characteristics. The service rate statistics, namely (mu) and (sigma), establish the limitations to policy system throughput. Combined with the offered traffic load to the server, using the statistic (lambda), we can provide a complete characterisation of system performance using the Pollaczek-Khinchine function. This characterisation allows us to make simple design and dimensioning heuristics that can be used to rate the policy system as a whole. en_AU
dc.format.extent 304723 bytes
dc.format.extent 2062396 bytes
dc.format.extent 2329398 bytes
dc.format.extent 1479740 bytes
dc.format.extent 1083533 bytes
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.language en en_AU
dc.language.iso en_AU
dc.rights Copyright Shane Magrath en_AU
dc.rights http://www.lib.uts.edu.au/disclaimer.html en_AU
dc.subject Telecommunication. en_AU
dc.subject Management. en_AU
dc.subject Based. en_AU
dc.subject Network. en_AU
dc.subject Performance. en_AU
dc.title An inquiry into PBNM system performance required for massive scale telecommunication applications en_AU
dc.type Thesis (PhD) en_AU


Files in this item

This item appears in the following Collection(s)

Show simple item record