AI SearchAnalysis of supernode based peer-to-peer system for IP telephony over wireless ad hoc networks
Call Number: AIT Thesis no.ICT-09-03 Material type:
SeriesSeries: Asian Institute of Technology. Thesis ; no. ICT-09-03Publication details: Pathum Thani, Thailand : Asian Institute of Technology, 2009Description: 89 leaves : ill. + 1 online resourceSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 2009 Summary: This thesis work is in relation to the Supernode(SN)-based Peer-to-Peer (P2P) service control overlay for IP telephony service over wireless ad hoc networks. The first part of the work considers the problem of analyzing Session Set-up Delay (also known as post-dialling delay) and capacity of SN-based P2P overlay. Owing to the fact that IP telephony services are supposed to operate below a certain average post-dialling delay, analysis of lookup delay becomes important in the scenario of IP telephony. Capacity in terms of lookup processing is another performance parameter that determines the maximum number of users the system can support without a high call-drop rate. In this thesis work, we have followed a mathematical approach to derive closed-form expressions for the mean lookup delay and capacity of ring-topology and chord based service control overlay as a function of the number of SNs. The derivations are verified using equivalent simulations. Lower bounds on the number of underlay hops traveled by a lookup message in a wireless ad hoc network have also been proposed. The results show that, for a given lookup query load into the system, there exists a number of SNs where the overlay lookup delay is minimum. The results also show that capacity might not always increase arbitrarily with an increase in number of SNs. We find that overlay topological structure can have a very significant impact in the capacity scaling of such networks. The second part of the work defines a node connectivity index (CI) as a "one»valued" measure of quantifying connectivity of a node in a wireless ad hoc network. We use the proposed CI as a criteria of SN selection. We show by simulations that the SN selection based on proposed CI criteria result in more robust overlays against random link and node failure
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.ICT-09-03 (Browse shelf(Opens below)) | 1 | Available | 30050120702484 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.ICT-09-03 (Browse shelf(Opens below)) | 2 | Available | 30050120702476 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.ICT-09-03 (Browse shelf(Opens below)) | 1 | Available | 30050160097993 |
A thesis submitted in partial fulfillment of the requirements for thedegree of Master of Engineering inInformation and Communication Technologies, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 2009
This thesis work is in relation to the Supernode(SN)-based Peer-to-Peer (P2P) service control overlay for IP telephony service over wireless ad hoc networks. The first part of the work considers the problem of analyzing Session Set-up Delay (also known as post-dialling delay) and capacity of SN-based P2P overlay. Owing to the fact that IP telephony services are supposed to operate below a certain average post-dialling delay, analysis of lookup delay becomes important in the scenario of IP telephony. Capacity in terms of lookup processing is another performance parameter that determines the maximum number of users the system can support without a high call-drop rate. In this thesis work, we have followed a mathematical approach to derive closed-form expressions for the mean lookup delay and capacity of ring-topology and chord based service control overlay as a function of the number of SNs. The derivations are verified using equivalent simulations. Lower bounds on the number of underlay hops traveled by a lookup message in a wireless ad hoc network have also been proposed. The results show that, for a given lookup query load into the system, there exists a number of SNs where the overlay lookup delay is minimum. The results also show that capacity might not always increase arbitrarily with an increase in number of SNs. We find that overlay topological structure can have a very significant impact in the capacity scaling of such networks. The second part of the work defines a node connectivity index (CI) as a "one»valued" measure of quantifying connectivity of a node in a wireless ad hoc network. We use the proposed CI as a criteria of SN selection. We show by simulations that the SN selection based on proposed CI criteria result in more robust overlays against random link and node failure
There are no comments on this title.