Tele-Network Design Based on Queue Competition Algorithm

In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliability of the mini-way and that of the whole system. Then we do algebra unintersection of the mini-way, deriving a function of reliability of tele-network. Also, we got a function of the cost of tele-network after analyzing the cost of arcs and points. Finally, we give a mathematical model to design a tele-network. For the algorithm, we define the distance of a network and adjacent area within certain boundaries . We present a new algorithm--Queue Competition Algorithm (QCA) based on the adjacent area . The QCA correlates sequence of fitnesses in their father-generations with hunting zone of mutation and the number of individuals generated by mutation, making the stronger fitness in a small zone converge at a local extreme value, but the weaker one takes the advantage of lots of individuals and a big zone to hunt a new local extreme value. In this way, we get the overall extreme value. Numerical simulation shows that we can get the efficient hunting and exact solution by using QCA. The QCA efficient hunting and exact solution.

Research of improving the dynamic scheduling algorithm in the CAN bus control networks

Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.

Study on Agent Based Methods for Concurrency Control in CSCW

Concurrency control is a critical technology and one of the problems in CSCW systems. With the development of agent based technology, it has also been applied to research and development of CSCW systems. An Agent based method for concurrency control in CSCW is explored in this paper. This new way is achieved by making use of the thoughts of AOP (Agent Oriented Programming) to improve traditional locking method, on the basis of researching characteristics and functional requirements of concurrency control in CSCW, and analyzing various usually used concurrency control methods. All amendments to locking method are done on the basis of the analysis of limitations brought by locking. In this paper, a new algorithm supporting queue of locking request for Agent based concurrency control is also presented. All above aspects are discussed in some detail in this paper.

AN ALGORITHM PROPOSED FOR BUSY-PERIOD SUBCOMPONENT ANALYSIS OF BULK QUEUES

This paper presents an algorthmic procedure for a busy-period subcomponent analysis of bulkqueues. A component of interest for many server queues is the period tto reduce congestion froma level k to level k-1. For an M(x)/M/c system with the possibility of total or partial rejection ofbatches, it is demonstrated that the expected length of busy periods, the proportion of delayed batchand the steady state queue length probabilities can be easily obtained. The procedure is based on thenested partial sums and monotonic properties of expected lengths of the busy periods.