在PCS网络中隐式注销

Yi-Bing Lin, A. Noerpel
{"title":"在PCS网络中隐式注销","authors":"Yi-Bing Lin, A. Noerpel","doi":"10.1109/ICC.1994.368998","DOIUrl":null,"url":null,"abstract":"Registration/deregistration is required in a PCS network when a portable moves between registration areas. Several schemes were proposed to deregister a portable after it moves out of a registration area. A simple scheme called implicit deregistration totally eliminates network traffic due to deregistration. However, this scheme may delete valid registration records. Thus, the size of a registration database must be sufficiently large to ensure low probability that a valid registration record is deleted. The paper describes an analytic model to determine the size k of the registration database for an RA in the implicit deregistration scheme. If the expected number of portables in an RA is N, then the study indicates that good performance can be achieved if k/spl sime/5N.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Implicit deregistration in a PCS network\",\"authors\":\"Yi-Bing Lin, A. Noerpel\",\"doi\":\"10.1109/ICC.1994.368998\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Registration/deregistration is required in a PCS network when a portable moves between registration areas. Several schemes were proposed to deregister a portable after it moves out of a registration area. A simple scheme called implicit deregistration totally eliminates network traffic due to deregistration. However, this scheme may delete valid registration records. Thus, the size of a registration database must be sufficiently large to ensure low probability that a valid registration record is deleted. The paper describes an analytic model to determine the size k of the registration database for an RA in the implicit deregistration scheme. If the expected number of portables in an RA is N, then the study indicates that good performance can be achieved if k/spl sime/5N.<<ETX>>\",\"PeriodicalId\":112111,\"journal\":{\"name\":\"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1994.368998\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1994.368998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

摘要

当便携式设备在注册区域之间移动时,需要在PCS网络中进行注册/取消注册。提出了几种方案,以便在便携式汽车搬出注册区域后注销其注册。一种称为隐式注销的简单方案完全消除了由于注销而产生的网络流量。但是,此方案可能会删除有效的注册记录。因此,注册数据库的大小必须足够大,以确保有效注册记录被删除的概率很低。本文给出了隐式消配方案中RA配准数据库大小k的解析模型。如果RA中期望的便携设备数量为N,则研究表明,如果k/spl /5N,则可以获得良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Implicit deregistration in a PCS network
Registration/deregistration is required in a PCS network when a portable moves between registration areas. Several schemes were proposed to deregister a portable after it moves out of a registration area. A simple scheme called implicit deregistration totally eliminates network traffic due to deregistration. However, this scheme may delete valid registration records. Thus, the size of a registration database must be sufficiently large to ensure low probability that a valid registration record is deleted. The paper describes an analytic model to determine the size k of the registration database for an RA in the implicit deregistration scheme. If the expected number of portables in an RA is N, then the study indicates that good performance can be achieved if k/spl sime/5N.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信