Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Computer Engineering
Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti
Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti
UNLV Theses, Dissertations, Professional Papers, and Capstones
The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration.
Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that the algorithm is starting over again from an arbitrary state. There are a number of such algorithms in the …
Self-Stabilizing Group Membership Protocol, Mahesh Subedi
Self-Stabilizing Group Membership Protocol, Mahesh Subedi
UNLV Theses, Dissertations, Professional Papers, and Capstones
In this thesis, we consider the problem of partitioning a network into groups of bounded diameter.
Given a network of processes X and a constant D, the group partition problem is the problem of finding a D-partition of X, that is, a partition of X into disjoint connected subgraphs, which we call groups, each of diameter no greater than D. The minimal group partition problem is to find a D-partition {G1, ... Gm} of X such that no two groups can be combined; that is, for any Gi and Gj, where i ≠ j, either Gi U Gj is disconnected …
Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel
Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel
UNLV Theses, Dissertations, Professional Papers, and Capstones
Link failure is a common reason for disruption in communication networks. If communication between processes of a weighted distributed network is maintained by a spanning tree T, and if one edge e of T fails, communication can be restored by finding a new spanning tree, T’. If the network is 2-edge connected, T’ can always be constructed by replacing e by a single edge, e’, of the network. We refer to e’ as a swap edge of e.
The best swap edge problem is to find the best choice of e’, that is, that e which causes the new spanning …
A Secure On-Line Credit Card Transaction Method Based On Kerberos Authentication Protocol, Jung Eun Kim
A Secure On-Line Credit Card Transaction Method Based On Kerberos Authentication Protocol, Jung Eun Kim
UNLV Theses, Dissertations, Professional Papers, and Capstones
Nowadays, electronic payment system is an essential part of modern business. Credit cards or debit cards have been widely used for on-site or remote transactions, greatly reducing the need for inconvenient cash transactions. However, there have been a huge number of incidents of credit card frauds over the Internet due to the security weakness of electronic payment system. A number of solutions have been proposed in the past to prevent this problem, but most of them were inconvenient and did not satisfy the needs of cardholders and merchants at the same time.
In this thesis, we present a new secure …