N-class replacement policy for resolving mobility database overflow
| dc.citation.epage | 789 | en_US |
| dc.citation.spage | 786 | en_US |
| dc.contributor.author | Sue, KL | en_US |
| dc.contributor.author | Lo, CC | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.date.accessioned | 2014-12-08T15:26:19Z | |
| dc.date.available | 2014-12-08T15:26:19Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.abstract | Visitor Location Register (VLR) may overflow due to the limited capacity. By replacing an existing record, the overflow users can still receive services. The most-idle replacement (MR) policy was proposed to improve the performance or the random replacement (RR) policy. The MR policy seems to he optimum and outperforms the RR policy significantly. However, the MR policy has potential limitations. Accordingly, we propose the N-class replacement (NR) policy to overcome the drawbacks. Moreover, the simulation results show that the NR policy outperforms the MR policy in most scenarios investigated in our study. As N increases, the improvement becomes more considerable. | en_US |
| dc.identifier.isbn | 7-5635-0686-1 | en_US |
| dc.identifier.journal | 2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/18699 | |
| dc.identifier.wosnumber | WOS:000185077800174 | |
| dc.language.iso | en_US | en_US |
| dc.subject | mobility management | en_US |
| dc.subject | VLR | en_US |
| dc.subject | database overflow | en_US |
| dc.subject | stochastic processes | en_US |
| dc.title | N-class replacement policy for resolving mobility database overflow | en_US |
| dc.type | Proceedings Paper | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: