Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of routing algorithms. More recently, deadlock recovery strategies have begun to gain acceptance. Progressive deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver deadlocked messages, instead of killing them. However, the di...

Suppose, the Universe comes into existence (as classical spacetime) already with an empty spherically symmetric macroscopic wormhole present in it. Classically the wormhole would evolve into a part of the Schwarzschild space and thus would not allow any signal to traverse it. I consider semiclassical corrections to that picture and build a model of an evaporating wormhole. The model is based on...

Priority-based wormhole switching with a priority share policy has been proposed as a possible solution for real-time on-chip communication. However, the blocking introduced by priority share complicates the analysis process. In this paper, we propose a new “per-priority” basis analysis scheme which computes the total time window at each priority level instead of each traffic-flow. By checking ...

Ad-hoc networks are talented but are exposed to the risk of wormhole attacks. However, a wormhole attack can be mounted easily and forms stern menaces in networks, particularly against various ad-hoc wireless networks. The Wormhole attack distorts the network topology and decrease the network systems performance. Therefore, identifying the possibility of wormhole attacks and recognizing techniq...

In this paper, we are concerned of a particularly severe security attack that affects the ad hoc networks routing protocols, it is called the wormhole attack. We can think of wormhole attack as a two phase process launched by one or several malicious nodes. In the first phase, these malicious nodes, called wormhole nodes, try to lure legitimate nodes to send data to other nodes via them. In the...