Performance of in-call buffer/window allocation schemes for short intermittent file transfers over broadband packet networks

While static open loop rate controls may be adequate for handling continuous bit rate (CBR) traffic, relatively smooth data traffic, and relatively low speed bursty data traffic over broadband integrated networks, high speed bursty data sources need more dynamic controls. Burst level resource allocation is one such dynamic control. Potential benefits and other issues for burst level resource parameter negotiations for bursty data traffic over high speed wide area packet networks have been discussed earlier.^1–6 A detailed analysis of an adaptive buffer/window negotiation scheme for long file transfers using these concepts is presented in Reference 1. In this paper we discuss two burst level buffer/window negotiation schemes for short intermittent file transfers, focusing on the specific needs of such traffic streams. We develop closed network of queues models to reflect the behaviour of the proposed schemes. These models, while being simple, capture essential details of the control schemes. Under fairly general assumptions, the resulting network of queues is of product form and can be analysed using the mean value analysis. We use such an analysis to compare the proposed schemes and to determine appropriate sizes of trunk buffers to achieve the desired balance between bandwidth utilization and file transfer delay. The effects of other parameters on the performance of these schemes as well as on the buffer sizing rules are also discussed. Burst level (in-call) parameter negotiation may be carried out by the end system with the network elements or by an interface system (access controller) with the broadband network elements. We discuss implications of this location as well as the needed protocol features. Finally, the service discrimination capabilities desired at the trunk controllers in switching nodes are briefly discussed.     

浅谈机械化施工的组织管理与设备调配

结合公路机械化施工的意义和作用，介绍了施工机械调配的基本要求，阐述了机械设备的运行规律及其调配原则，提出了主导机械的调配方法及相关注意事项。     

3G中的QoS结构及无线资源分配策略

在3G（第3代移动通信系统）中，为了给不同类型的业务提供不同级别的端到端QoS，网络资源必须进行合理分配。QoS和资源分配是密不可分的，而无线资源分配显得尤为重要。文中提出了UMTS的QoS结构，分3部分对空中接口部分的QoS（即无线资源分配策略问题）进行了讨论：首先提出了一种RRA算法，接着讨论了W－CDMA和TD－CDMA系统的无线资源分配问题，最后讨论了下行链路及上行链路的呼叫允许控制（CAC）。     

Model checker aided design of a controller for a wafer scanner

For a case-study of a wafer scanner from the semiconductor industry it is shown how model checking techniques can be used to compute (1) a simple yet optimal deadlock avoidance policy, and (2) an infinite schedule that optimizes throughput. in the absence of errors. Deadlock avoidance is studied based on a simple finite state model using Smv, and for throughput analysis a more detailed timed automaton model has been constructed and analyzed using the Uppaal tool. The Smv and Uppaal models are formally related through the notion of a stuttering bisimulation. The results were obtained within 2 weeks, which confirms once more that model checking techniques may help to improve the design process of realistic, industrial systems. Methodologically, the case study is interesting since two models were used to obtain results that could not have been obtained using only a single model. Supported by the European Community Project IST-2001-35304 (Ametist), http://ametist.cs.utwente.nl/.     

石家庄市CATV系统网络技术指标分配初探

在ＣＡＴＶ系统网络工程设计中，技术指标的分配产关键问题。本文介绍了石家庄市在系统设计时采用的符合实际的设计程序，并对系统前端，传输及用户网各部分技术指标的确定，计算与分配方法，指标的核算等作了较详细地阐述，以供同行参考。     

黄河水市场的建立与水资源的优化配置

1987年国务院批准了黄河可供水理分配方案，1994年黄河水利委员会又向沿黄省（区）颁发了《取水许可证》。随着流域社会经济的发展，黄河水资源供需矛盾愈加突出。目前黄河水资源管理调度体制还存在政府指令配水严重失控、没有引入激励补偿机制、同比例丰增枯减的原则不利于水资源优化配置等问题。在黄河上建立水市场符合市场经济规律，可以促进节水，提高水资源的利用率，改善生态环境，有利于水资源的高效配置和合理利用。     

南水北调中线总干渠水头优化分配

南水北调中线总干渠渠道线路长,建筑物数量大、类型多,进行水头优化分配对于节省工程投资,合理的进行总干渠工程布置有着重要的意义.通过优化计算,提出了总干渠水头优化分配方案,确定了3个渠段之间的水头分配值以及各段内分段渠道和各个建筑物的水头分配值,并对方案进行了验证.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

Assessing the relative priority of projects

Where there are a large number of projects competing for a limited pool of resources, projects have to be assigned priorities to determine which should proceed and which should be curtailed. The traditional economic procedures for assessing the relative priority of projects are reviewed, and alternative methods of ranking projects are suggested, with particular emphasis on methods that are inexpensive and easy to use.