基于VoiceXML的语音增值业务平台及其算法的研究
|
摘要
在当前以及下一代网络中，语音业务是最重要的业务，占有非常大的比重，是运营商主要的盈利手段。而语音增值业务的蓬勃发展给运营商带来的并不只是直接的利润，它还提高了现有设备的利用率，更给用户带来了新的语音体验，提高了用户对运营商的忠诚度，吸引更多的用户使用该运营商的网络，也给运营商的其他业务带来了潜在的客户和利润。
然而，现有语音增值业务平台的封闭、不灵活、维护困难、业务开展困难等缺点难以根除。随着语音增值业务的发展，用户数量的增加，现有的语音增值业务平台已经不能满足需求，变成了阻碍语音增值业务进一步发展的因素。所以新的语音增值业务平台应运而生，而已经成为语音浏览器的规范的VoiceXML(Voice eXtensible Markup Language，语音可扩展标志语言)具有开发灵活、业务开展方式简单等优点，是新的语音增值业务平台的最佳选择之一。
本论文受国家杰出青年科学基金(No.60525110)、新世纪优秀人才支持计划(No.NCET-04-0111)、高等学校博士学科点专项科研基金资助课题(No.20030013006)资助，对基于VoiceXML的语音增值业务平台和其中涉及的一些算法进行了研究。目前，在研究成果的基础上已经完成了一个语音增值业务系统的开发，并且已在多个省份部署，拥有数百万的增值业务用户。
论文对研究过程中取得的主要创新成果进行了详细阐述。这些创新工作简要归纳如下：
1) VoiceXML语音增值业务平台通过网络来获取VoiceXML业务脚本和业务资源，所以不可避免地引入了网络时延，而电话用户对时延极其敏感。为了解决这个问题，对VoiceXML语音增值业务平台中的预取方案进行了研究，并认为在VoiceXML语音增值业务平台中预取的对象应是VoiceXML业务脚本中引用的业务语音资源，提出了一种自适应多用户共享的Markov预测算法，利用语音增值业务平台可以感知用户是否在线的特点，统一计算所有在线用户下一步所需的资源及其概率，提高了预测的准确率；进一步提出应采用抢占式优先级调度算法对预取任务进行调度，将资源将会被访问的概率映射为优先级参与排队进行预取调度。仿真研究表明，自适应多用户共享的Markov预测算法比目前的单用户Markov预测算法对资源未来的使用概率的预测更加准确，采用抢占式优先级调度模型也能比目前的循环调度模型得到更好的预取效益。两种算法结合可以有效地降低网络时延带来的影响，提高语音增值业务平台的响应速度，减少用户的等待时间。
2)为了更好地降低网络时延带来的不良影响，对缓存替换算法作了深入地研究，在分析了现有的若干缓存替换算法后，指出替换算法应该分成两个关键问题，其一是确定资源的效用函数，其二是替换过程的算法。针对第一个问题，改进了LRU-K(K-Least Recently Used，K阶最近使用)算法并提出了新的效用函数PLRU-K(Perfect LRU-K，完美的LRU-K)；对于第二个问题，根据0／1背包原理，提出了采用一阶优化贪婪替换过程(1-optimal Greedy Replacement Process，1-GRP)算法对缓存进行替换选择。仿真结果显示，PLRU-K的效用函数要比LRU-K、P-LFU(Perfect Least Frequently Used，完美的最少使用)效用函数更能体现缓存资源未来的使用收益；1-GRP算法要比P-GRP(Profit-based Greedy Replacement Process，基于收益的贪婪替换过程算法)、PD-GRP(Profit-Density-based Greedy Replacement Process，基于收益密度的贪婪替换过程算法)更能让缓存获得更大的收益；基于PLRU-K和1-GRP的缓存替换算法的性能要超过其他的替换算法，特别是在缓存空间较小的情况下。
3)为了避免缓存中的VoiceXML文档及资源与服务器上的原件不一致而将过期的数据提供给用户，缓存的一致性控制算法不可或缺。本文讨论了在Web环境中，在不对HTTP(HyperText Transfer Protocol，超文本传输协议)及Web服务器进行任何修改的前提下，如何更好地实现缓存一致性控制的问题。在分析了目前一致性控制算法的优劣的基础上，考虑到VoiceXML文档的特性，根据Web文档修改时间间隔满足负指数分布这一结论，提出了随机分布拟合预测算法，使用参数估计的方法来拟合VoiceXML文档修改时间间隔的随机分布，再通过此分布预测VoiceXML文档改变的概率，用以指导是否应使用缓存内的文档。仿真研究表明，使用随机拟合分布预测算法能得到小于0.01％的文档过期率，基本满足电信系统中呼损率的要求，同时能获得较大的性能提高。
4)针对VoiceXML中不能直接提供多方通信控制功能的问题，提出对VoiceXML的object元素提供的功能进行扩展；在讨论了多方通信控制所需要的具体功能之后，提出了阻塞式和非阻塞式两种不同的object扩展方案并分析了各自的优劣，还举例说明了如何使用这些object。
5)在电话会议的应用中，混音是一个关键的问题，而目前的混音算法都没有很好地克服混音后音量忽大忽小变化的问题。在分析了目前的混音算法之后，提出了非均匀波形收缩混音算法，该算法基于在语音信号中低强度信号比高强度信号出现几率更高的事实，采用与混音路数无关的恒定混音权重进行混音操作。同时该算法不需要进行乘除法操作，没有浮点运算，容易采用硬件实现。实验证明，该混音算法效果理想，混音后的语音自然流畅，没有噪音，在多路语音输入时仍能保证语音质量，并且是目前最快的混音算法之一，完全能满足语音会议中高性能、高并发的混音要求。
本论文的研究成果不仅可以用于基于VoiceXML的语音增值业务平台中，对于其他语音增值业务平台和相关领域的研究也具有很好的参考价值。
Voice services will be the most important in next generation network as wellas they are in the current communication networks. Voice services hold the largestpercentage of the total revenues, and are the main profit source of the networkoperators. The sharp growth of voice value-added services (WAS) does not onlyprofit the operators directly, but also improves the utilization ratio of the presentequipments, brings the customers new voice experiences, increases their loyaltiesto the operators, and brings more potential customers and profits to the otherservices of the operators.
But there are many shortcomings in the present voice value-added serviceplatforms (VSP), such as closed, not flexible, hard to maintain and deploy the newservices, etc. With the growth of the WAS and the user amount, the presentVSPs could not meet the demands, and began to cumber the further developmentof the WAS. So, it is time for the emergence of new VSP. VoiceXML (Voiceextensible Markup Language), which has been specified for the voice browser,has the virtue of flexibility, easily develop, and is one of the best choices of VSP.
This thesis is jointly supported by National Science Fund for DistinguishedYoung Scholars (No. 60525110) , Program for New Century Excellent Talents inUniversity (No. NCET-04-0111) , Specialized Research Fund for the DoctoralProgram of Higher Education (No. 20030013006) to research the voicevalue-added platform based on VoiceXML. A voice value-added service systembased on the research result had been developed, which has been further deployedin several provinces of China and is serving millions of users.
The principal contributions of the work presented in this thesis are:
1) VoiceXML-based VSP gets the VoiceXML service scripts and resourcesvia the Internet, so the network delay is unavoidable, while the phone users are much sensitive to the delay. The prefetch schema in the VoiceXML-based VSPhas been studied to resolve this problem, and it is proposed that the prefetchedobjects should be the resources which are referenced by the VoiceXML scripts.An adaptive multi-user shared Markov predict algorithm is presented, which usesthe character that the voice platform can know whether a user is online or not.This algorithm can predict the probability of the forthcoming required resourcesof all the online users, which is helpful to improve the veracity of the prediction.And a preemptive priority model is designed to schedule the prefetch tasks, whichmaps the resource access probability to the task priority. The simulation researchshows that the precision of the adaptive multi-user shared Markov predictalgorithm is better than that of single user Markov predict algorithm and thepreemptive priority schedule model can get more profits than the round-robinschedule model. The combination of the two new algorithms can considerablyreduce the network delay, accelerate the response, and decrease the user's waitingtime.
2) In order to further reduce the network delay, the cache replacementalgorithm has been studied. By analyzing the present cache replacementalgorithms, two key problems are pointed out, one is how to establish the resourceutility function, and the other is the algorithm of replacement process. For the firstproblem, the LRU-K (K-Least Recently Used) algorithm is improved byproducing a novel utility function named PLRU-K (Perfect LRU-K). And for thesecond problem, according to the 0/1 Knapsack problem, the 1-optimal greedyreplacement process (1-GRP) is proposed to select and replace resources from thecache. The simulation research shows that the utility function of PLRU-K can getthe more veracious future profit of resource than that of LRU-K and P-LFU(Perfect Least Frequently Used) and 1-GRP algorithm can get more profit thanP-GRP (Profit-based Greedy Replacement Process) and PD-GRP(Profit-Density-based Greedy Replacement Process). So, the performance of thecache replacement algorithm based on PLRU-K and 1-GRP goes beyond otheralgorithms, especially when the cache volume is far smaller than the total size ofthe resources.
3) The cache consistency control algorithm is indispensable in order to avoidgiving some stale data to the user. It is discussed how to develop a method that does not entail any server modifications or changes to the HTTP (HyperTextTransfer Protocol) to implement the consistency control. By analyzing the presentconsistency algorithms, considering the character of the VoiceXML document,and according to the conclusion that the Web pages modification intervals followexponential distribution, the Fitting & Prediction algorithm is proposed. Itestimates the validity of the cached document by performing parameter fits tostochastic distribution and predicting the change probability of VoiceXMLdocument. Simulation research indicates the algorithm surpasses the Alexprotocol and can obtain a stale ratio lower than 0．01% to meet the demand of thevoice platform while effectively enhance the system performance.
4) To resolve the problem that the multi-party communication function isinvalid in VoiceXML, it is proposed that the function can be performed byextending the object element. After the discussion of the function details of themulti-party communication, two object extended schemes included block andnon-block approaches are proposed and their advantage and disadvantage arepointed out. And it is illustrated how to use those objects.
5) Audio mixing is an essential component in conference, and the presentaudio mixing algorithms have a protean volume. By analyzing those algorithms,an algorithm named asymmetrical wave-shrinking is proposed. Based on the factthat the low volume appears more frequently than the high volume in the voicesignal, it uses a fixed mixing weight independent of inputs to mix the audios.Without multiplication and division operations, the algorithm is so simple and fastthat it can be easily implemented by hardware. The experimentation shows thatthe result of this algorithm is very good and sounds naturally and fluently withoutnoises even if there are many inputs. This algorithm is one of the fastestalgorithms at present, so it can meet the demand of the high performance and highconcurrence in the voice conference.
The contributions in this thesis are not only used in VoiceXML-based voicevalue-added platform, and are also useful for the other voice platforms and theother related research fields.
然而，现有语音增值业务平台的封闭、不灵活、维护困难、业务开展困难等缺点难以根除。随着语音增值业务的发展，用户数量的增加，现有的语音增值业务平台已经不能满足需求，变成了阻碍语音增值业务进一步发展的因素。所以新的语音增值业务平台应运而生，而已经成为语音浏览器的规范的VoiceXML(Voice eXtensible Markup Language，语音可扩展标志语言)具有开发灵活、业务开展方式简单等优点，是新的语音增值业务平台的最佳选择之一。
本论文受国家杰出青年科学基金(No.60525110)、新世纪优秀人才支持计划(No.NCET-04-0111)、高等学校博士学科点专项科研基金资助课题(No.20030013006)资助，对基于VoiceXML的语音增值业务平台和其中涉及的一些算法进行了研究。目前，在研究成果的基础上已经完成了一个语音增值业务系统的开发，并且已在多个省份部署，拥有数百万的增值业务用户。
论文对研究过程中取得的主要创新成果进行了详细阐述。这些创新工作简要归纳如下：
1) VoiceXML语音增值业务平台通过网络来获取VoiceXML业务脚本和业务资源，所以不可避免地引入了网络时延，而电话用户对时延极其敏感。为了解决这个问题，对VoiceXML语音增值业务平台中的预取方案进行了研究，并认为在VoiceXML语音增值业务平台中预取的对象应是VoiceXML业务脚本中引用的业务语音资源，提出了一种自适应多用户共享的Markov预测算法，利用语音增值业务平台可以感知用户是否在线的特点，统一计算所有在线用户下一步所需的资源及其概率，提高了预测的准确率；进一步提出应采用抢占式优先级调度算法对预取任务进行调度，将资源将会被访问的概率映射为优先级参与排队进行预取调度。仿真研究表明，自适应多用户共享的Markov预测算法比目前的单用户Markov预测算法对资源未来的使用概率的预测更加准确，采用抢占式优先级调度模型也能比目前的循环调度模型得到更好的预取效益。两种算法结合可以有效地降低网络时延带来的影响，提高语音增值业务平台的响应速度，减少用户的等待时间。
2)为了更好地降低网络时延带来的不良影响，对缓存替换算法作了深入地研究，在分析了现有的若干缓存替换算法后，指出替换算法应该分成两个关键问题，其一是确定资源的效用函数，其二是替换过程的算法。针对第一个问题，改进了LRU-K(K-Least Recently Used，K阶最近使用)算法并提出了新的效用函数PLRU-K(Perfect LRU-K，完美的LRU-K)；对于第二个问题，根据0／1背包原理，提出了采用一阶优化贪婪替换过程(1-optimal Greedy Replacement Process，1-GRP)算法对缓存进行替换选择。仿真结果显示，PLRU-K的效用函数要比LRU-K、P-LFU(Perfect Least Frequently Used，完美的最少使用)效用函数更能体现缓存资源未来的使用收益；1-GRP算法要比P-GRP(Profit-based Greedy Replacement Process，基于收益的贪婪替换过程算法)、PD-GRP(Profit-Density-based Greedy Replacement Process，基于收益密度的贪婪替换过程算法)更能让缓存获得更大的收益；基于PLRU-K和1-GRP的缓存替换算法的性能要超过其他的替换算法，特别是在缓存空间较小的情况下。
3)为了避免缓存中的VoiceXML文档及资源与服务器上的原件不一致而将过期的数据提供给用户，缓存的一致性控制算法不可或缺。本文讨论了在Web环境中，在不对HTTP(HyperText Transfer Protocol，超文本传输协议)及Web服务器进行任何修改的前提下，如何更好地实现缓存一致性控制的问题。在分析了目前一致性控制算法的优劣的基础上，考虑到VoiceXML文档的特性，根据Web文档修改时间间隔满足负指数分布这一结论，提出了随机分布拟合预测算法，使用参数估计的方法来拟合VoiceXML文档修改时间间隔的随机分布，再通过此分布预测VoiceXML文档改变的概率，用以指导是否应使用缓存内的文档。仿真研究表明，使用随机拟合分布预测算法能得到小于0.01％的文档过期率，基本满足电信系统中呼损率的要求，同时能获得较大的性能提高。
4)针对VoiceXML中不能直接提供多方通信控制功能的问题，提出对VoiceXML的object元素提供的功能进行扩展；在讨论了多方通信控制所需要的具体功能之后，提出了阻塞式和非阻塞式两种不同的object扩展方案并分析了各自的优劣，还举例说明了如何使用这些object。
5)在电话会议的应用中，混音是一个关键的问题，而目前的混音算法都没有很好地克服混音后音量忽大忽小变化的问题。在分析了目前的混音算法之后，提出了非均匀波形收缩混音算法，该算法基于在语音信号中低强度信号比高强度信号出现几率更高的事实，采用与混音路数无关的恒定混音权重进行混音操作。同时该算法不需要进行乘除法操作，没有浮点运算，容易采用硬件实现。实验证明，该混音算法效果理想，混音后的语音自然流畅，没有噪音，在多路语音输入时仍能保证语音质量，并且是目前最快的混音算法之一，完全能满足语音会议中高性能、高并发的混音要求。
本论文的研究成果不仅可以用于基于VoiceXML的语音增值业务平台中，对于其他语音增值业务平台和相关领域的研究也具有很好的参考价值。
Voice services will be the most important in next generation network as wellas they are in the current communication networks. Voice services hold the largestpercentage of the total revenues, and are the main profit source of the networkoperators. The sharp growth of voice value-added services (WAS) does not onlyprofit the operators directly, but also improves the utilization ratio of the presentequipments, brings the customers new voice experiences, increases their loyaltiesto the operators, and brings more potential customers and profits to the otherservices of the operators.
But there are many shortcomings in the present voice value-added serviceplatforms (VSP), such as closed, not flexible, hard to maintain and deploy the newservices, etc. With the growth of the WAS and the user amount, the presentVSPs could not meet the demands, and began to cumber the further developmentof the WAS. So, it is time for the emergence of new VSP. VoiceXML (Voiceextensible Markup Language), which has been specified for the voice browser,has the virtue of flexibility, easily develop, and is one of the best choices of VSP.
This thesis is jointly supported by National Science Fund for DistinguishedYoung Scholars (No. 60525110) , Program for New Century Excellent Talents inUniversity (No. NCET-04-0111) , Specialized Research Fund for the DoctoralProgram of Higher Education (No. 20030013006) to research the voicevalue-added platform based on VoiceXML. A voice value-added service systembased on the research result had been developed, which has been further deployedin several provinces of China and is serving millions of users.
The principal contributions of the work presented in this thesis are:
1) VoiceXML-based VSP gets the VoiceXML service scripts and resourcesvia the Internet, so the network delay is unavoidable, while the phone users are much sensitive to the delay. The prefetch schema in the VoiceXML-based VSPhas been studied to resolve this problem, and it is proposed that the prefetchedobjects should be the resources which are referenced by the VoiceXML scripts.An adaptive multi-user shared Markov predict algorithm is presented, which usesthe character that the voice platform can know whether a user is online or not.This algorithm can predict the probability of the forthcoming required resourcesof all the online users, which is helpful to improve the veracity of the prediction.And a preemptive priority model is designed to schedule the prefetch tasks, whichmaps the resource access probability to the task priority. The simulation researchshows that the precision of the adaptive multi-user shared Markov predictalgorithm is better than that of single user Markov predict algorithm and thepreemptive priority schedule model can get more profits than the round-robinschedule model. The combination of the two new algorithms can considerablyreduce the network delay, accelerate the response, and decrease the user's waitingtime.
2) In order to further reduce the network delay, the cache replacementalgorithm has been studied. By analyzing the present cache replacementalgorithms, two key problems are pointed out, one is how to establish the resourceutility function, and the other is the algorithm of replacement process. For the firstproblem, the LRU-K (K-Least Recently Used) algorithm is improved byproducing a novel utility function named PLRU-K (Perfect LRU-K). And for thesecond problem, according to the 0/1 Knapsack problem, the 1-optimal greedyreplacement process (1-GRP) is proposed to select and replace resources from thecache. The simulation research shows that the utility function of PLRU-K can getthe more veracious future profit of resource than that of LRU-K and P-LFU(Perfect Least Frequently Used) and 1-GRP algorithm can get more profit thanP-GRP (Profit-based Greedy Replacement Process) and PD-GRP(Profit-Density-based Greedy Replacement Process). So, the performance of thecache replacement algorithm based on PLRU-K and 1-GRP goes beyond otheralgorithms, especially when the cache volume is far smaller than the total size ofthe resources.
3) The cache consistency control algorithm is indispensable in order to avoidgiving some stale data to the user. It is discussed how to develop a method that does not entail any server modifications or changes to the HTTP (HyperTextTransfer Protocol) to implement the consistency control. By analyzing the presentconsistency algorithms, considering the character of the VoiceXML document,and according to the conclusion that the Web pages modification intervals followexponential distribution, the Fitting & Prediction algorithm is proposed. Itestimates the validity of the cached document by performing parameter fits tostochastic distribution and predicting the change probability of VoiceXMLdocument. Simulation research indicates the algorithm surpasses the Alexprotocol and can obtain a stale ratio lower than 0．01% to meet the demand of thevoice platform while effectively enhance the system performance.
4) To resolve the problem that the multi-party communication function isinvalid in VoiceXML, it is proposed that the function can be performed byextending the object element. After the discussion of the function details of themulti-party communication, two object extended schemes included block andnon-block approaches are proposed and their advantage and disadvantage arepointed out. And it is illustrated how to use those objects.
5) Audio mixing is an essential component in conference, and the presentaudio mixing algorithms have a protean volume. By analyzing those algorithms,an algorithm named asymmetrical wave-shrinking is proposed. Based on the factthat the low volume appears more frequently than the high volume in the voicesignal, it uses a fixed mixing weight independent of inputs to mix the audios.Without multiplication and division operations, the algorithm is so simple and fastthat it can be easily implemented by hardware. The experimentation shows thatthe result of this algorithm is very good and sounds naturally and fluently withoutnoises even if there are many inputs. This algorithm is one of the fastestalgorithms at present, so it can meet the demand of the high performance and highconcurrence in the voice conference.
The contributions in this thesis are not only used in VoiceXML-based voicevalue-added platform, and are also useful for the other voice platforms and theother related research fields.
引文
[1] 周姝怡．如何建立3G竞争优势?2005．12，http://telecom.chinabyte.com/430/2219930.shtml
[2] 吕俊辉，邓时颖，李怀诚．VoiceXML规范．信息技术与标准化，9，2002．9，21-24
[3] W3C. Voice Extensible Markup Language (VoiceXML) Version 2.0. 2003.1, http://www.w3.org/TR/voicexml20/
[4] W3C. Voice Extensible Markup Language (VoiceXML) Version 2.1. 2004.7, http://www.w3.org/TR/voicexml21/
[5] 阿与．语音增值业务(IVR)基础知识．中国数据通信，7，2004．7，63-65
[6] 刘淑敏．话音仍是撬动新技术应用的关键．2006．1，http://www.tele.com.cn/content.aspx?id=1423
[7] 信息产业部电信研究院．全球3G运营市场统计和动态．2004．12，http://media.cttl.com.cn/3g_show.php?id=3
[8] 中国信息产业网．国内外彩铃业务市场分析报告．2004．9，http://t-xzxs.cnii.com.cn/20030527/ca260309.htm
[9] 陈光义．国内彩铃用户超过3400万．2005．5，http://news3.xinhuanet.com/ec/2005-05/30/content_3019601.htm
[10] 胡海．增值业务是提高大客户粘性的利器．2005．9，http://www.ogood.com.cn/ogood2.asp?id=211
[11] W3C. Call Control Extensible Markup Language (CCXML) Version 1.0. 2005.6, http://www.w3.org/TR/2004/WD-ccxml-20040430/
[12] 李明华，徐良贤．VoiceXML语音浏览器的研究．计算机工程，28(10)，2002．10，7-9
[13] 程龙，杨海兰，吴功宜．基于VoiceXML的语音浏览器的研究与实现．计算机工程与应用，24，2003．12，129-130
[14] 王吉，梁莉．基于VoiceXML的盲用浏览器的设计开发．科技创业月刊，12，2005．12，175-177
[15] 马小明，薛贺，邓正宏．基于VoiceXML的交互式语音应答(IVR)系统的设计与实现．微电子学与计算机，23(3)，2006．3，100-103
[16] 严威，宋培义．用VoiceXML开发语音商务网站．北京广播学院学报(自然科学版)，9(4)，2002．4，69-77
[17] 高俊华，姚国祥．Java与VoiceXML结合建设基于WEB的CTI．中山大学学报(自然科学版)，41(S)，2002．1，38-41
[18] 沈奇威，廖建新，朱晓民．语音消息系统的设计和实现．电信工程技术与标准化，8，2004．8，73-79
[19] 沈奇威，温雪，廖建新．基于VoiceXML的增强智能外设．电信工程技术与标准化，5，2004．5，65-69
[20] 张杏莉，杨社堂．基于VoiceXML的呼叫中心的研究和实现．科技情报开发与经济，15(1)，2005．1，252-254
[21] 杨盘龙．语音门户业务及其相关技术介绍．无线通信技术，1，2002．1，59-61
[22] 周振喜，戴国骏，陈晓峰等．基于VoiceXML的语音门户研究．微型机与应用，12，2003．12，52-54
[23] 法国电信北京研究院．移动增值业务IVR．当代通信，24，2004．12，54-54
[24] 熊桂林，邹志敏．基于SMS的增值服务平台的设计与实现．系统工程，21(1)，2003．1，59-62
[25] 龚双瑾，刘多．移动与IP智能网．人民邮电出版社，2004．1，161-169
[26] W3C. SOAP Version 1.2 Part 0: Primer. 2003.6, http://www.w3c.org/TR/soap12-part0
[27] SMS Forum. Short Message Peer to Peer Protocol Specification v3.4. 1999.10, http://smsforum.net/doc
[28] 3GPP. Multimedia Messaging Service(MMS); Functional description; Stage 2 V6.12.0. 2006.3, http://www.3gpp.org
[29] WAP Forum. WAP Push Access Protocol Specification. 1999.8, http://www.wapforum.org
[30] 中国移动通信集团公司．USSD应用协议1．0．2004．5
[31] IETF. SIP: Session Initiation Protocol. 2002.6, http://www.ietf.org/rfc/rfc3261.txt
[32] 3GPP. IP Multimedia Subsystem (IMS); Stage 2 V7.3.0. 2006.3, http://ww.3gpp.org
[33] Marcatos E P, Chronaki C E. A Top-10 Approach to Prefetching the Web. In: proceedings of the Eighth Annual Conference of the Internet Society, Geneva, INET, 1998.7, http://www.isoc.org/inet98/proceedings/li/li_2.htm
[34] Chinen K, Yamaguchi S. An Interactive Prefetching Proxy Server for Improvement of WWW Latency. In: proceedings of the Seventh Annual Conference of Internet Society, Kuala Lumpur, INET, 1997.6, 473-478
[35] Duchamp D. Prefetching Hyperlinks. In: proceedings of the Second USENIX Symposium on Internet Technologies and Systems, Boulder, USENIX, 1999.10, 127-138
[36] Davison B D. Predicting Web Actions from HTML Content. In: proceedings of the Thirteenth ACM Conference on Hypertext and Hypermedia, Maryland, ACM, 2002.6, 159-168
[37] Tauscher L, Greenberg S. How People Revisit Web Pages: Empirical Findings and Implication for the Design of History Systems. International Journal of Human-Computer Studies, 47(1), 1997.1, 97-137
[38] Davison B D. Web Traffic Logs: An Imperfect Resource for Evaluation. In: proceedings of the Ninth Annual Conference of the Internet Society, San Jose, INET, 1999.6, http://www.isoc.org/inet99/proceedings/4n/4n_1.htm
[39] Su Z, Yang Q. Whatnext: A Prediction System for Web Requests Using n-gram Sequence Models. In: proceedings of the First International Conference on Web Information System and Engineering Conference, Hong Kong, WISE, 2000.6, 200-207
[40] Yang Q, Zhang H H, Li T Y. Mining Web Logs for Prediction Models in WWW Caching and Prefetching. In: proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD'01, San Francisco, ACM, 2001.8, 473-478
[41] 朱培栋，卢锡成，周光铭．基于客户行为模式的Web文档预送．软件学报，10(11)，1999．11．1142-1147
[42] Pitkow J, Pirolli P. Mining Longest Repeating Subsequences to Predict World Wide Web Surfing. In: proceedings of the Second USENIX Symposium on Internet Technologies & Systems, Boulder, USENIX, 1999.10, 139-150
[43] Deshpande M, Karypis G. Selective Markov Models for Predicting Web-Page Accesses. ACM Transactions on Internet Technology, 4(2), 2004.2, 163-184
[44] Lei H, Duchamp D. An Analytical Approach to File Prefetching. In: proceedings of USENIX 1997 Annual Technical Conference, Anaheim, USENIX, 1997.1, 275-288
[45] Fan L, Cao P, Jacobson Q. Web Prefetching Between Low-Bandwidth Clients and Proxies: Potential and Performance. In: proceedings of the ACM SIGMETERICS'99, Atlanta, ACM, 1999.5, 178-187
[46] Schechter S, Krishnan M, Smith M D. Using Path Profiles to Predict HTTP Requests. Computer Networks and ISDN Systems, 30(1-7), 1998.1, 457-467
[47] Jiang Z, Kleinrock L. An Adaptive Network Prefetch Scheme. IEEE Journal on Selected Areas in Communications, 16(3), 1998.3, 358-368
[48] Jiang Z, Kleinrock L. Web Prefetching in a Mobile Environment. IEEE Personal Communications, 5(5), 1998.5, 25-34
[49] Jiang Z, Kleinrock L. Prefetching Links on the WWW. In: proceedings of the 1997 IEEE International Conference on Communications, Montreal, IEEE, 1997.6, 483-489
[50] Conhen E, Kristhnamurthy B, Rexford J. Efficient Algorithms for Predicting Requests to Web Servers. In: proceedings of the IEEE INFOCOM'99, New York, IEEE, 1999.3, 284-293
[51] Padmanabhan V N, Mogul J C. Using Predictive Prefetching to Improve World Wide Web Latency. Computer Communication Review, 26(3), 1996.3, 22-36
[52] 徐保文，张卫丰．数据挖掘技术在Web预取中的应用研究．计算机学报，24(4)，2001．4，430-436
[53] Caceres R, Douglis F, Feldmann A, Glass G, et al.. Web proxy caching: the devil is in the details. ACM Performance Evaluation Review, 26(3), 1998.3, 11-15
[54] Duska B M, Marwood D, Feelay M J. The measured access characteristics of World Wide Web client proxy caches. In: proceedings of the First USENIX Symposium on Internet Technologies and Systems, Monterey, 1997.12, 23-35
[55] Otoo E J, Olken F, Shoshani A. Disk cache replacement algorithm for storage resource managers in data grids. In: proceedings of the 2002 ACM/IEEE conference on Supercomputing table of contents, Baltimore, IEEE, 2002.11, 1-15
[56] Davison B D. A web caching primer. IEEE Internet Computing, 5(4), 2001.4, 38-45
[57] Wang J. A survey of web caching schemes for the Internet. ACM Computer Communication Review, 29(5), 1999.5, 36-46
[58] Smaragdakis Y, Kaplan S, Wilson P. The EELRU adaptive replacement algorithm. Performance Evaluation, 53(2), 2003.2, 93-123
[59] Smaragdakis Y, Kaplan S, Wilson P. EELRU: Simple and effective adaptive page replacement. In proceedings of the 1999 ACM SIGMETRICS Conference on the Measurement and Modeling of Computer Systems, Atlanta, 1999.5, 122-133
[60] O'Neil E J, O'Neil P E, Weikum G. The LRU-K page replacement algorithm for database disk buffering. In: proceedings of International Conference on Management of Data, Washington, 1993.5, 297-306
[61] O'Neil E J, O'Neil P E, Weikum G. An optimality proof of the LRU-K page replacement algorithm. Journal of the ACM, 46(1), 1999.1, 92-112
[62] Robinson J T, Devarakonda M V. Data cache management using frequency-based replacement. In: proceedings of the 1990 ACM SIGMETRICS Conference on Measuring and Modeling of Computer Systems, Boulder, 1990.5, 134-142
[63] Breslau L, Cao P, Fan L, et al.. Web caching and Zipf-like distributions: evidence and implications. In: proceedings of the IEEE INFOCOM'99, New York, 1999.3, 126-134
[64] Williams S, Abrams M, Standridge C R, et al.. Removal poiicies in network caches for World-Wide Web documents. In: proceedings of the ACM SIGCOMM, Stanford, 1996.8, 293-304
[65] Abrams M, Standridge C R, Abdulla G, et al.. Caching proxies: limitations and potentials. In: proceedings of the Forth International WWW Conference, Boston, 1995.12, 119-133
[66] Wooster R P, Abrams M. Proxy caching that estimates page load delays. In: proceedings of the Sixth International WWW Conference, Santa Clara, 1997.4, 325-334
[67] Scheuermann P, Shim J, Vingralek R. A case for delay-conscious caching of Web documents. In: proceedings of the Sixth International WWW Conference, Santa Clara, 1997.4, 997-1005
[68] Bolot J C, Hoschka P. Performance engineering of the World-Wide Web: Application to dimensioning and cache design. In: proceedings of the Fifth International WWW Conference, Paris, 1996.5, 185-195
[69] Aggarwal C, Wolf J L, Yu P S. Caching on the World Wide Web. IEEE Transactions on Knowledge and data Engineering, 11(1), 1999.1, 94-107
[70] Martello S, Toth P. Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, New York, London, Sydney, 1990.8, 13-80
[71] Care V. Alex-A GlobaI Filesystem. In: proceedings of the 1992 USENIX File System Workshop, Ann Arbor, USENIX, 1992.5, 1-12
[72] James G, Margo S. World-wide Web cache consistency. In: proceedings of the 1996 USENIX Technical conference, San Diego, USENIX, 1996.1, 141-151
[73] Srinivasan R, Chao L, Ramamritham K. Maintaining Temporal Coherency of Virtual Data Warehouses. In: proceedings of Real-Time Systems Symposium, Madrid, IEEE, 1998.12, 60-70
[74] Satitsamitpong M, Thomas H. Cache freshness optimization: sliding scale guarantees. In: proceedings of Advanced Issues of E-Commerce and Web-Based Information Systems, San Jose, WECWIS, 2001.6, 228-230
[75] Datta A, Dutta K, Thomas H, VanderMeer D, et al.. A proxy-based approach for dynamic content acceleration on the WWW. In: proceedings of Advanced Issues of E-Commerce and Web-Based Information Systems, Newport Beach, WECWIS, 2002.6, 159-164
[76] Yuan C, Hua Z G, Zhang Z. Proxy+: Simple Proxy Augmentation for Dynamic Content Processing. In: proceedings of Web Caching and Distribution, Hawthorne, WCW, 2003.9, http://2003.iwcw.org/papers/yuan.pdf
[77] Alonso R, Barbara D, Garcia-Molina H. Data Caching Issues in an Information Retrieval System. ACM Transactions on Database Systems(TODS), 15(3), 1990.3,359-384
[78] Cao P, Liu C J. Maintaining Strong Cache Consistency in the World-Wide Web. IEEE Transactions on Computers, 47(4), 1998.4, 445-457
[79] Wen SL, Po P, Wang P H, Canda K S, et al.. Freshness-driven adaptive caching for dynamic content. In: proceeding of Database Systems for Advanced Applications, Kyoto, DASFAA, 2003.3, 203-212
[80] Renu T, Thirumale N, Srikanth R. WCDP: A protocol for web cache consistency. In: proceedings of Web Caching and Distribution, Boulder, WCW, 2002.8, http://2002.iwcw.org/papers/18500180.pdf
[81] Cao L. Consistency Control Algorithms for Web Caching. 2001.2, http://db.uwaterloo.ca/～tozsu/courses/cs748t/weekly.html
[82] Brian B, George C. How dynamic is the web? In: proceedings of the Ninth International World Wide Web Conference, IW3C2, 2000.5, http://www9.org/w9cdrom/264/264.html
[83] Brian B, George C. Keeping up with the changing Web. IEEE Computer, 33(5), 2000.5, 52-58
[84] 盛骤，谢式千，潘承毅．概率论与数理统计．第二版．高等教育出版社，1989．8，157-165
[85] Stephens M A. EDF statistics for goodness of fit and some comparisons. Journal of the American Statistical Association, 69(347), 1974.9, 730-737
[86] Coulson G, Williams N, Blair G S. Group presentation of multimedia applications in IXION. Computer Communication, 14(4), 1991.4, 205-215
[87] Gonazález A J, Hussein A W. Audio mixing for interactive multimedia communications. In: proceedings of JCIS'98, North Carolina, 1998.10, 217-220
[88] 杨树堂，余胜生，周敬利．基于分组网络的多点实时语音混合及调度算法．软件学报，12(9)，2001．9，1413-1419
[89] 徐保民，王秀玲．一个改进的混音算法．电子与信息学报，25(12)，2003．12，1709-1713．
[90] 樊星，顾伟康，叶秀清．多媒体会议中的快速实时自适应混音方案研究．软件学报，16(1)，2005．1，108-115
[91] 马旋，王衡，汪国平等．视频会议中混音后溢出问题的研究及解决方法．第13届全国多媒体学术会议论文集，宁波，2004．10，http://graphics.pku.edu.cn/papers/2004.htm
[92] ITU-T. Packet-based multimedia communication system. ITU-T Rec H.323 v4, 2003.7.
[93] 涂卫平，胡瑞敏，艾浩军等．视频会议中音频多点处理器的研究．武汉大学学报信息科学版，27(1)，2002．1，98-101
[2] 吕俊辉，邓时颖，李怀诚．VoiceXML规范．信息技术与标准化，9，2002．9，21-24
[3] W3C. Voice Extensible Markup Language (VoiceXML) Version 2.0. 2003.1, http://www.w3.org/TR/voicexml20/
[4] W3C. Voice Extensible Markup Language (VoiceXML) Version 2.1. 2004.7, http://www.w3.org/TR/voicexml21/
[5] 阿与．语音增值业务(IVR)基础知识．中国数据通信，7，2004．7，63-65
[6] 刘淑敏．话音仍是撬动新技术应用的关键．2006．1，http://www.tele.com.cn/content.aspx?id=1423
[7] 信息产业部电信研究院．全球3G运营市场统计和动态．2004．12，http://media.cttl.com.cn/3g_show.php?id=3
[8] 中国信息产业网．国内外彩铃业务市场分析报告．2004．9，http://t-xzxs.cnii.com.cn/20030527/ca260309.htm
[9] 陈光义．国内彩铃用户超过3400万．2005．5，http://news3.xinhuanet.com/ec/2005-05/30/content_3019601.htm
[10] 胡海．增值业务是提高大客户粘性的利器．2005．9，http://www.ogood.com.cn/ogood2.asp?id=211
[11] W3C. Call Control Extensible Markup Language (CCXML) Version 1.0. 2005.6, http://www.w3.org/TR/2004/WD-ccxml-20040430/
[12] 李明华，徐良贤．VoiceXML语音浏览器的研究．计算机工程，28(10)，2002．10，7-9
[13] 程龙，杨海兰，吴功宜．基于VoiceXML的语音浏览器的研究与实现．计算机工程与应用，24，2003．12，129-130
[14] 王吉，梁莉．基于VoiceXML的盲用浏览器的设计开发．科技创业月刊，12，2005．12，175-177
[15] 马小明，薛贺，邓正宏．基于VoiceXML的交互式语音应答(IVR)系统的设计与实现．微电子学与计算机，23(3)，2006．3，100-103
[16] 严威，宋培义．用VoiceXML开发语音商务网站．北京广播学院学报(自然科学版)，9(4)，2002．4，69-77
[17] 高俊华，姚国祥．Java与VoiceXML结合建设基于WEB的CTI．中山大学学报(自然科学版)，41(S)，2002．1，38-41
[18] 沈奇威，廖建新，朱晓民．语音消息系统的设计和实现．电信工程技术与标准化，8，2004．8，73-79
[19] 沈奇威，温雪，廖建新．基于VoiceXML的增强智能外设．电信工程技术与标准化，5，2004．5，65-69
[20] 张杏莉，杨社堂．基于VoiceXML的呼叫中心的研究和实现．科技情报开发与经济，15(1)，2005．1，252-254
[21] 杨盘龙．语音门户业务及其相关技术介绍．无线通信技术，1，2002．1，59-61
[22] 周振喜，戴国骏，陈晓峰等．基于VoiceXML的语音门户研究．微型机与应用，12，2003．12，52-54
[23] 法国电信北京研究院．移动增值业务IVR．当代通信，24，2004．12，54-54
[24] 熊桂林，邹志敏．基于SMS的增值服务平台的设计与实现．系统工程，21(1)，2003．1，59-62
[25] 龚双瑾，刘多．移动与IP智能网．人民邮电出版社，2004．1，161-169
[26] W3C. SOAP Version 1.2 Part 0: Primer. 2003.6, http://www.w3c.org/TR/soap12-part0
[27] SMS Forum. Short Message Peer to Peer Protocol Specification v3.4. 1999.10, http://smsforum.net/doc
[28] 3GPP. Multimedia Messaging Service(MMS); Functional description; Stage 2 V6.12.0. 2006.3, http://www.3gpp.org
[29] WAP Forum. WAP Push Access Protocol Specification. 1999.8, http://www.wapforum.org
[30] 中国移动通信集团公司．USSD应用协议1．0．2004．5
[31] IETF. SIP: Session Initiation Protocol. 2002.6, http://www.ietf.org/rfc/rfc3261.txt
[32] 3GPP. IP Multimedia Subsystem (IMS); Stage 2 V7.3.0. 2006.3, http://ww.3gpp.org
[33] Marcatos E P, Chronaki C E. A Top-10 Approach to Prefetching the Web. In: proceedings of the Eighth Annual Conference of the Internet Society, Geneva, INET, 1998.7, http://www.isoc.org/inet98/proceedings/li/li_2.htm
[34] Chinen K, Yamaguchi S. An Interactive Prefetching Proxy Server for Improvement of WWW Latency. In: proceedings of the Seventh Annual Conference of Internet Society, Kuala Lumpur, INET, 1997.6, 473-478
[35] Duchamp D. Prefetching Hyperlinks. In: proceedings of the Second USENIX Symposium on Internet Technologies and Systems, Boulder, USENIX, 1999.10, 127-138
[36] Davison B D. Predicting Web Actions from HTML Content. In: proceedings of the Thirteenth ACM Conference on Hypertext and Hypermedia, Maryland, ACM, 2002.6, 159-168
[37] Tauscher L, Greenberg S. How People Revisit Web Pages: Empirical Findings and Implication for the Design of History Systems. International Journal of Human-Computer Studies, 47(1), 1997.1, 97-137
[38] Davison B D. Web Traffic Logs: An Imperfect Resource for Evaluation. In: proceedings of the Ninth Annual Conference of the Internet Society, San Jose, INET, 1999.6, http://www.isoc.org/inet99/proceedings/4n/4n_1.htm
[39] Su Z, Yang Q. Whatnext: A Prediction System for Web Requests Using n-gram Sequence Models. In: proceedings of the First International Conference on Web Information System and Engineering Conference, Hong Kong, WISE, 2000.6, 200-207
[40] Yang Q, Zhang H H, Li T Y. Mining Web Logs for Prediction Models in WWW Caching and Prefetching. In: proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD'01, San Francisco, ACM, 2001.8, 473-478
[41] 朱培栋，卢锡成，周光铭．基于客户行为模式的Web文档预送．软件学报，10(11)，1999．11．1142-1147
[42] Pitkow J, Pirolli P. Mining Longest Repeating Subsequences to Predict World Wide Web Surfing. In: proceedings of the Second USENIX Symposium on Internet Technologies & Systems, Boulder, USENIX, 1999.10, 139-150
[43] Deshpande M, Karypis G. Selective Markov Models for Predicting Web-Page Accesses. ACM Transactions on Internet Technology, 4(2), 2004.2, 163-184
[44] Lei H, Duchamp D. An Analytical Approach to File Prefetching. In: proceedings of USENIX 1997 Annual Technical Conference, Anaheim, USENIX, 1997.1, 275-288
[45] Fan L, Cao P, Jacobson Q. Web Prefetching Between Low-Bandwidth Clients and Proxies: Potential and Performance. In: proceedings of the ACM SIGMETERICS'99, Atlanta, ACM, 1999.5, 178-187
[46] Schechter S, Krishnan M, Smith M D. Using Path Profiles to Predict HTTP Requests. Computer Networks and ISDN Systems, 30(1-7), 1998.1, 457-467
[47] Jiang Z, Kleinrock L. An Adaptive Network Prefetch Scheme. IEEE Journal on Selected Areas in Communications, 16(3), 1998.3, 358-368
[48] Jiang Z, Kleinrock L. Web Prefetching in a Mobile Environment. IEEE Personal Communications, 5(5), 1998.5, 25-34
[49] Jiang Z, Kleinrock L. Prefetching Links on the WWW. In: proceedings of the 1997 IEEE International Conference on Communications, Montreal, IEEE, 1997.6, 483-489
[50] Conhen E, Kristhnamurthy B, Rexford J. Efficient Algorithms for Predicting Requests to Web Servers. In: proceedings of the IEEE INFOCOM'99, New York, IEEE, 1999.3, 284-293
[51] Padmanabhan V N, Mogul J C. Using Predictive Prefetching to Improve World Wide Web Latency. Computer Communication Review, 26(3), 1996.3, 22-36
[52] 徐保文，张卫丰．数据挖掘技术在Web预取中的应用研究．计算机学报，24(4)，2001．4，430-436
[53] Caceres R, Douglis F, Feldmann A, Glass G, et al.. Web proxy caching: the devil is in the details. ACM Performance Evaluation Review, 26(3), 1998.3, 11-15
[54] Duska B M, Marwood D, Feelay M J. The measured access characteristics of World Wide Web client proxy caches. In: proceedings of the First USENIX Symposium on Internet Technologies and Systems, Monterey, 1997.12, 23-35
[55] Otoo E J, Olken F, Shoshani A. Disk cache replacement algorithm for storage resource managers in data grids. In: proceedings of the 2002 ACM/IEEE conference on Supercomputing table of contents, Baltimore, IEEE, 2002.11, 1-15
[56] Davison B D. A web caching primer. IEEE Internet Computing, 5(4), 2001.4, 38-45
[57] Wang J. A survey of web caching schemes for the Internet. ACM Computer Communication Review, 29(5), 1999.5, 36-46
[58] Smaragdakis Y, Kaplan S, Wilson P. The EELRU adaptive replacement algorithm. Performance Evaluation, 53(2), 2003.2, 93-123
[59] Smaragdakis Y, Kaplan S, Wilson P. EELRU: Simple and effective adaptive page replacement. In proceedings of the 1999 ACM SIGMETRICS Conference on the Measurement and Modeling of Computer Systems, Atlanta, 1999.5, 122-133
[60] O'Neil E J, O'Neil P E, Weikum G. The LRU-K page replacement algorithm for database disk buffering. In: proceedings of International Conference on Management of Data, Washington, 1993.5, 297-306
[61] O'Neil E J, O'Neil P E, Weikum G. An optimality proof of the LRU-K page replacement algorithm. Journal of the ACM, 46(1), 1999.1, 92-112
[62] Robinson J T, Devarakonda M V. Data cache management using frequency-based replacement. In: proceedings of the 1990 ACM SIGMETRICS Conference on Measuring and Modeling of Computer Systems, Boulder, 1990.5, 134-142
[63] Breslau L, Cao P, Fan L, et al.. Web caching and Zipf-like distributions: evidence and implications. In: proceedings of the IEEE INFOCOM'99, New York, 1999.3, 126-134
[64] Williams S, Abrams M, Standridge C R, et al.. Removal poiicies in network caches for World-Wide Web documents. In: proceedings of the ACM SIGCOMM, Stanford, 1996.8, 293-304
[65] Abrams M, Standridge C R, Abdulla G, et al.. Caching proxies: limitations and potentials. In: proceedings of the Forth International WWW Conference, Boston, 1995.12, 119-133
[66] Wooster R P, Abrams M. Proxy caching that estimates page load delays. In: proceedings of the Sixth International WWW Conference, Santa Clara, 1997.4, 325-334
[67] Scheuermann P, Shim J, Vingralek R. A case for delay-conscious caching of Web documents. In: proceedings of the Sixth International WWW Conference, Santa Clara, 1997.4, 997-1005
[68] Bolot J C, Hoschka P. Performance engineering of the World-Wide Web: Application to dimensioning and cache design. In: proceedings of the Fifth International WWW Conference, Paris, 1996.5, 185-195
[69] Aggarwal C, Wolf J L, Yu P S. Caching on the World Wide Web. IEEE Transactions on Knowledge and data Engineering, 11(1), 1999.1, 94-107
[70] Martello S, Toth P. Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, New York, London, Sydney, 1990.8, 13-80
[71] Care V. Alex-A GlobaI Filesystem. In: proceedings of the 1992 USENIX File System Workshop, Ann Arbor, USENIX, 1992.5, 1-12
[72] James G, Margo S. World-wide Web cache consistency. In: proceedings of the 1996 USENIX Technical conference, San Diego, USENIX, 1996.1, 141-151
[73] Srinivasan R, Chao L, Ramamritham K. Maintaining Temporal Coherency of Virtual Data Warehouses. In: proceedings of Real-Time Systems Symposium, Madrid, IEEE, 1998.12, 60-70
[74] Satitsamitpong M, Thomas H. Cache freshness optimization: sliding scale guarantees. In: proceedings of Advanced Issues of E-Commerce and Web-Based Information Systems, San Jose, WECWIS, 2001.6, 228-230
[75] Datta A, Dutta K, Thomas H, VanderMeer D, et al.. A proxy-based approach for dynamic content acceleration on the WWW. In: proceedings of Advanced Issues of E-Commerce and Web-Based Information Systems, Newport Beach, WECWIS, 2002.6, 159-164
[76] Yuan C, Hua Z G, Zhang Z. Proxy+: Simple Proxy Augmentation for Dynamic Content Processing. In: proceedings of Web Caching and Distribution, Hawthorne, WCW, 2003.9, http://2003.iwcw.org/papers/yuan.pdf
[77] Alonso R, Barbara D, Garcia-Molina H. Data Caching Issues in an Information Retrieval System. ACM Transactions on Database Systems(TODS), 15(3), 1990.3,359-384
[78] Cao P, Liu C J. Maintaining Strong Cache Consistency in the World-Wide Web. IEEE Transactions on Computers, 47(4), 1998.4, 445-457
[79] Wen SL, Po P, Wang P H, Canda K S, et al.. Freshness-driven adaptive caching for dynamic content. In: proceeding of Database Systems for Advanced Applications, Kyoto, DASFAA, 2003.3, 203-212
[80] Renu T, Thirumale N, Srikanth R. WCDP: A protocol for web cache consistency. In: proceedings of Web Caching and Distribution, Boulder, WCW, 2002.8, http://2002.iwcw.org/papers/18500180.pdf
[81] Cao L. Consistency Control Algorithms for Web Caching. 2001.2, http://db.uwaterloo.ca/～tozsu/courses/cs748t/weekly.html
[82] Brian B, George C. How dynamic is the web? In: proceedings of the Ninth International World Wide Web Conference, IW3C2, 2000.5, http://www9.org/w9cdrom/264/264.html
[83] Brian B, George C. Keeping up with the changing Web. IEEE Computer, 33(5), 2000.5, 52-58
[84] 盛骤，谢式千，潘承毅．概率论与数理统计．第二版．高等教育出版社，1989．8，157-165
[85] Stephens M A. EDF statistics for goodness of fit and some comparisons. Journal of the American Statistical Association, 69(347), 1974.9, 730-737
[86] Coulson G, Williams N, Blair G S. Group presentation of multimedia applications in IXION. Computer Communication, 14(4), 1991.4, 205-215
[87] Gonazález A J, Hussein A W. Audio mixing for interactive multimedia communications. In: proceedings of JCIS'98, North Carolina, 1998.10, 217-220
[88] 杨树堂，余胜生，周敬利．基于分组网络的多点实时语音混合及调度算法．软件学报，12(9)，2001．9，1413-1419
[89] 徐保民，王秀玲．一个改进的混音算法．电子与信息学报，25(12)，2003．12，1709-1713．
[90] 樊星，顾伟康，叶秀清．多媒体会议中的快速实时自适应混音方案研究．软件学报，16(1)，2005．1，108-115
[91] 马旋，王衡，汪国平等．视频会议中混音后溢出问题的研究及解决方法．第13届全国多媒体学术会议论文集，宁波，2004．10，http://graphics.pku.edu.cn/papers/2004.htm
[92] ITU-T. Packet-based multimedia communication system. ITU-T Rec H.323 v4, 2003.7.
[93] 涂卫平，胡瑞敏，艾浩军等．视频会议中音频多点处理器的研究．武汉大学学报信息科学版，27(1)，2002．1，98-101