期刊文献+

STUDY ON THE ACCOUNT-SHARING STRATEGY FOR MULTI-SERVICES IN IMS ONLINE CHARGING MECHANISM

STUDY ON THE ACCOUNT-SHARING STRATEGY FOR MULTI-SERVICES IN IMS ONLINE CHARGING MECHANISM
下载PDF
导出
摘要 A prepaid subscriber is allowed to simultaneously implement multiple services in online charging mechanism of IP Multimedia Subsystem (IMS). It is a noteworthy discussion to effectively distribute the limited account resources among concurrent services. An account-sharing algorithm is proposed for multi-services,which introduces resource reclamation and redistribution processes based on the resource reservation of standard specifications and dynamically adjusts them according to the changes of Quality of Service (QoS). Three performance indexes are investigated in the simulation experiments, which are average number of accommodated sessions, average number of completed ses- sions, and average number of iterations per accommodated session. The results show that in the normal QoS level, the three indexes of the proposed algorithm averagely increase by 18.7%, 5.4%, and 3.1% compared with the Prepaid Credit Distribution (PCD) algorithm, and by 2.1%, 1.0%, and 1.8% compared with the Prepaid Credit Reclaim (PCR) algorithm. In the poor QoS level, the performance advantages are greater, which averagely increase by 29.1%, 7.1%, and 2.8% compared with PCD, and by 9.4%, 4.1%, and 3.6% compared with PCR. A prepaid subscriber is allowed to simultaneously implement multiple services in online charging mechanism of IP Multimedia Subsystem (IMS). It is a noteworthy discussion to effectively distribute the limited account resources among concurrent services. An account-sharing algorithm is proposed for multi-services, which introduces resource reclamation and redistribution processes based on the resource reservation of standard specifications and dynamically adjusts them according to the changes of Quality of Service (QoS). Three performance indexes are investigated in the simulation experiments, which are average number of accommodated sessions, average number of completed sessions, and average number of iterations per accommodated session. The results show that in the normal QoS level, the three indexes of the proposed algorithm averagely increase by 18.7%, 5.4%, and 3.1% compared with the Prepaid Credit Distribution (PCD) algorithm, and by 2.1%, 1.0%, and 1.8% compared with the Prepaid Credit Reclaim (PCR) algorithm. In the poor QoS level, the performance advantages are greater, which averagely increase by 29.1%, 7.1%, and 2.8% compared with PCD, and by 9.4%, 4.1%, and 3.6% compared with PCR.
出处 《Journal of Electronics(China)》 2009年第4期456-465,共10页 电子科学学刊(英文版)
基金 Supported by the National Natural Science Fund for Distinguished Young Scholars (No.60525110) the National 973 Program (No.2007CB307100, No.2007CB 307103) the Development Fund Project for Elec-tronic and Information Industry (Mobile Service and Application System Based on 3G)
关键词 收费机制 IMS 在线 共享 多业务 IP多媒体子系统 并发服务 帐号 IP Multimedia Subsystem (IMS) Online charging Account-sharing of multi-services Resource reclamation and redistribution
  • 相关文献

参考文献9

  • 1徐童,廖建新.基于分段线性函数的广义效用max-min公平分配算法研究[J].通信学报,2006,27(10):25-30. 被引量:4
  • 2IP Multimedia Sub- system (IMS) (Release 8). 3GPP TS 23.228 v8.4.0-2008 . 2008
  • 3Online Charging Sys- tem (OCS): Applications and Interfaces (Release 8). 3GPP. TS 32.296 v8.1.0-2007 . 2007
  • 4IP Multimedia Sub-system (IMS) Charging (Release 8). 3GPP. TS 32.260 v8.2.0-2007 . 2007
  • 5Diameter Charging Applications (Release 8). 3GPP. TS 32.299 v8.2.0-2008 . 2008
  • 6IETF.Diameter Credit-Control Ap- plication[].RFC.2005
  • 7Phone Lin,Yi-Bing Lin,Chai-Hien Gan, et al.Credit allocation for UMTS prepaid service[].IEEE Transac- tions on Vehicular Technology.2006
  • 8OUMINA H,RANC D.Towards a real time charging framework for complex applications in3GPP IP multimedia system(IMS)environ-ment[].NGMAST‘.2007
  • 9CACI Products Company.SIMPROCESS[]..

二级参考文献10

  • 1王玉峰,王文东,程时端.基于效用的资源适配机制公平性研究[J].北京邮电大学学报,2004,27(3):38-42. 被引量:8
  • 2RADUNOVI'C B,BOUDEC J Y.A unified framework for max-min and min-max fairness with applications[A].Proceedings Allerton'02[C].2002.
  • 3ATM Forum.Traffic management specification,version 4.1.AF-TM20121.000[EB/OL].http://www.atmforum.com/,2000.
  • 4HOU Y T,TZENG H,PANWAR S S.A generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism[A].IEEE Infocom'98[C].San Francisco,CA,USA,1998,1266-1375.
  • 5VANDALORE B,FAHMY S,JAIN R,et al.General weighted fairness and its support in explicit rate switch algorithms[J].Computer Communications,2000,23(2):149-161.
  • 6CAO Z,ZEGURA E.Utility max-min:an application-oriented bandwidth allocation scheme[A].INFO-COM'99[C].1999.793-801.
  • 7RUBENSTEIN D,KUROSE J,TOWSLEY D.The impact of multicast layering on network fairness[J].IEEE/ACM Transactions on Networking,2002,10(2):169-182.
  • 8RAYMOND R,LIAO F,ANDREW T.A utility-based approach quantitative adaptation in wireless packet networks[J].Wireless Networks,2001,7(5):541-557.
  • 9SHENKER S.Fundamental design issues for the future Intemet[J].IEEE Journal on Selected Areas in Communications,1995,13(7):1176-1188.
  • 10黄力菲,黄颖,李衍达.效用max-min公平准则及其在ABR业务中的应用[J].通信学报,2001,22(7):10-17. 被引量:3

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部