Optimized QoS Routing Algorithm

QoS routing is one of the key technologies for providing guaranteed service in IP networks. The paper focuses on the optimization problem for bandwidth constrained QoS routing, and proposes an optimal algorithm based on the global optimization of path bandwidth and hop counts. The main goal of the algorithm is to minimize the consumption of network resource, and at the same time to minimize the network congestion caused by irrational path selection. The simulation results show that our algorithm has lower call blocking rate and higher throughput than traditional algorithms.     

A Decision Support Method for Truck Scheduling and Storage Allocation Problem at Container

Truck scheduling and storage allocation, as two separate subproblems in port operations, have been deeply studied in past decades. However, from the operational point of view, they are highly interdependent. Storage allocation for import containers has to balance the travel time and queuing time of each container in yard. This paper proposed an integer programming model handling these two problems as a whole. The objective of this model is to reduce congestion and waiting time of container trucks in the terminal so as to decrease the makespan of discharging containers. Due to the inherent complexity of the prob-lem, a genetic algorithm and a greedy heuristic algorithm are designed to attain near optimal solutions. It shows that the heuristic algorithm can achieve the optimal solution for small-scale problems. The solutions of small-and large-scale problems obtained from the heuristic algorithm are better than those from the genetic algorithm.     

An efficient parallel algorithm for shortest paths in planar layered digraphs

This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.     

A new self-adapting admission control algorithm for differential service in Web clusters

A new admission control algorithm considering the network self-similar access characteristics is proposed. Taking advantage of the mathematical model of the network traffic admission control which can effectively overcome the self-similar characteristics of tile network requests, through the scheduling of the differential service queue based on priority while at the same time taking into account various factors including access characteristics of requests, load information, etc. smoothness of the admission control is ensured by the algorlthm proposed in this paper. We design a non-linear self-adapting control algorithm by introducing an exponential admission function, thus overcomes the negative aspects introduced by static threshold parameters. Simulation results show that the scheme proposed in this paper can effectively improve the resource utilization of the clusters, while at the same time protecting the service with high priority. Our simulation resuhs also show that this algorithm can improve system stability and reliability too.     

Obtain the optimal of logistics delivery network with annealing algorithm

Simulated annealing （SA） algorithm is a heuristic algorithm, proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The al- gorithm is superior to the traditional greedy algorithm, which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path, etc in the logistics and distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest, best, most economi- cal, and so on. The paper uses an example of SA algorithm validation to verify it, and the method is proved to be feasible.     

Structural Fault Tolerance of Scale-Free Networks

The fault tolerance of scale-free networks is examined in this paper. Through the simulation on the changes of the average path length and network fragmentation of the Barabasi-Albert model when faults happen, it can be observed that generic scale-free networks are quite robust to random failures, but are very vulnerable to targeted attacks at the same time. Therefore, an existing optimization strategy for the robustness of scale-free networks to failures and attacks is also introduced. The simulation similar with the above proved that the so-called (1,0) network has potentially interconnectedness closer to that of a scale-free network and robustness to targeted attacks closer to that of an exponential network. Furthermore,its resistance to random failures is better than that of either of them.     

A Network-Attached Storage System Supporting Guaranteed QoS

We propose a network-attached storage system that can support guaranteed Quality of Service （QoS）, called POPNet Storage. The special policy of date access and disk scheduling is enable users to access files quickly and directly with guaranteed QoS in the POPNet Storage. The POPNet Storage implements a measurement-based admission control algorithm （PSMBAC） to determine whether to admit a new data access request stream and admit as many requests as possible while meeting the QoS guarantees to its clients. The data reconstruction algorithms in the POPNet Storage also put more emphasis on data availability and guaranteed QoS, thus it is designed to complete the data recovery as soon as possible and at the same time provide the guaranteed QoS for high-priority data access. The experiment results show that the POPNet Storage can provide more significant performance, reliability, and guaranteed QoS than conventional storage systems.     

Optimal Restoration Scheduling of Damaged Networks Under Uncertain Environment by Using Improved Genetic Algorithm

The purpose of this research is to propose an early restoration for lifeline systems after earthquake disasters. The previous researches show that the optimization of the restoration schedule by using genetic algorithm (GA) is powerful. However, those are not considering the uncertain environment after earthquake disasters. The circumstances of the damage at devastated areas are very changeable due to the aftershock, fire disaster and bad weather. In addition, the restoring works may delay by unexpected accidents. Therefore, it is necessary to obtain the restoration schedule which has robustness, because the actual restoring works could not progress smoothly under the uncertain environment. GA considering uncertainty (GACU) can treat various uncertainties involved, but it is difficult to obtain the robust schedule. In this study, an attempt is made to develop a decision support system of the optimal restoration scheduling by using the improved GACU.     

Backtracking Routing Mechanism for Improving Link Failure Recovery

Failure-insensitive routing is a good mechanism to avoid packet dropping and disconnection of forwarding when some links fail,but multiple failure links may bring routing loop for the mechanism. Backtracking routing algorithm based on inverse shortest path tree rooted at destination is presented. The feasible restoration routing is obtained through searching from the start of the failure link and tracing back to the leaves of the shortest path tree with the destination as the root. The packets are forwarded from the mounted point with smaller sequence to the mount point with bigger sequence to decrease the possible of loop in case of multi-failures. The simulations and analysis indicate that backtracking routing algorithm improves the network survivability especially for large network,at the cost of the computation complexity in the same order as failure insensitive routing.     

TSHOVER:A Novel Coding Scheme for Tolerating Triple Disk Failures in RAID/DRAID

This paper presents a novel method, called TSHOVER, for tolerating up to triple disk failures in RAID/DRAID architectures or others reliable storage systems. TSHOVER is two-dimensional code, which employs horizontal code and vertical code at the same time with simple exclusive-OR (XOR) computations. This paper shows the new step ascending concepts used in encoding, and it has the capability of realizing fault tolerance. TSHOVER has better data recovery ability to those disk network storage systems with relatively more dynamic changes in the number of disks. Compared with RS and STAR code, TSHOVER has better encoding performance. When updating a data strip, only 6 XOR operations are needed. Both experimental results and theoretical analyses show that TSHOVER has better performance and higher efficiency than other algorithms.     

Double-Talk Detection Algorithm Based on the Ι2 Norm

Echo canceller generally needs a double-talk detector which is used to keep the adaptive filter from diverging in the appearance of near-end speech. In this paper we adopt a new double-talk detection algorithm based on ι2 norm to detect the existence of near-end speech in an acoustic echo canceller. We analyze this algorithm from the point of view of functional analysis and point out that the proposed double-talk detection algorithm has the same performance as the classic one in a finite Banach space. The remarkable feature of this algorithm is its higher accuracy and better computation complexity. The fine properties of this algorithm are confirmed by computer simulation and the application in a multimedia communication system.     

Modeling and Performance Analysis of Dispatching Policies in Dispatcher-Based Web Server Cluster

There are two kinds of dispatching policies in content-aware web server cluster; segregation dispatching policy and mixture dispatching policy. Traditional scheduling algorithms all adopt mixture dispatching policy. They do not consider that dynamic requests＇ serving has the tendency to slow down static requests＇ serving, and that different requests have different resource demands, so they can not use duster＇s resource reasonably and effectively. This paper uses stochastic reward net （SRN） to model and analyze the two dispatching policies, and uses stochastic Petri net package （SPNP） to simulate the models. The simulation results and practical tests both show that segregation dispatching policy is better than mixture dispatching policy. The principle of segregation dispatching policy can guide us to design efficient scheduling algorithm.     

Implementing Operating System Support for Extended Trusted Path in TPM-Capable Environments

Trusted path is one of the crucial features that operating systems must provide for fundamental security support. In order to explore the possibility of implementing a trusted path mechanism with the support of trusted platform module （TPM） technologies, and to support TPM capabilities in operating systems, the paper extended the scope of the conventional trusted path to cover the situation in which a user communicates with software residing on a remote host. The paper combined the concept of operating system support for trusted path with that for TPM platforms, and proposed the architecture of an extended trusted path mechanism in operating system with considerations on TPM-capable platforms support. As part of the author＇s research in secure operating systems, the work of the paper was carried out with Linux as an experimental prototype system. The research result shows that TPM capabilities can strengthen extended trusted path mechanisms of operating systems.     

Verifiable （ t, n） Threshold Signature Scheme Based on Elliptic Curve

Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (ellipticcurve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.     

Context-Aware Usage-Based Grid Authorization Framework

Due to inherent heterogeneity, multi-domain characteristic and highly dynamic nature, authorization is a critical concern in grid computing. This paper proposes a general authorization and access control architecture, grid usage control （GUCON）, for grid computing. It＇s based on the next generation access control mechanism usage control （UCON） model. The GUCON Framework dynamic grants and adapts permission to the subject based on a set of contextual information collected from the system environments; while retaining the authorization by evaluating access requests based on subject attributes, object attributes and requests. In general, GUCON model provides very flexible approaches to adapt the dynamically security request. GUCON model is being implemented in our experiment prototype.     

Web Voice Browser Based on an ISLPC Text.to.Speech Algorithm

A kind of Web voice browser based on improved synchronous linear predictive coding （ISLPC） and Text-toSpeech （TTS） algorithm and Internet application was proposed. The paper analyzes the features of TTS system with ISLPC speech synthesis and discusses the design and implementation of ISLPC TTS-based Web voice browser. The browser integrates Web technology, Chinese information processing, artificial intelligence and the key technology of Chinese ISLPC speech synthesis. It＇s a visual and audible web browser that can improve information precision for network users. The evaluation results show that ISLPC-based TTS model has a better performance than other browsers in voice quality and capability of identifying Chinese characters.     

A new algorithm for routing in ad-hoc network

In this paper, we propose a new algorithm for wireless mobile and ad-hoc network, which establishes dynamic cluster of nodes. The proposed algorithm, namely, the Mobility Sensitive Routing Protocol (MSRP), consists of routing in cluster and routing between clusters. Ad-hoc network can utilize MSRP to reduce information exchange and communication bandwidth, to shorten route acquisition delay, and to accommodate more nodes. Foundation item: Supported by the National Natural Science Foundation of China (60133010,60073043,70071042). Biography: Zhang Jian (1976-), male, Ph. D candidate. Lecturer, research direction: computer network, network optimization.     

Methods of constructing optimal wavelet filters based on genetic algorithm

In this paper, algorithms of constructing wavelet filters based on genetic algorithm are studied with emphasis on how to construct the optimal wavelet filters used to compress a given image,due to efficient coding of the chromosome and the fitness function, and due to the global optimization algorithm, this method turns out to be perfect for the compression of the images. Foundation item: Supported by the Natural Science Foundation of Education of Hunan Province(21010506) Biography: Wen Gao-jin( 1978-), male, Master candidate, research direction: evolutionary computing.     

Image Retrieval Based on Objects＇ Spatial Orientation Relationships

A new concept of characteristic scanning radial (CSR) is proposed for the segmented image on the basis of two shape-speciiic points oi its shape-objects. Subsequently, two characteristic attribute sequences (CAS) of relative distance and relative direction are derived to represent the spatial orientation relationships among objects of the image. A novel image retrieval algorithm is presented using these two CASs. The proposed retrieval approach not only satisfies the transformational invariance, but also attains the quantitative comparison of matching. Experiments identify the effectiveness and efficiency of the algorithm adequately.     

Analysis and Application of Covert Channels of Internet Control Message Protocol

Based on the analysis of the covert channel＇s working mechanism of the internet control message protocol （ICMP） in internet protocol version 4 （IPv4） and Internet Protocol version 6 （IPv6）, the ICMP covert channd＇s algorithms of the IPv4 and IPv6 are presented, which enable automatic channeling upon IPv4/v6 nodes with non-IPv4-compatible address, and the key transmission is achieved by using this channel in the embedded Internet terminal. The result shows that the covert channel＇s algorithm, which we implemented if, set correct, the messages of this covert channel might go through the gateway and enter the local area network.