弹性分组环业务队长的分析

弹性分组环(ResilientPacketRing,RPR)是刚被IEEE802.17标准化,主要用于城域网的新型MAC层协议,也是宽带IP光城域网技术的重要发展方向。RPR在结构上从属寄存器插入环,其缓存大小的设置对性能的影响很大。目前RPR缓存大小的设置主要借鉴Ethernet、ATM等其它网络的实际应用时经验或仿真结果,尚缺乏理论方面的研究。基于排队论,该文对RPR各缓存里业务的队长及其和吞吐量、节点数目的关系进行研究。所得结果和IEEE802.17所推荐的数值相近;同时还得到一个结论并值得关注:和目前RPR资料文献里的结论不同,理论推导结果表明,队长基本都不是随节点数目成线性关系的。     

自相似网络环境中GPS性能分析

论文对自相似网络环境中通用处理器共享(GeneralizedProcessorSharing,GPS)系统的性能进行分析研究,使用分形漏桶的包络轨迹曲线对进入GPS系统的自相似流整形,给出了利用自相似流量作为输入流的GPS系统的队列长度和时延的上界。数值分析显示,该模型具有较好的性能。     

基于ASP.NET的高校研究生教务管理系统

为提高浙江师范大学研究生教务管理效率,在基于ASP.NET技术的基础上,结合该校研究生教务管理的实际需求,设计了一种网络化的高校研究生教务管理系统。该系统集学生缴费注册、综合教务管理以及教师资格审核等功能于一体,既提高了教务工作效率,又加强了教务管理水平。     

An approximate MVA algorithm for exponential, class-dependent multiple servers

Mean value analysis (MVA) is an efficient algorithm for determining the mean sojourn time, the mean queue length, and the throughput in a closed multiclass queueing network. It provides exact results for the class of product-form networks. Often different classes have different service requirements in FCFS queues, but such networks are not of product form. There are several possibilities to compute performance measure for such nodes and networks. In this paper we present an approximation formula for multiple-server FCFS queues with class-dependent service times as a Norton flow equivalent product node, where the departure rate of any class depends on the number of customers of all classes in the queue. We will use this approximation in the sojourn time formula of some exact and approximate MVA algorithms.     

Modeling traffic operations at electronic toll collection and traffic management systems

Automatic Vehicle Identification (AVI) technology is one possible solution to traffic congestion at existing transportation facilities. This paper presents a mathematical model of traffic conditions for toll plaza facilities that includes AVI toll collection services among other conventional services.

Three types of services are available: manual toll service, in which transactions are handled by a toll collector, automatic toll service, in which coin machines are utilized, and AVI toll collection service. In addition, mixed lanes, which provide more than one of the above services, are considered by the model.

For a given rush hour, queue lengths and delays can be calculated for different toll plaza configurations. Comparison of their performance may aid operators in the management of the lane configurations until all users of the facility become AVI patrons.     

Internet路由器中的拥塞控制策略

近年来 ,Internet变的日益繁忙 ,为了减轻当前 Internet的拥塞程度 ,路由器中就必须采取某种有效的拥塞避免 /控制策略 .本文分析了三种拥塞避免 /控制方案 ,并比较了它们的优缺点     

Performance of the MAP/G/1 Queue Under the Dyadic Control of Workload and Server Idleness

This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic control of the D-policy and multiple server vacations. We derive the probability generating function of the queue length and the mean queue length. We then present computational experiences and compare the MAP queue with the Poisson queue.

基于C#的准考证打印系统的设计与实现

本文阐述了在.NET环球下Windows应用程序模式的准考证打印系统同时转述了用C#语言调用Excel表中的数据,将数据添加到指定格式的准考证报表中并打印出来.     

信号扩散算法在计算机硬件仿真实验系统中的实现

为了更加有效的管理在计算机硬件仿真实验系统中的信号扩散,本文提出了一种信号扩散算法。算法在实验准备阶段将实验逻辑图转化成为图结构存储,并计算出各器件的信号处理代价;在实验运行期间,利用优先级队列的调度器件的启动顺序,从而动态规划信号的扩散次序。算法的时间复杂度理论分析及对比实验均证明,该算法有效减少了信号在器件中的无效重复扩散,降低了器件工作函数的启动次数,使信号扩散时的时间复杂度得到了极大的改善,大幅提高了实验的响应速度并降低了对系统资源的占用。     

Spatial queueing for analysis, design and dimensioning of Picocell networks with mobile users

In this work, we characterize the performance of Picocell networks in the presence of moving users. We model various traffic types between base-stations and mobiles as different types of queues. We derive explicit expressions for expected waiting time, service time and drop/block probabilities for both fixed as well as random velocity of mobiles. We obtain (approximate) closed form expressions for optimal cell size when the velocity variations of the mobiles is small for both non-elastic as well as elastic traffic. We conclude from the study that, if the expected call duration is long enough, the optimal cell size depends mainly on the velocity profile of the mobiles, its mean and variance. It is independent of the traffic type or duration of the calls. Further, for any fixed power of transmission, there exists a maximum velocity beyond which successful communication is not possible. This maximum possible velocity increases with the power of transmission. Also, for any given power, the optimal cell size increases when either the mean or the variance of the mobile velocity increases.