Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers

In this article, we present two efficient weighted fair queueing (WFQ) scheduling algorithms leaned on the well-known token bucket and leaky bucket shaping/policing algorithms. The performance of the presented algorithms is compared to those of the state-of-the-art WFQ approximations such as weighted round robin (WRR) and the recently proposed bin sort fair queueing (BSFQ). Our simulation results show that the proposed algorithms provide a better fairness at a lower implementation complexity while simultaneously achieving a comparable network utilization.     

同步令牌通信方式及其扩展应用

本文提出一种新的网络访问方式。它引入了同步时钟和令牌链，使得各点可共享一条通信数据线而访问控制电路却简单到仅用几个Ｄ触发器即可实现。它具有传统令牌方式所没有的一些优点。在通信量较少，速度要求不高的场合，其效果很好。文中讨论的一种应用方式。     

Self-stabilizing depth-first token circulation on networks

Summary This paper proposes a self-stabilizing protocol which circulates a token on a connected network in nondeterministic depth-first-search order, rooted at a special node. Starting with any initial state in which the network may have no token at all or more than one token, the protocol eventually makes the system stabilize in states having exactly one circulating token. With a slight modification to the protocol —by removing nondeterminism in the search — a depth-first-search tree on the network can be constructed. The proposed protocol runs on systems that allow parallel operations. Shing-Tsaan Huang was born in Taiwan on September 4, 1949. He got his Ph.D. degree in 1985 from Department of Computer Science, University of Maryland at College Park. Before he pursued his Ph.D. degree, he had worked several years in the computer industry in Taiwan. Professor Huang is currently the chairman of the Department of Computer Science, Tsing Hua University, Taiwan, Republic of China. His research interests include interconnection networks, operating systems and distributed computing. He is a senior member of the IEEE Computer Society and a member of the Association for Computing Machinery. Nian-Shing Chen was born in Taiwan on October 21, 1961. He received his Ph.D. degree in computer science from National Tsing Hua University in 1990. Dr. Chen is currently an associate professor with the Department of Information Management at Sun Yat-Sen University of Taiwan. His research interests include distributed systems, computer networks, computer viruses and expert systems. He is a member of IEEE and Phi Tau Phi honorary society.This research is supported by National Science Council of the Republic of China under the contract NSC81-0408-E-007-05 and NSC82-0408-E-007-027     

浅谈JBPM技术在工作流系统的应用

本文主要介绍了工作流新兴技术JBPM的内核,并分析了在流程运转过程中JBPM引擎的工作方式。通过对JBPM技术的剖析,总结出了此技术在工作流系统中应用的优点,并对其发展做出了展望。     

接入网MAC层QoS系统的多业务令牌桶流量整形算法

以HFC网络核心设备双向CM(Cable Modem)为研究背景,首先对目前的流量整形算法进行了分析,在HFC网络QoS系统需求的基础之上,提出了一种动态支持多业务整形的令牌桶算法.以美国有线电视实验室的测试用例仿真分析了队列长度对丢包率以及延时的影响.通过性能分析可以看出,该算法满足了多种应用对延时和丢包率的要求,很好地调整了数据的突发速率,有效地进行了流量整形控制.     

基于DCS—MINICOM网络通信系统的在线实时优化控制

对进口集散控制系统(DCS)进行深开发，提高原有装置的控制水平，实现在线优化闭环实时控制是工业界普遍关注的研究课题。在美国ABB公司制造的MOD-300型DCS基础上，选用DEC公司制造的Alapha-3800小型机为控制与通信平台，通过PHENIX接口软件、Apclopt软件包及Setcim数据库构建了与DCS的网络信息交换系统，实现了装置的在线优化控制。以中石化某厂、阜海发电厂为例叙述了主要实施过程：优化目标函数的确定，变量的选取，数学模型的建立，优化算法与生产预报模型的形成过程。     

配电网载波通信与链路接入技术

配电网载波通信 ,充分利用电力线自身资源 ,应用简单、方便 ,然而由于配电网自身的复杂性 ,仅依靠单一的调制解调技术———这一物理层功能 ,很难满足配电自动化系统的需要 ,从局域网的角度看配电载波通信 ,分析链路接入技术 ,指出令牌接入技术是适应配电载波通信的接入技术。     

基于Linux流控机制的QoS网络

对Linux内核中的流控机制进行剖析，以区分服务(DiffServ)模型为侧重点，根据区分服务模型的体系结构，提出了利用Linux流控机制实现加速转发逐跳行为的应用方案。实验表明，该方案适合于QoS网络的构建。     

VBR流令牌桶流量整形的研究

对于可变比特率(VBR)令牌桶流量整形问题,示出令牌桶等待队列长度与丢包率的关系曲线,推导出在保证截止期条件下如何确定令牌桶参数的关系式.针对活动图像工作组(MPEG)视频流模型进行了仿真,仿真结果与理论结果吻合.