智能动态网络资源分配系统

通过对解决GSM移动通信网络热点区域话务拥塞问题的研究，提出了利用可控功分器实现智能动态网络资源的分配，解决不同种类的话务拥塞问题，并着重讨论了该系统目前的成功运用及前景。     

TCP/IP网络的动态模型描述

拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此，拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前，网络拥塞控制策略主要包括两类：端到端的控制机制，如TCP拥塞控制算法；网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解，这些拥塞控制策略大都基于专家经验，并没有建立完整的理论分析框架。为此，本文从数据流的角度出发，通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型，然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程，建立了TCP/IP网络的动态模型，为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明，该数学模型与NS仿真实验的结果相一致。     

Biham–Middleton–Levine model with four-directional traffic

We study the four-directional traffic flow on a two-dimensional lattice. In the case of discrete densities, we assume equal number of vehicles in each lane. Except for the minimum density, the gridlock emerges swiftly. Two kinds of gridlock have been observed. The global gridlock dominates the system when the density is twice the minimum value. At higher densities, the system is pervaded by local gridlocks. We also analyze the time evolution of average speed. In the case of continuous densities, the vehicle numbers vary from lane to lane. The global gridlock is then destroyed by the fluctuations; while the local gridlock can still be observed.     

TFRC friendliness and the case of ECN

The TFRC protocol has been proposed as a TCP‐friendly protocol to transport streaming media over the Internet. However, its deployment is still questionable because it has not been compared to other important protocols, analysed in the presence of important mechanisms, such as the explicit congestion notification (ECN), and studied under more realistic network conditions. In this paper, we address these three aspects, including other congestion control protocols not considered before in the same investigation, such as TCP Tahoe, Reno, Newreno, Vegas, Sack, GAIMD, and the Binomial algorithms, the effect of using ECN in the friendliness of the protocols, and the fairness of the protocols under static and dynamic network conditions. We found that TFRC can be safely deployed in the Internet if competing with TCP Tahoe, New Reno and SACK since fairness is achieved under all scenarios considered. We also found that ECN actually helps in achieving better fairness. However, fairness problems arise when TFRC competes with TCP Reno, GAIMD, SQRT or IIAD in static or dynamic conditions, or both. We used normalized throughput, fairness index, and convergence time as the main performance metrics for comparison. Copyright © 2004 John Wiley & Sons, Ltd.     

B－ISDN中的拥塞控制技术

Ｂ－ＩＳＤＮ是现代电信网的发展方向，拥塞控制技术则是其中的一个重要问题。由于Ｂ－ＩＳＤＮ采用新的信息传递方式──ＡＴＭ，使传统的拥塞控制方法不再适用。本文依据ＩＴＵ－Ｔ有关建议的最新内容对Ｂ－ＩＳＤＮ拥塞控制的基本思想、工作机制以及其中的主要功能作了较为详细的分析讨论，并提出了一些Ｂ－ＩＳＤＮ拥塞控制技术中尚需进一步研究的问题。     

ATM突发性业务阻塞控制

在ＡＴＭ网里业务阻塞控制是一个十分重要的问题，本文对一种缓冲漏桶业务阻塞控制算法在突发性业务输入情况下的性能进行了计算机模拟分析，模拟结构表明缓冲漏桶算法是一种适合于突发性业务的阻塞控制算法，文章在模拟结果的基础上给出了缓冲漏桶算法中参量选择的算法。     

The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands

By showing that there is an upper bound for the price of anarchyρ(Γ) for a non-atomic congestion game Γ with only separable cost maps and fixed demands, Roughgarden and Tardos show that the cost of forgoing centralized control is mild. This letter shows that there is an upper bound for ρ(Γ) in Γ for fixed demands with symmetric cost maps. It also shows that there is a weaker bound for ρ(Γ) in Γ with elastic demands.     

Two-worker blocking congestion model with walk speed m in a no-passing circular passage system

This paper introduces a blocking model and closed-form expression of two workers traveling with walk speed m (m = integer) in a no-passing circular-passage system of n stations and assuming n = m + 2, 2m + 2, …. We develop a Discrete-Timed Markov Chain (DTMC) model to capture the workers’ changes of walk, pick, and blocked states, and quantify the throughput loss from blocking congestion by deriving a steady state probability in a closed-form expression. We validate the model with a simulation study. Additional simulation comparisons show that the proposed throughput model gives a good approximation of a general-sized system of n stations (i.e., n > 2), a practical walk speed system of real number m (i.e., m ? 1), and a bucket brigade order picking application.     

Fluctuation control for many-to-one routing in wireless sensor networks

This paper presents a distributed and adaptive fluctuation control scheme for many-to-one routing(FCM) in wireless sensor networks.Unlike well-known topology control schemes,the primary design objective is to reduce the fluctuation which happens due to overload of sensors in a data collection tree.More specifically,an estimation model of a sensor available capacity based on the number of its neighbors is proposed.In addition,this paper proposes a parent selection mechanism by three-way handshake.With such model and the selection mechanism,it is ensured that the load of a sensor does not exceed its available capacity.Finally,an adaptive maintenance mechanism is proposed to adjust the estimation of a sensor available capacity as the network environment changes.Simulation results demonstrate the effectiveness of the scheme.     

基于错误矩阵方程的解决城市交通拥堵决策研究

针对解决城市交通拥堵决策问题,首先给出了错误优化矩阵的概念,在此基础上引出错误矩阵方程的概念,利用消错理论中的错误优化矩阵方程,从错误优化的角度来研究并解决城市交通拥堵的决策方法.相应结合实际状况给出当前状态矩阵,从而进行下一步的求解,步步推理获得了决策人满意的方案集,为决策者提供最优建议.