000 04088nas|a2200457 a 4500
005 20260817162438.0
008 100309s2009 th uu|m rtt 0| a1eng d
035 _a.b1207410x
099 9 _aAIT Thesis no.ICT-09-03
100 1 _aGhimire, Jagadish
245 1 0 _aAnalysis of supernode based peer-to-peer system for IP telephony over wireless ad hoc networks
260 _aPathum Thani, Thailand :
_bAsian Institute of Technology,
_c2009
300 _a89 leaves :
_bill. +
_e1 online resource
490 1 _aThesis ;
_vno. ICT-09-03
500 _aA thesis submitted in partial fulfillment of the requirements for thedegree of Master of Engineering inInformation and Communication Technologies, School of Engineering and Technology
502 _aThesis (M.Eng.) - Asian Institute of Technology, 2009
520 _aThis 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
650 0 _aInternet telephony
650 0 _aPeer-to-peer architecture (Computer networks)
650 0 _aAd hoc networks (Computer networks)
700 0 _aTeerapat Sanguankotchakorn,
_eChairperson
700 1 _aErke, Tapio J.,
_eExamination Committee
700 1 _aRajatheva, R.M.A.P,
_eExamination Committee
700 1 _aCrespi, Noel,
_eExamination committee
700 1 _aMani, Mehdi,
_eExamination committee
710 2 _aAsian Institute of Technology Fellowship,
_eScholarship donor
810 2 _aAsian Institute of Technology.
_tThesis ;
_vno. ICT-09-03
856 _3Full-Text
_uhttp://203.159.5.9/ait-thesis/detail.php?q=B03143
907 _a.b1207410x
_bmnait
_cu
902 _a240329
998 _b0
_c100309
_dm
_ea
_fu
_g0
945 _lmnait
945 _lmnait
945 _lmnarc
942 _c20
942 _c40
909 _aBarcode : 30050120702484
_bCREATED : 2010-09-03
_cRECORD # : i12631012
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050120702476
_bCREATED : 2010-09-03
_cRECORD # : i12631024
_dLPATRON : 1022417
_eLCHKIN : 2011-05-20
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 2
_jTOT RENEW : 0
909 _aBarcode : 30050160097993
_bCREATED : 2016-04-29
_cRECORD # : i12965042
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c5048
_d5048