| 研究生: |
林專勝 Lin, Chuan-Sheng |
|---|---|
| 論文名稱: |
應用於3GPP策略與計費控制系統之快取機制 A Cache Mechanism for 3GPP Policy and Charging Control System |
| 指導教授: |
蘇淑茵
Sou, Sok-Ian |
| 學位類別: |
碩士 Master |
| 系所名稱: |
電機資訊學院 - 電腦與通信工程研究所 Institute of Computer & Communication Engineering |
| 論文出版年: | 2010 |
| 畢業學年度: | 98 |
| 語文別: | 中文 |
| 論文頁數: | 83 |
| 中文關鍵詞: | IP多媒體子系統會話 、策略與計費控制系統 、弱一致性快取機制 |
| 外文關鍵詞: | IMS Session, PCC Architecture, weakly consistency cache |
| 相關次數: | 點閱:116 下載:4 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在本論文中,我們實作出一個符合3GPP之TS 23.203之策略與計費控制(Policy and Charging Control; PCC)系統,策略與計費規則控制系統提供動態的網路管理與即時計費的功能,然而,PCC信令傳遞會大幅增加建立session所需時間,降低建立session的效能,因此我們提出使用快取機制,以減少策略與計費規則控制器(Policy and Charging Rule Function; PCRF) 與用戶設定檔儲存器(Subscription Profile Repository; SPR)間因為傳送使用者資訊所造成的傳送延遲。
本論文所提出的快取機制,是屬於弱一致性的快取機制,會在使用者更新其使用者資訊一段時間後,才更新PCRF的快取,如此可以降低使用者過度頻繁更新使用者資訊所造成的系統資源浪費,我們提出了三種T-cache快取機制,Single-user T-cache (ST)、Multi-user T-cache (MT) 以及Multi-user Rule-based T-cache (MRT),以上三種T-cache皆是基於延遲更新門檻值T來決定是否更新,其中T代表等待更新的使用者資訊數或等待更新的使用者數。而在我們所建立的模擬實驗中,以快取中資料的正確率、快取更新的頻率以及更新的成本來對三種快取機制進行效能分析,由實驗得知,MT與MRT的效能均較優於ST,而若更新集中於少部分的使用者時,MT的更新成本會較小於MRT,但是MRT的資料正確率會較高於MT。而由實驗也可以得到,在策略與計費規則平台中使用快取機制能夠大幅降低建立session的延遲問題。
In this thesis, we present the design and the implementation of a test-bed for the Policy and Charging Control (PCC) system proposed in 3GPP TS23.203. The PCC architecture provides dynamic policy control in the packet data gateway combined with real-time charging management in the online charging system. However, long PCC signaling overhead incurred during PCC rule setup degrades the new session initiation performance. Thus, we propose a cache mechanism to shortern the subscriber profile retrieval delay incurred between two PCC components: the Policy and Charging Rule Function (PCRF) and the Subscription Profile Repository (SPR).
Based on the delayed update concept, the cache maintained in the PCRF will update only if certain update criteria is satisfied. Three caching variations, Single-user T-cache (ST), Multi-user T-cache (MT) and Multi-user Rule-based T-cache (MRT), are designed in respect to the delay threshold T, the number of updated profile and the number of updated users. We conduct simulation experiments to investigate the system performance in terms of the cache validity probabitliy, the cache update frequency, and the cache refresh cost. Among three cache variations, both MT and MRT have better performance than ST. When only a small amount of subscribers frequently update their subscriber profiles, the cost of MT is lower than that of MRT; however, the validity probability of MRT is higher than that of MT. In general, our results show that a cache mechinsim can significantly shotern the session setup delays.
[1] 3GPP, "Technical Specification Group Services and System Aspects; Policy and charging control architecture," 3G TS 23.203 Version 9.3.0 2009-12, (2009).
[2] S.-I. Sou, H.-Y. Lee, C.-S. Lin et al., “Design and implementation of policy and charging control system for advanced mobile services,” in 7th International Conference on Information, Communications and Signal Processing, ICICS, 2009, pp. 1-5.
[3] 3GPP, "Technical Specification Group Core Network and Terminals; Charging rule provisioning over Gx interface (Release 6),," 3G TS 29.210 version 6.7.0(2006-12),2006.
[4] 3GPP, "Technical Specification Group Core Network and Terminals; Rx Interface and Rx/Gx signaling flows (Release 6)," 3G TS 29.211 version 6.4.0(2007-06),2007.
[5] 林專勝, 謝文程, 蕭鈞文等 “具動態監控功能之策略與計費電信服務平台,” in Taiwan Academic Network Conference, TANET, 2009.
[6] T. Grgic, K. Ivesic, M. Grbac et al., “Policy-based charging in IMS for multimedia services with negotiable QoS requirements,” in 10th International Conference on Telecommunications, ConTEL 2009, pp. 257-264.
[7] Y. Fang, and Y.-B. Lin, “Strongly consistent access algorithms for wireless data networks,” Wirel. Netw., vol. 11, no. 3, pp. 243-254, 2005.
[8] W.-E. Chen, Y.-B. Lin, and R.-H. Liou, “A weakly consistent scheme for IMS presence service,” IEEE Transactions on Wireless Communications, vol. 8, no. 7, pp. 3815-3821, 2009.
[9] Y. Xiao, and H. Chen, “Optimal Callback with Two-Level Adaptation for Wireless Data Access,” IEEE Transactions on Mobile Computing, vol. 5, no. 8, pp. 1087-1102, 2006.
[10] Y.-B. Lin, W.-R. Lai, and J.-J. Chen, “Effects of cache mechanism on wireless data access,” IEEE Transactions on Wireless Communications, vol. 2, no. 6, pp. 1247-1258, 2003.
[11] 3GPP, "Technical Specification Group Services and System Aspects; IP Multimedia Subsystem (IMS); Stage 2 (Release 8)," 3GPP TS 23.228 V8.6.0 (2008-09), 2008.
[12] IETF, "SIP: Session Initiation Protocol " IETF 3261, 2002.
[13] IETF, "Diameter Base Protocol," IETF 3588, 2003.
[14] IETF, "Diameter Network Access Application," IETF RFC 4005, 2005.
[15] IETF, "Diameter Credit-Control Application," IETF RFC 4006, 2005.
[16] S.-I. Sou, J.-Y. Jeng, and Y. Lee, “Signaling overhead of policy and online charging control for bearer sessions in LTE network,” in The 13th IEEE International Symposium on Consumer Electronics, ISCE, Kyoto, Japan, 2009, pp. 593-597.
[17] “Open Diameter Project, http://www.opendiameter.org.”
[18] “openSIPS Project, http://www.opensips.org.”
[19] H. Chen, Y. Xiao, and S. V. Vrbsky, “Scalability study of cache access mechanisms in multiple-cell wireless networks,” Computer Networks, vol. 52, no. 15, pp. 3017-3027, 2008.
[20] J. Gray, P. Sundaresan, S. Englert et al., “Quickly generating billion-record synthetic databases,” in Proceedings of the 1994 ACM SIGMOD international conference on Management of data, Minneapolis, Minnesota, United States, 1994.
[21] L. Breslau, C. Pei, F. Li et al., “Web caching and Zipf-like distributions: evidence and implications,” in Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings, INFOCOM, 1999, pp. 126-134.