|Title:||Performance models and optimization for active network filtering applications|
|Subject:||Hong Kong Polytechnic University -- Dissertations|
Department of Computing
|Pages:||vi, 74, 13 leaves : ill. ; 30 cm|
|Abstract:||It is expected that future e-commerce applications will require more advanced network services. To support these new requirements, an active networking paradigm is emerging. More specifically, some network components will change from a passive store-and-forward entity to an active store-computation-forward entity. Active network filtering is a good application scenario. In our research, we formulated a framework to analyze the performance of an active network filtering application. The main concern was that the network needed to be able to decide whether a request should be forwarded to the active network filtering component or the application server directly. This is referred to as the routing decision. Two sets of performance models were formulated: M/M/1 and Markov Chain. The M/M/1 model provides a static routing scheme and the discrete time Markov Chain model incorporates a time-varying function for determining the routing decision. For both models, the expected system latency can be computed. A dynamic routing scheme, aiming at minimizing the expected system latency, is proposed. It makes forwarding decisions based on the loading conditions of the active network filter as well as the server. The dynamic and static routing schemes were compared and simulation programs using the Petri Net Model were developed for validation and further performance analysis.|
Files in This Item:
|b17121796.pdf||For All Users (off-campus access for PolyU Staff & Students only)||2.89 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: