ATM交换结构的成组输入排队模型

本文提出一种新的ATM交换排队结构——成组输入排队结构(GIQ),其基本思想是将输入端分组,同一组的输入端共享排队缓存。GIQ不仅能提高缓存的利用率和系统的吞吐率(达到96.2％),而且还能大大改善交换结构的抗突发能力。采用计算机仿真模拟的方法,分析了GIQ在均匀连续业务流和突发业务流下的性能,并与其它输入排队结构的性能进行了比较。     

分组网与ISDN互连的性能分析

本文研究分组交换数据网与ＩＳＤＮ互连的性能分析，文中考虑了分组肉与窄带ＩＳＤＮ和宽带ＩＳＤＮ互连时信关所应完成的功能，分别给出了两种情况下的信关排队模型；在信关存储容量分别为有限和无限的情况下，对两种模型进行了求解，给出了阻塞概率和平均延迟的表达式。对于与Ｂ－ＩＳＤＮ互连的情况，提出了用开关确定性过程来描述输出排队的分组到达流，并提出了一种小时隙方法分析ＳＤＰ／Ｄ／１排队。     

The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

1　IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1～ 2 ] ,andtheotherisforthequalityofservice[3～6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo…     

Improvement on threshold proxy signcryption scheme

Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and integrity at a lower computational and communication cost. This paper presents a （t, n） threshold proxy signcryption scheme in which no less than t proxy agents in the proxy group can produce the signcryption cryptogram. combines the functionality of threshold proxy signing and encryption. The proposed scheme combines the functionality of both threshold proxy signing and encryption, and provides fair protection for the sender and the proxy agents. This scheme is secure against attack of public key substitution. It also satisfies security properties such as confidentiality and authenticity.     

股票期权的会计处理方法研究

经理人股票期权是对管理者实行的长期激励制度，由于我国制度上的缺陷，目前在我国没有统一的处理方法，本文讨论的主要是在国际上股票期权的确认、计量以及在会计报表中披露的会计方法。     

Delivering Improvement from Truth — the Fragile Link Between Analysis and Effective Change

In the history of operations research in industry there has been an abundance of analyses and recommendations produced in millions of man hours by dedicated OR specialists. And yet the net improvement is significantly lower than expected. There are numerous reasons for this shortfall: incomplete analysis, too much theory, incomplete implementation, unreliable recommendations, or a combination of some of these reasons.
By describing several examples, the major reasons for the fragility of the link between recommendation and implementation will be reviewed. What has to be done today to increase the likelihood of implementing an OR recommendation and thus improve the performance of an industrial entity by using the power of OR tools will then be described.     

Optimizing a multiserver queuing system with a variable number of servers

A multiserver Poisson queuing system with losses, with a variable number of servers, and an additive quality functional is investigated. All major characteristic of the system are obtained in an explicit form. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 92–101, July–August 2007.     

ROSA:资源敏感的高性能Web容器体系结构

现有的Web容器多采用线程池体系结构,而Web容器所支撑的动态Web组件在执行过程中可能需要获取多种共享资源,由共享资源并发量限制导致的线程阻塞可能会严重影响性能。提出了一种资源敏感的Web容器体系结构ROSA(resource-oriented staged architecture)。当某些共享资源达到饱和时,若Web容器接到对需要这些资源的Web组件的请求,ROSA会暂缓为这些请求提供服务以减少线程阻塞。基于排队Petri网,建立了ROSA结构和线程池结构的性能模型,通过模型仿真和负载实验验证了ROSA体系结构的性能优势。     

Usable optimistic fair exchange

Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance.     

移动容迟传感网络拓扑覆盖建模与统计特征*

移动容迟传感网络的拓扑覆盖研究对于相关工程系统设计具有重要意义。针对当前研究没有很好地刻画区域动态覆盖特征的问题,提出基于排队网络的建模方法。进而利用随机几何学和排队论方法,以定理形式提出关于二维平面上区域覆盖的首达时间、覆盖度分布等统计特征的理论结果。结合典型移动场景,仿真验证了上述结果的合理性和应用价值。