Utility function of TCP

Understanding the TCP congestion control mechanism from a global optimization point of view is not only important in its own right, but also crucial to the design of other transport layer traffic control protocols with provable properties. In this paper, we derive a global utility function and the corresponding optimal control law, known as TCP control law, which maximizes the global utility. The TCP control law captures the essential behaviors of TCP, including slow start, congestion avoidance, and the binary nature of congestion feedback in TCP. We find that the utility function of TCP is linear in the slow start phase and is proportional to the additive increase rate and approaches the well-known logarithm function as the data rate becomes large in the congestion avoidance phase. We also find that understanding the slow start phase with a fixed threshold is critical to the design of new transport layer control protocols to enable quality of service features. Finally, as an application, we design a Minimum Rate Guaranteed (MRG) traffic control law that shares the same utility function as the TCP control law. Our simulation study of the MRG control law indicates that it is indeed TCP friendly and can provide minimum rate guarantee as long as the percentage of network resource consumed by the MRG flows is moderately small.     

MANET中基于代理的Internet网关发现机制

针对大规模、高动态的移动Ad Hoc网络环境,提出一种基于代理的Internet网关发现机制（PGDIS）。PGDIS从移动节点中自动选举出代理网关,由Internet网关周期性地向代理网关发送网关公告消息。移动节点可以通过最近的代理网关建立通往Internet网关的路由。仿真结果表明,PGDIS在保持较高数据包投递率的前提下降低了传输延时。     

基于函数签名的控制流监控方法

针对恶意篡改程序控制流攻击方式,提出一种监控程序控制流完整性的方法。对程序源代码进行扫描,以函数作为识别程序行为的基本粒子,利用函数调用执行的序列信息,建立表现程序原意的行为轨迹模型,利用该模型在运行期监控程序的执行流程。实验结果表明,该方法对篡改控制流的攻击起到了很好的防御作用。     

基于SIP的安全认证机制的研究及改进

会话初始协议大部分认证机制只提供服务器到客户端的单向认证,HTTP摘要认证就是其中的一种。该文通过分析其过程,找出认证协议中的安全缺陷,给出攻击者可能进行的攻击。针对协议的安全漏洞,提出一种改进的安全机制,在提供服务器和客户端之间相互认证的基础上加入加密保护和完整性保护,以保证消息传输的安全性。     

一种伪随机自治服务可生存调度算法

可生存调度算法是服务可生存性研究中的重要内容,在服务器集群系统中引入随机策略,使服务在各个服务器之间的轮转产生不确定效果,可增加攻击者攻击系统的难度,增强系统可生存性。介绍可生存性研究的层次划分,指出可生存调度算法在可生存性研究中的作用,分析现有可生存调度算法的优缺点,提出一种伪随机自治服务可生存调度算法,并分析算法的性能。     

资源受限网络中高效XML交换的性能评估

为了研究高效XML交换(EXI)在资源受限网络中的使用情况,文中基于传感器观测服务的真实数据,对四种交换模式下的数据大小进行了对比:XML、高效XML、Gzip压缩的XML以及开启压缩模式的高效XML。通过在ns-2中建模,对资源受限网络环境下各交换格式的平均成功率、平均延时、平均能量消耗等性能进行了分析。实验结果表明,无论是否开启压缩模式,高效XML比XML具有更小的体积、更高的成功率、更短的延时和更少的能量消耗。高效XML交换更加适合于资源受限网络。     

模糊系统逼近理论：现状与展望

近年来,各类模糊系统已被证明是万能函数逼 近器,它们能实现任意的非线性连续控制规律和动态模型．本文综述与分析了模糊系统逼近 理论研究的最新成果,并指出了进一步研究工作的方向．     

论室内色彩设计的人性化

人性化的色彩设计理念体现出对使用者的人文精神关怀。本文从色彩的基本特征出发,对室内设计色彩人性化问题加以探讨。以理论和实际相结合的论述手法,探索室内环境人性化色彩设计的方法。人性化是未来室内环境色彩设计的必然趋势。     

A Fast Search Algorithm for a Large Fuzzy Database

In this paper, we propose a fast search algorithm for a large fuzzy database that stores iris codes or data with a similar binary structure. The fuzzy nature of iris codes and their high dimensionality render many modern search algorithms, mainly relying on sorting and hashing, inadequate. The algorithm that is used in all current public deployments of iris recognition is based on a brute force exhaustive search through a database of iris codes, looking for a match that is close enough. Our new technique, Beacon Guided Search (BGS), tackles this problem by dispersing a multitude of ldquobeaconsrdquo in the search space. Despite random bit errors, iris codes from the same eye are more likely to collide with the same beacons than those from different eyes. By counting the number of collisions, BGS shrinks the search range dramatically with a negligible loss of precision. We evaluate this technique using 632,500 iris codes enrolled in the United Arab Emirates (UAE) border control system, showing a substantial improvement in search speed with a negligible loss of accuracy. In addition, we demonstrate that the empirical results match theoretical predictions.