Search

Message broadcasting in networks can be efficiently carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at the same node r . Second, for every node u in the network, all trees’ paths from r to u are node-disjoint, excluding the end nodes r and u . Independent spanning trees have applications in fault-tolerant communications and secure message distributions. Gaussian networks and two-dimensional toroidal networks share similar topological characteristics. They are regular of degree four, symmetric, and node-transitive. Gaussian networks, however, have relatively lesser network diameter that could result in a better performance. This promotes Gaussian networks to be a potential alternative for two-dimensional toroidal networks. In this paper, we present constructions for node independent spanning trees in dense Gaussian networks. Based on these constructions, we design routing algorithms that can be used in fault-tolerant routing and secure message distribution. We also design fault-tolerant algorithms to construct these trees in parallel.

Network survivability is a key design issue for optical transport mesh networks. Various survivability schemes have been introduced among which p-cycle has (and continues) attracted quite a lot of attention because of its fast and efficient protection capabilities. The concept of p-cycle has been generalized to pre-cross-connected trails, or p-trails, by exploiting the fact that providing pre-cross-connected protection paths and obtaining fast restoration do not necessarily require a cyclic structure as in p-cycles. In this paper, we investigate the benefits and sharing capabilities of p-trails and observe that non-simple p-trails and p-cycles can be built from merging simple trails. We derive two ILP models for survivable network design using p-trails. Our first design model is a simple ILP whose optimal solution relies on the exhaustive enumeration of all simple trails in the network. We observe that the size of our ILP model, and therefore the computation time, become prohibitively large making the model unpractical for larger network instances. Therefore, to overcome this scalability issue, we develop an enhanced model for this complex optimization problem using the column generation (CG) decomposition technique. Our developed design approach is shown to be very scalable, as opposed to other prior p-trail design methods; further, we show that p-trails are more efficient than p-cycles in terms of protection resource redundancy in the network.

Survivability is a key issue in the design of optical mesh networks. Various survivability schemes have been introduced among which p-cycle has been attracting quite a lot of attention because of its fast and efficient protection capability. The concept of p-cycle was later generalized to pre-cross-connected trails or p-trails, by noting to the fact that providing pre-cross-connected protection paths and obtaining fast restoration does not require a cyclic structure. In this paper, we investigate the capability of p-trails in protecting traffic demands in a mesh-based survivable network. By taking the sharing capability of p-trails into account, we introduce optimization models to verify the remarkable efficiency of p-trails. We derive two ILP models for survivable network design using p-trails. In our first model, the optimal solution is obtained from a candidate set constructed by exhaustive enumeration of all simple trails. We observe that the size of our ILP model, and therefore the computation time, become prohibitively large making the model unpractical for larger network instances. Therefore, to overcome this scalability issue, we develop a better model for this complex optimization problem using a primal-dual decomposition of the original problem based on the column generation (CG) optimization method. Our developed design approach is shown to be very scalable, as opposed to other prior p-trail design methods; further, we show that p-trails are more efficient than p-cycles in terms of resource redundancy in the network.

Anycast is a communication mode in which the same address is assigned to a group of servers and a request sent for a service is routed to the “best” server. The measure of best could be the number of hops, available bandwidth, load of the server, or any other measure. With this scenario, any host could advertise itself as anycast server in order to launch denial-of-service attack or provide false information. In this paper, we solve this problem by proposing an authentication scheme for anycast communication.

One-time signatures are an important and efficient authentication utility. Various schemes already exist for the classical one-way public-key cryptography. One-time signatures have not been sufficiently explored in the literature in the branch of society-oriented cryptography. Their particular properties make them suitable, as a potential cryptographic primitive, for broadcast communication and group-based applications. In this paper, we try to contribute to filling this gap by introducing several group-based one-time signature schemes of various versions: with proxy, with trusted party, and without trusted party.