A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Deterministic resource discovery in distributed networks
2001
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '01
Preserved Fulltext
The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. ...
Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity O(n 3 ) (with message complexity O(n 2 )), or message complexity ...
Acknowledgments We are grateful to Mor Harchol-Balter, Renu Tewari, Srinivasa Rao, and Faith Fich for helpful discussions, Amit Fisher, Ateret Anavi, and Ayelet Yifrach for pointing out unclear points in ...
doi:10.1145/378580.378592
dblp:conf/spaa/KuttenPV01
fatcat:5xyjsnmruzetzapfs75ne2uhvy
Deterministic Resource Discovery in Distributed Networks
2003
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. ...
Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity O(n 3 ) (with message complexity O(n 2 )), or message complexity ...
Acknowledgments We are grateful to Mor Harchol-Balter, Renu Tewari, Srinivasa Rao, and Faith Fich for helpful discussions, Amit Fisher, Ateret Anavi, and Ayelet Yifrach for pointing out unclear points in ...
doi:10.1007/s00224-003-1084-8
fatcat:5jjjxdl3abhudm3iftuqdmt224
Deterministic Key Distribution in Wireless Sensor Network using Finite Affine Plane
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Key management is an important area of research in Wireless Sensor Networks (WSN), because resource constraints make security protocols difficult to be implemented. ...
Security of large scale densely deployed and infrastructureless wireless networks of resource limited sensor nodes requires efficient key distribution and management mechanisms. ...
The supporters of deterministic approach [5] , [6] point out that the patterns used in key assignment, makes it simpler to find the common keys during the shared-key discovery phase. ...
doi:10.5120/10191-4879
fatcat:ixokcjnvb5hn7lp6rqhvkov2k4
Discovery and Validation of Queueing Networks in Scheduled Processes
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this work, we target the mining of models that assume a resource-driven perspective and focus on queueing effects. ...
., resource provisioning or delay prediction. Automatic mining of such operational models becomes feasible in the presence of event-data traces. ...
Fork/Join networks and their discovery from a schedule are discussed in Section 4. ...
doi:10.1007/978-3-319-19069-3_26
fatcat:wnq6wcocv5ebzhncz3g6iuhydu
Deterministic epidemic modeling of future botnet malware with a contact process
2021
IEICE Communications Express
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It predicts the infection spreading of the self-evolving botnets with the use of mean field approximation using the degree distribution of the overlay network. ...
This paper proposes deterministic epidemic modeling of future botnet malware named self-evolving botnets, assuming a contact process. ...
They discover vulnerabilities by means of distributed machine learning with the use of computing resources of infected hosts. ...
doi:10.1587/comex.2021xbl0036
fatcat:kmmralnkhrcvhmbcvsffa5kwri
Resource discovery with evolving tuples
2007
International workshop on Engineering of software services for pervasive environments in conjunction with the 6th ESEC/FSE joint meeting - ESSPE '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
network, and application information, both in the network as discoveries propagate, and at the end-points where discoveries are resolved; and • forward compatible: as device capabilities and functions ...
The evolving tuple's inherent flexibility also allows resource discovery to adapt to the changing resources in a pervasive environment. • context-aware: discovery should be influenced by environmental, ...
Acknowledgments The authors would like to thank the Center for Excellence in Distributed Global Environments for providing research facilities and the collaborative environment. ...
doi:10.1145/1294904.1294905
dblp:conf/sigsoft/StovallJ07
fatcat:fv5wdmhdt5c7vd3wxe76rwsqcu
Resource discovery for distributed computing systems: A comprehensive survey
2018
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide an investigation on the current state of resource discovery protocols, mechanisms, and platforms for large-scale distributed environments, focusing on the design aspects. ...
We classify all related aspects, general steps, and requirements to construct a novel resource discovery solution in three categories consisting of structures, methods, and issues. ...
Architectures For Resource Discovery In the distributed system, before designing a resource discovery model, it is necessary to examine the general distribution options in environments and clarify an architecture ...
doi:10.1016/j.jpdc.2017.11.010
fatcat:v4dfsniptfgbxk6aswjjbtt7nu
Mobile-to-Grid Middleware: Bridging the Gap Between Mobile and Grid Environments
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Currently, access to Grid services is limited to resourceful devices such as desktop PCs but most mobile devices (with wireless network connections) cannot access the Grid network directly because of their ...
resource limitations. ...
A proxy interacts with the Globus Toolkit's Monitoring and Discovery Service to communicate resource availability in the nodes it represents. ...
doi:10.1007/11508380_95
fatcat:uzgyq67wjjf5bmerkvqzrw4vfq
A Spontaneous Wireless Ad Hoc Trusted Neighbor Network Creation Protocol
2021
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
To asses the performance of our randomized trusted network proposal and compare it against an existing deterministic protocol used as reference, we relied on Castalia 3.2 simulator, regarding 4 metrics ...
In this paper, we present a new randomized creation model of a spontaneous wireless ad hoc network based on trusted neighbors. ...
Acknowledgments This work has been partially supported by the "Ministerio de Economía y Competitividad" in the "Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia, Subprograma ...
doi:10.1155/2021/5531923
fatcat:wcvewc3slnewndlyelgem6dega
On the tradeoffs between path computation efficiency and information abstraction in optical mesh networks
2004
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The performance of these algorithms is compared in term of the efficiency of network capacity utilization, the computation complexity, and the amount of required network information. ...
While distributed control in general enhances scalability and flexibility, it also offers challenges to path computation, especially for shared mesh restored paths, because of the summarization of link ...
The deterministic approach is then not practicable for distributed route computation involving large networks. ...
doi:10.1109/icc.2004.1312796
dblp:conf/icc/LiuBPKLC04
fatcat:qp5njtw2uzhdlhrvxny2sndouu
On combining a semantic engine and flexible network policies for P2P knowledge sharing networks
2004
Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Peer-to-Peer (P2P) systems have recently become popular for content sharing, and a number of different approaches have been studied to perform effective content retrieval in such networks. ...
In this paper, we discuss how conventional P2P network policies for content retrieval could be combined with a semantic engine component to enforce peer-based knowledge sharing. ...
According to the considerations presented in Section 4, our future research work will be devoted to evaluate the performance of different P2P architectures for knowledge sharing based on the proposed semantic ...
doi:10.1109/dexa.2004.1333529
dblp:conf/dexaw/CastanoFMPRT04
fatcat:rm62hfgspncutijr6gc72i4j2q
Peer-to-Peer Approaches to Grid Resource Discovery
[chapter]
2008
Making Grids Work
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Peer-to-peer organization of Grid resource discovery services would have several desirable features, including high scalability, high reliability, self-organization and self-healing. ...
We present the design and implementation of two peer-to-peer Grid resource discovery services: an unstructured peer-to-peer information service and a structured peer-to-peer replica location service. ...
Acknowledgments This research was supported in part by DOE Cooperative Agreements DE-FC02-01ER25449 and DE-FC02-01ER25453 and by the National Science Foundation under the grant OCI 0534027. ...
doi:10.1007/978-0-387-78448-9_5
dblp:conf/coregrid/ChervenakB07
fatcat:p33un3cpizejbgkgouu2fhhtr4
Performance Based Hypercube Interconnection Structurefor Better Grid Resource Discovery
2012
International Journal of Modeling and Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Processing (resource discovery) must achieve performance in an environment which is heterogeneous, dynamic and shared by other users with competing resource demands. ...
This paper focuses on the benefits derived from an extensive use of an interconnection structure for resource discovery and develop an algorithm which will help the user to discover the available resources ...
In this paper focus is made to get the resource discovery efficiency with less system cost in the network. ...
doi:10.7763/ijmo.2012.v2.221
fatcat:ejhpmnulyvewbokccauisqwecu
CHALLENGES OF INFLUENCE DYNAMIC AND INTERACTIVE EVENTS ON RESOURCE DISCOVERY FUNCTIONALITY OUTSIDE OF DISTRIBUTED EXASCALE SYSTEMS
2020
Azerbaijan Journal of High Performance Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The purpose of this paper is to analyze the use of the traditional resource discovery in the Exascale distributed systems and investigate the factors that should be considered in the function of resource ...
discovery management to have the possibility of application in the Exascale distributed system. ...
The resource discovery is activated within the On the other hand, the existence of delays due to the network and the return of messages due to the resource discovery and time in the computational element ...
doi:10.32010/26166127.2020.3.2.164.180
fatcat:upmwa572ubbtbmovgcdwjumja4
Asynchronous resource discovery
2003
Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One of the basic building blocks of such a distributed system is resource discovery -efficiently discovering the ids of the nodes that currently exist in the system. ...
In addition, we define and study the Ad-hoc Resource Discovery Problem, which is a practical relaxation of the original problem. ...
authors would like to thank Shay Kutten for helpful discussions and remarks, and for pointing out that the O(n) message complexity leader election algorithm of [1] may be applied for strongly connected networks ...
doi:10.1145/872035.872055
dblp:conf/podc/AbrahamD03
fatcat:sse6s56b4jgjjplxzchjijyzby
« Previous
Showing results 1 — 15 out of 24,762 results