Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Yi-Bingen_US
dc.date.accessioned2014-12-08T15:24:29Z-
dc.date.available2014-12-08T15:24:29Z-
dc.date.issued1995-09-01en_US
dc.identifier.issn1022-0038en_US
dc.identifier.urihttp://dx.doi.org/10.1007/BF01200853en_US
dc.identifier.urihttp://hdl.handle.net/11536/16992-
dc.description.abstractThis paper studies failure restoration of mobility databases for personal communication networks (specifically, VLRs and HLRs). We model the VLR restoration with and without checkpointing. The optimal VLR checkpointing interval is derived to balance the checkpointing cost against the paging cost. We also model GSM periodic location updating (location confirmation) to quantify the relationship between the location confirmation frequency and the number of lost calls. The HLR failure restoration procedures for IS-41 and GSM are described. We show the number of lost calls in a HLR failure. Both the procedures in IS-41 and GSM cannot identify the VLRs that need to be accessed by the HLR after a failure. An algorithm is proposed to identify the VLRs, which can be used to aggressively restore a HLR after its failure.en_US
dc.language.isoen_USen_US
dc.titleFailure restoration of mobility databases for personal communication networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/BF01200853en_US
dc.identifier.journalWIRELESS NETWORKSen_US
dc.citation.volume1en_US
dc.citation.issue3en_US
dc.citation.spage365en_US
dc.citation.epage372en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:000208154500011-
dc.citation.woscount15-
Appears in Collections:Articles