TITLE

A Distributed Architecture for Certificate-based Delegation of Business Process Accessibility in Virtual Organizations

AUTHOR(S)
Talaei-Khoei, Amir
PUB. DATE
December 2009
SOURCE
Journal of Computing & Information Technology;Dec2009, Vol. 17 Issue 4, p313
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper, a distributed architecture has been proposed in order to support an authorization service more precisely in dynamically created Virtual Organizations (VO). In comparison with other existing architectures such as Akenti, VOMS and TAS, our architecture uses certificates on top of the distributed agent architecture for managing requested resources among the VOs. The most obscure issue in distributed agents is finding the proper node that keeps the particular requested certificates In this paper, Chord's Finger Table has been improved to add extra search abilities on the ring architecture of Chord. The process of locating keys can be implemented on the top of the improved Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. In this article, a theoretical analysis is presented for simulations, which shows improvement in the number of passed hops to locate keys in the proposed method in comparison of standard chord, so it's more cost efficient.
ACCESSION #
47966574

 

Related Articles

  • CHC: A Robust P2P Overlay Network with Simple Routing and Small-World Features. Wenjun Xiao; Qin Zhang; Yanxia Liu; Lan Li; Weidong Chen // Journal of Networks;Aug2011, Vol. 6 Issue 8, p1179 

    Almost all recent researches on P2P systems focus on how to build a highly usable P2P overlay network. Researchers include small routing table, short query path and good robustness into their design objectives of overlay topology. In this paper, we present a general group theory method and...

  • CayleyCCC: A Robust P2P Overlay Network with Simple Routing and Small-World Features. Wenjun Xiao; Mingxin He; Huomin Liang // Journal of Networks;Sep2011, Vol. 6 Issue 9, p1247 

    Recent peer-to-peer (P2P) systems research has focused on building highly usable P2P overlay networks. Short query paths, small routing tables, and robustness constitute the most prominent design objectives for the overlay topology. In this paper, we introduce a general group theoretic method...

  • TOWARDS EFFICIENT SEARCH IN P2P NETWORKS WITH 8-POINT HYPERCIRCLES. Feiyu Lin; Sandkuhl, Kurt // Proceedings of the IADIS International Conference on WWW/Interne;Nov2006, p545 

    Scalability problems, network overload and unacceptably long search times are among the main problems when large scale peer-to- peer networks evolve in an uncontrolled manner. Using an 8-point hyper circle as main element, a graph topology is proposed allowing for efficient broadcasting and...

  • Service Broker Algorithm for Cloud-Analyst. Mishra, Rakesh Kumar; Bhukya, Sreenu Naik // International Journal of Computer Science & Information Technolo;2014, Vol. 5 Issue 3, p3957 

    Cloud computing is an area that is rapidly gaining popularity in both academia and industry. Cloud-Analyst is useful tool to model and analyze cloud computing environment and applications before actual deployment of cloud products. Service broker controls the traffic routing between user bases...

  • A note on the computation of ordered supported non-dominated solutions in the bi-criteria minimum spanning tree problems. Da Silva, Carlos Gomes; Cl�maco, Jo�o C. N. // Journal of Telecommunications & Information Technology;2007, Vol. 2007 Issue 4, p11 

    This paper presents a new procedure for computing the set of supported non-dominated solutions of bi-criteria minimum spanning tree problems in ordered manner. The procedure is based on the systematic detection of edges which must be replaced in one efficient solution to obtain the adjacent one,...

  • Connected Dominating Set of Hypercubes and Star Graphs. Y-Chuang Chen; Ya-Ling Syu // International Proceedings of Computer Science & Information Tech;2012, Vol. 41, p15 

    In wired or wireless networks, routing efficiently among immobile or mobile devices is an important issue. A connected dominating set (CDS) brings benefits to network routing. The CDS can be served as a virtual backbone of a network, and it always adapted easily to new network topology. A...

  • Dynamic Routing Strategies based on Hierarchical Kautz Graph. Zhang GuoYin; Li Heng // Journal of Convergence Information Technology;Jun2012, Vol. 7 Issue 11, p1 

    This paper proposes a distributed routing algorithm which uses Kautz graph's shifted routing between nodes in the same levels and recursive routing strategy between nodes in different levels. To deal with various types of failures in DCN (Data Center Network), HUK (Hierarchical Undirected Kautz)...

  • Approximating Spanning Trees with Few Branches. Chimani, Markus; Spoerhase, Joachim // Theory of Computing Systems;Jan2015, Vol. 56 Issue 1, p181 

    Given an undirected, connected graph, the aim of the minimum branch-node spanning tree problem is to find a spanning tree with the minimum number of nodes of degree larger than 2. The problem is motivated by network design problems where junctions are significantly more expensive than simple...

  • A HYBRID ALGORITHM FOR FINDING SHORTEST PATH IN NETWORK ROUTING. AGHAEI, MOHAMMAD REZA SOLTAN; ZUKARNAIN, ZURIATI AHMAD; MAMAT, ALI; ZAINUDDIN, HISHAMUDDIN // Journal of Theoretical & Applied Information Technology;2009, Vol. 5 Issue 3, p360 

    Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. Any classical algorithm deterministic or probabilistic will clearly used O(N) steps since on the average it will...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics