89,457 research outputs found
A multipopulation parallel genetic simulated annealing based QoS routing and wavelength assignment integration algorithm for multicast in optical networks
Copyright @ 2008 Elsevier B.V. All rights reserved.In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoS multicast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation parallel genetic simulated annealing algorithm, and then assigns wavelengths to the tree based on the wavelength graph. In the algorithm, routing and wavelength assignment are integrated into a single process. For routing, the objective is to find a cost suboptimal multicast tree. For wavelength assignment, the objective is to minimize the delay of the multicast tree, which is achieved by minimizing the number of wavelength conversion. Thus both the cost of multicast tree and the user QoS satisfaction degree can approach the optimal. Our algorithm also considers load balance. Simulation results show that the proposed algorithm is feasible and effective. We also discuss the practical realization mechanisms of the algorithm.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant nos. 60673159 and 70671020, the National High-Tech Research and Development Plan of China under Grant no. 2006AA01Z214, Program for New Century Excellent Talents in University, and the Key Project of Chinese Ministry of Education under Grant no. 108040
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms
Copyright @ Elsevier Ltd. All rights reserved.In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet.This work was supported in part ny the Program for New Century Excellent Talents in University, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant no. 60673159 and 70671020, the National High-Tech Reasearch and Development Plan of China under Grant no. 2007AA041201, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant no. 20070145017
Routing for Security in Networks with Adversarial Nodes
We consider the problem of secure unicast transmission between two nodes in a
directed graph, where an adversary eavesdrops/jams a subset of nodes. This
adversarial setting is in contrast to traditional ones where the adversary
controls a subset of links. In particular, we study, in the main, the class of
routing-only schemes (as opposed to those allowing coding inside the network).
Routing-only schemes usually have low implementation complexity, yet a
characterization of the rates achievable by such schemes was open prior to this
work. We first propose an LP based solution for secure communication against
eavesdropping, and show that it is information-theoretically rate-optimal among
all routing-only schemes. The idea behind our design is to balance information
flow in the network so that no subset of nodes observe "too much" information.
Interestingly, we show that the rates achieved by our routing-only scheme are
always at least as good as, and sometimes better, than those achieved by
"na\"ive" network coding schemes (i.e. the rate-optimal scheme designed for the
traditional scenario where the adversary controls links in a network rather
than nodes.) We also demonstrate non-trivial network coding schemes that
achieve rates at least as high as (and again sometimes better than) those
achieved by our routing schemes, but leave open the question of characterizing
the optimal rate-region of the problem under all possible coding schemes. We
then extend these routing-only schemes to the adversarial node-jamming
scenarios and show similar results. During the journey of our investigation, we
also develop a new technique that has the potential to derive non-trivial
bounds for general secure-communication schemes
Energy Balance Control and Security for Wireless Sensor Network by Using Cost-Aware Secure Routing protocol
Reliability, Energy balance and security are con?icting design issues for wireless sensor networks (WSNs) with non-replenishable energy resources. In this paper, we ?rst propose a novel secure and ef?cient Cost-Aware SEcure Routing (CASER) protocol to address these con?icting issues through two adjustable parameters: energy balance control (EBC) and probabilistic- based random walking. To solve this problem, we propose an ef?cient non-uniform energy deployment strategy to optimize the lifetime and message delivery ratio under the same energy resource and security requirement. We also provide a quantitative security analysis on the proposed routing protocol. For the non-uniform energy deployment, our analysis shows that we can increase the lifetime and the total number of messages that can be delivered by more than four times under the same assumption. We also demonstrate that the proposed CASER protocol can achieve a high message delivery ratio while preventing routing traceback attacks
Queue-length balance equations in multiclass multiserver queues and their generalizations
A classical result for the steady-state queue-length distribution of
single-class queueing systems is the following: the distribution of the queue
length just before an arrival epoch equals the distribution of the queue length
just after a departure epoch. The constraint for this result to be valid is
that arrivals, and also service completions, with probability one occur
individually, i.e., not in batches. We show that it is easy to write down
somewhat similar balance equations for {\em multidimensional} queue-length
processes for a quite general network of multiclass multiserver queues. We
formally derive those balance equations under a general framework. They are
called distributional relationships, and are obtained for any external arrival
process and state dependent routing as long as certain stationarity conditions
are satisfied and external arrivals and service completions do not
simultaneously occur. We demonstrate the use of these balance equations, in
combination with PASTA, by (i) providing very simple derivations of some known
results for polling systems, and (ii) obtaining new results for some queueing
systems with priorities. We also extend the distributional relationships for a
non-stationary framework
A Comparison of System Optimal and User Optimal Route Guidance.
The work described in this paper (carried out under the EC `DRIVE' programme) extends the simulations described in Working Paper 315, with the aim of studying the likely benefits to and reactions of drivers to system optimal (SO) route guidance - in particular, these effects are compared with those obtained under user optimal (UE) guidance. The model used is again one of a multiple user class equilibrium assignment, so that equipped drivers may be directed to more than one route per origin-destination movement. UE and SO guidance are compared, at different levels of equipped vehicles and demand levels, on the basis of the number of routes they recommend and the similarity of the flows on these routes, as well as link-based properties such as actual flows and queues resulting. These serve to demonstrate the extent to which the routes recommended under UE guidance serve as proxies to those under SO guidance. Secondly, a comparison is made of average (dis)benefits to guided drivers as well as the excess travel time incurred by individual equipped drivers in following SO, as opposed to UE guidance, in order to determine the extent of user sub-optimality of SO routing. Thirdly, input from a parallel DRIVE project, investigating user reactions to guidance information, is used to infer the extent to which drivers are likely to accept the sub-optimality of SO guidance, and the factors which are likely to influence their acceptance. Finally, some preliminary analysis is performed on combined strategies, which aim to strike a balance between the system benefits of SO guidance and the user benefits of UE routing
- …