A modified NaSch model with density-dependent randomization for traffic flow

Based on the Nagel-Schreckenberg (NaSch) model of traffic flow, a modified cellular automaton (CA) traffic model with the density-dependent randomization (abbreviated as the DDR model) is proposed to simulate traffic flow. The fundamental diagram obtained by simulation shows the ability of this modified NaSch model to capture the essential features of traffic flow, e.g., synchronized flow, metastable state, hysteresis and phase separation at higher densities. Comparisons are made between this DDR model and the NaSch model, also between this DDR model and the VDR model. And the underlying mechanism is analyzed. All these results indicate that the presented model is reasonable and more realistic.     

Adaptive quality of service‐based routing approaches: development of neuro‐dynamic state‐dependent reinforcement learning algorithms

In this paper, we propose two adaptive routing algorithms based on reinforcement learning. In the first algorithm, we have used a neural network to approximate the reinforcement signal, allowing the learner to take into account various parameters such as local queue size, for distance estimation. Moreover, each router uses an online learning module to optimize the path in terms of average packet delivery time, by taking into account the waiting queue states of neighbouring routers. In the second algorithm, the exploration of paths is limited to N‐best non‐loop paths in terms of hops number (number of routers in a path), leading to a substantial reduction of convergence time. The performances of the proposed algorithms are evaluated experimentally with OPNET simulator for different levels of traffic's load and compared with standard shortest‐path and Q‐routing algorithms. Our approach proves superior to classical algorithms and is able to route efficiently even when the network load varies in an irregular manner. We also tested our approach on a large network topology to proof its scalability and adaptability. Copyright © 2006 John Wiley & Sons, Ltd.     

一种平滑的可变步长算法

本文从长时相关性(LRD)和突发性两个方面,阐明图像组(GOP)时间尺度上的流量能够体现原有视频帧序列的流量特性。并在固定步长自适应算法(FSSA)和可变步长自适应算法(VSSA)的基础上提出了一种新的平滑的可变步长自适应算法(S-VSSA),这种算法可以在GOP所表示的大时间尺度上预测MPEG-4视频流量。仿真实验结果显示:该算法收敛速度快,预测误差低,可以明显改善预测性能。     

利用NetFlow技术构建网络异常监测及分析系统

随着互联网的不断普及,网络已经跟人们的日常生活密不可分,使用者在享受网络所带来的便利的同时,网络上的许多问题也陆续衍生而出,运营商网络正面临着日益严重的安全威胁.作为网络管理者,如何迅速有效地监测网络异常情况,同时准确地掌握整个网络的业务流量模型,供市场部门作决策分析,已成为一项重要的课题.介绍了利用NetFlow技术,构建网络异常监测及分析系统,利用本系统可随时监测网络运行情况,以达到网络稳定顺畅运作及节省经费、人力的目的.     

NONLOCAL CROWD DYNAMICS MODELS FOR SEVERAL POPULATIONS

This paper develops the basic analytical theory related to some recently introduced crowd dynamics models.Where well posedness was known only locally in time,it is here extended to all of R+.The result...     

Spectral reduction for control systems modeling passive integrated circuits

Linear control systems modeling passive integrated circuits are examined. A new algebraic method of spectral reduction equipped with efficient tools for preserving passivity is proposed and justified. For RC networks (circuits), this method is similar to and can be regarded as an extension of the well-known PACT method, which is based on congruence transforms. Up to now, such an extension seemed to be impossible, and different techniques were used for the reduction of RCL and RCLM networks. Some numerical results are presented.     

An efficient traffic control scheme for store‐and‐forward video‐on‐demand services

According to the MPEG‐1/2 standard, full motion video can be compressed and stored in an information warehouse. Multiplexing with normal voice calls, it is retrieved and delivered to the customer's local BISDN central office via 155 Mb/s trunks. These voice calls have higher priority than video‐on‐demand (VOD) so that normal voice services will not be influenced by VOD transmission. The number of voice calls always fluctuates in real‐time. Thus, an efficient traffic control scheme is highly desired to guarantee a given level of performance and achieve as great as possible use of available bandwidth. Based on the fact that the number of real‐time voice calls is variable, and the use of available capacity is less than 100 per cent, this paper will present an efficient traffic control scheme for store‐and‐forward VOD services, and demonstrate the scheme by various simulation results. Copyright © 2001 John Wiley & Sons, Ltd.     

固定需求下基于概率型随机平衡的交通网络设计模型及算法

在考虑网络中用户的路径选择行为满足概率型随机平衡的条件下，给出了交通网络设计的双层规划模型，同时设计了基于差分的启发式求解算法．     

An extension of Tanner's results on uncontrolled intersections

A delay formula is developed for the problem, analyzed by Tanner in 1962, where two streams of traffic have conflicting demands at an intersection. The situation is such that the major stream has absolute priority and the minor stream vehicles can only enter the intersection when sufficiently large gaps appear in the major stream. This paper extends Tanner's work by considering a generalised stochastic structure on the arrival streams. The paper also links Tanner's work to other papers of this author where the utilitarian value of this generalised model has been established in a wide range of traffic problems.     

Carrier‐sense‐assisted adaptive learning MAC protocols for distributed wireless LANs

A Carrier‐sense‐assisted adaptive learning MAC protocol for wireless LANs, capable of operating efficiently in bursty traffic wireless networks with unreliable channel feedback, is introduced. According to the proposed protocol, the mobile station that is granted permission to transmit is selected by means of learning automata. At each station, the learning automaton takes into account the network feedback information in order to update the choice probability of each mobile station. The proposed protocol utilizes carrier sensing in order to reduce the collisions that are caused by different decisions at the various mobile stations due to the unreliable channel feedback. Simulation results show satisfactory performance of the proposed protocol compared to similar MAC protocols. Copyright © 2005 John Wiley & Sons, Ltd.