An Access Control Framework for Reflective Middleware

Reflective middleware opens up the implementation details of middleware platform and applications at runtime for improving the adaptability of middleware-based systems. However,such openness brings new challenges to access control of the middleware-based systems. Some users can access the system via reflective entities,which sometimes cannot be protected by access control mechanisms of traditional middleware. To deliver high adaptability securely,reflective middleware should be equipped with proper access control mechanisms for potential access control holes induced by reflection. One reason of integrating these mechanisms in reflective middleware is that one goal of reflective middleware is to equip applications with reflection capabilities as transparent as possible. This paper studies how to design a reflective J2EE middleware - PKUAS with access control in mind. At first,a computation model of reflective system is built to identify all possible access control points induced by reflection. Then a set of access control mechanisms,including the wrapper of MBeans and a hierarchy of Java class loaders,are equipped for controlling the identified access control points. These mechanisms together with J2EE access control mechanism form the access control framework for PKUAS. The paper evaluates the security and the performance overheads of the framework in quality and quantity.     

Real-time Design Constraints in Implementing Active Vibration Control Algorithms

Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorithm so as to exploit special features of the hardware and avoid associated architecture shortcomings. This paper presents an investigation into the analysis and design mechanisms that will lead to reduction in the execution time in implementing real-time control algorithms. The proposed mechanisms are exemplified by means of one algorithm, which demonstrates their applicability to real-time applications. An active vibration control (AVC) algorithm for a flexible beam system simulated using the finite difference (FD) method is considered to demonstrate the effectiveness of the proposed methods. A comparative performance evaluation of the proposed design mechanisms is presented and discussed through a set of experiments.     

A new fast friendly window-based congestion control for real-time streaming media transmission

1 Introduction In the current Internet, not all applications use TCP and they do not follow the same concept of fairly sharing the available bandwidth. The rapid growing of real-time streaming media applications will bring much UDP traffic without integrating TCP compatible congestion control mechanism into Internet. It threats the quality of service (QoS) of real-time applications and the stability of the current Internet. For this reason, it is desirable to define appropriate rate rule…     

A non-blocking locking method and performance evaluation on network of workstations

A network of workstation(NOW) can act as a single and scalable powerful computer by building a paralle and distributed computing platform on top of it.WAKASHI is such a platform system that supports persitent object management and makes full use of resources of NOW for high perforance transaction processing,One of the main difficulties to overcome is the bottleneck caused by concurrency control mechanism.Therefore,a non-bloking locking method is designed,by adopting several novel techniques to make it outperform the other typical locking methods such as 2PL:1) an SDG (Semantic Dependency Graph)based non-blocking locking protocol for fast transaction scheduling;2) a nmassively virtual memory based backup-page undo algorithm for fast restart;and 3) a multi-processor and multi-thread based transaction manager for fast execution.The new mechanisms have been implemented in WAKASHI and the performance comparison experiments have been implemented in WAKASHI and the performance comparison experiments with 2PL and DWDL have been done.The results show that the new method can outperform 2PL and DWDL under certain conditons.This is meaningful for choosing effective concurrency control mechanisms for improving transaction-rpocessing performance in NOW environments.     

面向Internet的流媒体组播技术

The multicast of Streaming Media over the Internet is an important component of many current and future Internet applications.The heterogeneity and lacking of QoS guarantee make the application of this technique a challenge.In this paper,we analyze the difficulties in streaming media multicast design,survey technologies that have been proposed for it.We also discuss several congestion control and error control mechanisms.Finally we present some remained issues for further research.     

Methods for controlling the authenticity of textual information transfer on the basis of statistical and structural redundancy

In this paper,the problem of increasing information transfer authenticity is formulated.And to reach a decision,the control methods and algorithms based on the use of statistical and structural information redundancy are presented.It is assumed that the controllable information is submitted as the text element images and it contains redundancy,caused by statistical relations and non-uniformity probability distribution of the transmitted data.The use of statistical redundancy allows to develop the adaptive rules of the authenticity control which take into account non-stationarity properties of image data while transferring the information.The structural redundancy peculiar to the container of image in a data transfer package is used for developing new rules to control the information authenticity on the basis of pattern recognition mechanisms.The techniques offered in this work are used to estimate the authenticity in structure of data transfer packages.The results of comparative analysis for developed methods and algorithms show that their parameters of efficiency are increased by criterion of probability of undetected mistakes,labour input and cost of realization.     

A rate-based flow control mechanism for avoiding congestion

The rate-based flow control mechanisms for the Available Bit Rate(ABR)service are used to share the available badwidth of a bottleneck switch connected to a bottleneck link fairly and reasonably among many competitive users,and to maintain the buffer queue length of the witch at a desired level in order to avoid congestion in Asynchronous Transfer Mode(ATM)networks.In this Paper,a control theoretic approach that uses a Deadbeat-Response(DR) controller to the desing of a rate-based flow control mechanism is presented.The mehanism has a simple structure and is robust in the sense that its stability is not sensitive to the change of the number of active Virtual Connections(VCs),Simulation results show that this mechanism not only ensures fair share of the bandwidth for all active VCs regardless of the nmuber of hops they traverse but also has the advantages of fast convergence ,no oscillation,and high link bandwidth utilization.     

Differential Evolution with Adaptive Mutation and Parameter Control Using Lévy Probability Distribution

Differential evolution (DE) has become a very popular and effective global optimization algorithm in the area of evolutionary computation. In spite of many advantages such as conceptual simplicity, high efficiency and ease of use, DE has two main components, i.e., mutation scheme and parameter control, which significantly influence its performance. In this paper we intend to improve the performance of DE by using carefully considered strategies for both of the two components. We first design an adaptive mutation scheme, which adaptively makes use of the bias of superior individuals when generating new solutions. Although introducing such a bias is not a new idea, existing methods often use heuristic rules to control the bias. They can hardly maintain the appropriate balance between exploration and exploitation during the search process, because the preferred bias is often problem and evolution-stage dependent. Instead of using any fixed rule, a novel strategy is adopted in the new adaptive mutation scheme to adjust the bias dynamically based on the identified local fitness landscape captured by the current population. As for the other component, i.e., parameter control, we propose a mechanism by using the Lvy probability distribution to adaptively control the scale factor F of DE. For every mutation in each generation, an F i is produced from one of four different Lvy distributions according to their historical performance. With the adaptive mutation scheme and parameter control using Lvy distribution as the main components, we present a new DE variant called Lvy DE (LDE). Experimental studies were carried out on a broad range of benchmark functions in global numerical optimization. The results show that LDE is very competitive, and both of the two main components have contributed to its overall performance. The scalability of LDE is also discussed by conducting experiments on some selected benchmark functions with dimensions from 30 to 200.     

Web应用服务器可扩展名字服务的设计和实现

Web application server provides the environment for transactional applications with a series of services(e. g. transaction, message, component container, etc. ). Naming services provide a means for application to locate objects and act as essential support in application server. However, users may use various naming service implementations in their applications, so Web application server needs to support multiple naming systems in a flexible way. With analyzing the naming requirements of application server, this paper presents a naming service mechanism that supports multiple naming systems in application server, which based on JNDI and JMX technologies.The implementation of the mechanism in WebFrame application server is introduced. The mechanism has good manageability and openness and extensibility, and satisfies the requirements of Web application server.     

Output constrained IMC controllers in control systems of electromechanical actuators

Electromechanical actuators are widely used in many industrial applications. There are usually some constraints existing in a designed system. This paper proposes a simple method to design constrained controllers for electromechanical actuators. The controllers merge the ideas exploited in internal model control and model predictive control. They are designed using the standard control system structure with unity negative feedback. The structure of the controllers is relatively simple as well as the design process. The output constraint handling mechanism is based on prediction of the control plant behavior many time steps ahead. The mechanism increases control performance and safety of the control plant. The benefits offered by the proposed controllers have been demonstrated in real-life experiments carried out in control systems of two electromechanical actuators: a DC motor and an electrohydraulic actuator.     

基于改进BBR的数据报拥塞控制协议

数据报拥塞控制协议(Datagram Congestion Control Protocol,DCCP)是提供拥塞控制和不可靠传输特点的实时多媒体基础协议,DCCP中的CCID2算法仍然采用AIMD的控制机制,这种传统的Loss-Base拥塞控制模型已经不适用于目前高BDP的网络环境,容易引起缓冲区膨胀现象,导致网络延迟增加和抖动等问题.与Loss-Base的算法相比,BBR算法可以有效地控制网络延时,最大限度避免网络排队的情况,在丢包率较高的情况下仍可以保持一定的带宽利用率和较低的链路延时,因此适合于DCCP实时流媒体的应用的协议.本文在DCCP中引入了BBR算法并做相应的改进,增加了丢包率检测模型,使用延时与带宽积模型的拥塞控制算法对上述问题进行改进.通过模拟实验证明,本方法在高负载情况下连接的平均延迟相比CCID2降低了20%,在丢包率较高的环境下也能保持良好的吞吐量.     

数据报拥塞控制协议（DCCP）研究

1.引言众所周知,网络的视频/音频服务在飞速发展中,但是流媒体的质量却不高。应用的开发者们想尽办法来提供尽可能平稳的流媒体服务,他们的解决方案大部分基于TCP和UDP协议。TCP协议可以提供可靠的端到端的传输控制,但是它的传输速率抖动大,而流媒体并不需要完全可靠的传输;UDP协议简单实用,但是不提供拥塞控制,不能和TCP友好共存,容易引起网络的拥塞。研究者们在分析了问题和比较了     

Unreliable transport protocol using congestion control for high-speed networks

Currently there is no control for the real-time traffic of multimedia applications using UDP (User Datagram Protocol) in high-speed networks. Therefore, although a number of high-speed TCP (Transmission Control Protocol) protocols have been developed for gigabit-speed (or faster) links, the real-time traffic could also congest the network and result in unfairness and throughput degradation of TCP traffic. In this paper, a new unreliable transport protocol, FAST DCCP, is presented for the real-time traffic in high-speed networks. FAST DCCP is based on the DCCP protocol and adopts the FAST scheme to realize congestion control. Some modifications have been made to the mechanisms inherited from DCCP so as to let the proposed protocol can efficiently operate under a large size window. In addition, an enhanced protocol, EEFAST DCCP, using the measurements of one-way delay to dynamically adjust the window size is also proposed to improve the throughput of FAST DCCP with the effect of reverse traffic. Simulation results show that FAST DCCP not only can satisfy the requirements of real-time data delivery, but also perform well in bandwidth utilization and fairness in high-speed networks. Meanwhile, EEFAST DCCP is able to effectively conquer the throughput degradation caused by the reverse traffic.     

DCCP partial reliability extension with sequence number compensation

Datagram congestion control protocol (DCCP), possessing congestion control and unreliable transmission, specially suits real-time multimedia applications. Nevertheless, losses of key packets will cause a substantial decline on quality of services (QoS) in some applications. This paper proposes a DCCP partial reliability extension (PR-DCCP) that can retransmit lost packets as needed. Since DCCP uses an incremental sequence number, the retransmitted packets cannot utilize their original sequence number. To solve this problem, PR-DCCP adopts sequence number compensation, which appends an offset to the retransmitted packet; thus the receiver can use the sequence number of this retransmitted packet and the attached offset so as to re-obtain the original sequence number. The simulation uses two performance metrics: decodable frame ratio (DFR) representing QoS, and useless data received ratio (UDRR) representing the bandwidth waste. These are used to evaluate different transport protocols, namely, PR-DCCP, DCCP, SCTP, TCP, and UDP. Simulation results show that PR-DCCP has the better DFR and UDRR than other transport protocols in almost all cases. For various movies, a DFR of PR-DCCP is 1.2–12.4% higher than that of DCCP; while UDRR is lower by 73.2–85.1%. Furthermore, two reliability policies to determine which packets require reliability are investigated. Finally, the comparisons between PR-DCCP and PR-SCTP are examined.     

DCCP: Transport Protocol with Congestion Control and Unreliability

The Datagram Congestion Control Protocol (DCCP) is a new transport protocol standard that the IETF recently proposed. Because DCCP simultaneously features congestion control and unreliable transmission, it's especially suited to multimedia streaming applications and has thus received much attention. This article introduces DCCP's main characteristics and operation.     

基于带宽充分利用的TCP友好拥塞控制机制

当基于TCP的应用和基于UDP的应用共享网络时，由于UDP协议没有拥塞控制机制，为了防止基于UDP的应用占尽所有的带宽，UDP应该具有TCP友好性(TCP_friendly)。提出一种机制以解决该问题。在保证UDP数据流的发送速率不大于TCP数据流的发送速率的基础上，利用剩余可用的带宽发送best_efort数据流，在网关采用改进的支持包标记处理的RED(随机早期检测)队列管理机制对不同流量进行相应的处理。     

TCP／IP拥塞控制研究

综述了Internet上TCP／IP拥塞控制研究方面一些最新的工作,分析了拥塞控制的原理、TCP／IP拥塞控制所使用的典型技术,并着重论述了TCP／IP拥塞控制所面临的问题,这包括自相似性问题、效率问题、公平性问题、算法改进、区分服务和多点广播中拥塞控制和TCP／IP在特殊网络（ATM网和卫星网）上拥塞控制等问题,并提出了其进一步的研究方向。     

Research into two source-based control algorithms for Internet traffic flows

TCP and UDP are the major applications over the Internet, the characteristics of them lead to different network transmission behaviors. Two source-based mechanisms are proposed in this paper to regulate TCP and UDP flows. One is the congestion control mechanism, which uses TCP flows’ congestion signal to regulate the flows at the source node. The other is the time slot mechanism, which is a time-sharing application to control their flow transmission. Based on the priorities of flows, different bandwidth proportions are allocated and differential services are provided for flows. Several scenarios are simulated to observe the transmission operations of these two mechanisms. Simulation results show some insights into two mechanisms. Moreover, the several simulation parameters that may impact the performance of these two mechanisms are summarized.     

Configurable active multicast congestion control

A multicast congestion control and avoidance scheme is indispensable for group-based applications to fairly share and efficiently use network resources with unicast applications and maintain the stability of the Internet. It is difficult for the traditional pure “end-to-end” solution to address both TCP-friendliness and inter-receiver fairness [T. Jiang, M.H. Ammar, E.W. Zegura, Inter-receiver fairness: a novel performance measure for multicast ABR sessions, in: Proceedings of ACM SIGMETRICS’98; T. Jiang, E.W. Zegura, M. Ammar, Inter-receiver fair multicast communication over the Internet, in: Proceedings of NOSSDAV’99] by using only one multicast group. In this paper, we present a novel active multicast congestion control scheme (AMCC). Significantly different from the popular end-to-end congestion control approach, AMCC is a router-assisted window-based hierarchical one. With flexible configuration of parameters and effective use of network resources such as buffers at the active routers, AMCC cannot only behave as a TCP-friendly single-rate congestion control scheme, but also have the benefits of a multi-rate congestion control scheme to achieve inter-receiver fairness by limiting the effect of congestion on a specific link to a small region. In addition, when it is used with reliable multicast applications, AMCC has the special mechanisms to regulate repair packets, which are not specifically addressed by the previous work. We implement and evaluate our protocol in NS2 [http://www.isi.edu/nsnam/ns/].     

ANLMCC--一种基于主动网的分层多播拥塞控制方案

多媒体多播应用在Internet上的广泛部署对多播拥塞控制提出了要求．分层多播是适应网络异构性较有效的方案．针对现有分层多播大多存在拥塞响应延时大、吞吐率抖动剧烈和不满足TCP友好的问题。提出一种新的基于主动网的分层多播拥塞控制方案(ANLMCC),利用主动网灵活的服务定制能力,采用主动标记分层、优先级分层过滤,以及主动节点间逐跳的交互信令机制,大大改进了分层多播的性能．仿真实验表明,ANLMCC具有较快的拥塞响应速度、较好的稳定性和TCP友好的优点．