We present a parallelization of the Floyd-Warshall all pairs shortest path algorithm for a distributed environment. A lot of versions of the Floyd-Warshall algorithm have been proposed for a uniprocessor environment, optimizing cache performance and register usage. However, in a distributed environment, communication costs between nodes have to be taken… (More)
In this paper, we evaluate the connected domination number of (Z n), in some case of n. We find out that the connected domination number of (Z p e 1 1 ×p e 2 2 ×···×p e k k) is equal to k. Finally, we characterize the graphs in which γ ((Z n)) = γ c ((Z n)).
Packet classification is the problem of identifying which one of a set of rules maintained in a database is best matched by an incoming packet at a router and taking the action specified by the rule. This is a uniform enabler for many new network services like firewalls, quality of service and virtual private networks. These services require dynamic… (More)