Coverart for item
The Resource Rendezvous in Distributed Systems : Theory, Algorithms and Applications

Rendezvous in Distributed Systems : Theory, Algorithms and Applications

Label
Rendezvous in Distributed Systems : Theory, Algorithms and Applications
Title
Rendezvous in Distributed Systems
Title remainder
Theory, Algorithms and Applications
Creator
Contributor
Subject
Language
eng
Cataloging source
MiAaPQ
Literary form
non fiction
Nature of contents
dictionaries
Rendezvous in Distributed Systems : Theory, Algorithms and Applications
Label
Rendezvous in Distributed Systems : Theory, Algorithms and Applications
Link
http://libproxy.rpi.edu/login?url=https://ebookcentral.proquest.com/lib/rpi/detail.action?docID=4983012
Publication
Copyright
Related Contributor
Related Location
Related Agents
Related Authorities
Related Subjects
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Preface -- Acknowledgements -- Contents -- Acronyms -- Part I Distributed Rendezvous Theory -- 1 Distributed Systems -- 1.1 What is Distributed System? -- 1.2 Local Area Networks -- 1.3 Email -- 1.4 Wireless Sensor Networks -- 1.5 Cognitive Radio Networks -- 1.6 Telephone Networks -- References -- 2 Distributed Computing -- 2.1 What is Distributed Computing? -- 2.2 Communication Model -- 2.3 Information Incompleteness -- 2.4 Timing and Synchrony -- References -- 3 Rendezvous Theory -- 3.1 What is the Rendezvous Problem? -- 3.2 Rendezvous in Multichannel Wireless Networks -- 3.3 Rendezvous in Cognitive Radio Networks -- 3.4 Rendezvous in Distributed Systems -- 3.5 Distributed Rendezvous Algorithms -- 3.5.1 Distributed Telephone Coordination Algorithms -- 3.5.2 Distributed Rendezvous Algorithms for Multichannel Networks -- 3.5.3 Distributed Rendezvous Algorithms for Cognitive Radio Networks -- References -- 4 Rendezvous Categories -- 4.1 Symmetric and Asymmetric Algorithms -- 4.2 Synchronous and Asynchronous -- 4.3 Symmetric and Asymmetric Port Settings -- 4.4 Anonymous and Non-anonymous Entities -- 4.5 Oblivious and Non-oblivious Port Labeling -- 4.6 Rendezvous Categories -- References -- Part II Blind Rendezvous in Distributed Systems -- 5 Blind Rendezvous Problem -- 5.1 System Model -- 5.2 Metrics -- 5.3 Problem Definition -- 5.4 Challenges -- 5.5 Chapter Summary -- References -- 6 Asymmetric Blind Rendezvous Algorithms -- 6.1 Synchronous and Port-Symmetric Rendezvous -- 6.1.1 Smallest Port Accessing Algorithm -- 6.1.2 Quorum-Based Channel Hopping -- 6.2 Asynchronous and Port-Symmetric Rendezvous -- 6.2.1 Asynchronous Quorum-Based Channel Hopping -- 6.2.2 Sequential Accessing Algorithm -- 6.3 Synchronous and Port-Asymmetric Rendezvous -- 6.3.1 Modified Sequential Accessing Algorithm -- 6.4 Asynchronous and Port-Asymmetric Rendezvous
  • 6.4.1 Sequential Access and Temporary Wait for Rendezvous -- 6.5 Chapter Summary -- References -- 7 Synchronous Blind Rendezvous Algorithms -- 7.1 Expanded Sequential Accessing Algorithm -- 7.2 Chapter Summary -- 8 Asynchronous Blind Rendezvous Algorithms for Anonymous Users -- 8.1 Generated Orthogonal Sequence (GOS) -- 8.2 Deterministic Rendezvous Sequence (DRSEQ) -- 8.3 Channel Rendezvous Sequence (CRSEQ) Algorithm -- 8.4 Jump Stay Algorithm -- 8.5 Disjoint Relaxed Different Set (DRDS) Based Rendezvous Algorithm -- 8.5.1 Global Sequence (GS) -- 8.5.2 Disjoint Relaxed Difference Set (DRDS) -- 8.5.3 Equivalence of DRDS and Good GS -- 8.5.4 DRDS Construction -- 8.5.5 DRDS Based Rendezvous Algorithm -- 8.5.6 Improved DRDS Based Rendezvous Algorithm -- 8.6 Lower Bound for GS Based Rendezvous Algorithms -- 8.7 Chapter Summary -- References -- 9 Local Sequence (LS) Based Rendezvous Algorithms -- 9.1 Local Sequence (LS) -- 9.2 Ring Walk Algorithm -- 9.3 Alternate Hop-and-Wait (AHW) Algorithm -- 9.4 A Simple LS Based Rendezvous Algorithm -- 9.5 A Modified LS Based Rendezvous Algorithm -- 9.6 Chapter Summary -- References -- 10 Blind Rendezvous for Multi-users Multihop System -- 10.1 Algorithm Description -- 10.2 Correctness and Complexity -- 10.3 Discussions -- 10.4 Chapter Summary -- References -- Part III Oblivious Blind Rendezvous in Distributed Systems -- 11 Oblivious Blind Rendezvous -- 11.1 System Model -- 11.2 Metrics -- 11.3 Problem Definition -- 11.4 Examples of Oblivious Blind Rendezvous -- 11.5 Chapter Summary -- References -- 12 Asymmetric Oblivious Blind Rendezvous Algorithms -- 12.1 Port-Symmetric Rendezvous -- 12.2 Synchronous and Port-Asymmetric Rendezvous -- 12.3 Asynchronous and Port-Asymmetric Rendezvous -- 12.4 Chapter Summary -- 13 Oblivious Blind Rendezvous for Non-anonymous Users -- 13.1 Synchronous Oblivious Blind Rendezvous
  • 13.1.1 Synchronous Check and Hop Algorithm -- 13.1.2 Correctness and Complexity -- 13.2 Asynchronous Oblivious Blind Rendezvous -- 13.2.1 ID Hopping Algorithm -- 13.2.2 Multi-step Port Hopping Algorithm -- 13.3 Lower Bound for Oblivious Blind Rendezvous -- 13.3.1 Adversary Assignment Graph -- 13.3.2 A Loose Lower Bound -- 13.3.3 A Refined Lower Bound -- 13.4 Chapter Summary -- Reference -- 14 Fully Distributed Rendezvous Algorithm for Non-anonymous Users -- 14.1 Conversion Based Hopping Algorithm -- 14.2 Correctness and Complexity -- 14.3 Chapter Summary -- Reference -- 15 Oblivious Blind Rendezvous for Anonymous Users -- 15.1 Hardness of Anonymity -- 15.2 Port-Symmetric Rendezvous -- 15.2.1 Intuitive Ideas -- 15.2.2 Stay or Random Selection Algorithm -- 15.2.3 Synchronous Users Scenario -- 15.2.4 Asynchronous Users Scenario -- 15.3 Port-Asymmetric Rendezvous -- 15.3.1 Random Picking Algorithm -- 15.3.2 Random Prime Selection and Sequential Accessing Algorithm -- 15.4 Chapter Summary -- References -- 16 Oblivious Blind Rendezvous for Multi-user Multihop CRN -- 16.1 Algorithm Description -- 16.2 Correctness and Complexity -- 16.3 Chapter Summary -- References -- Part IV Distributed Rendezvous Applications -- 17 Rendezvous in Heterogeneous Cognitive Radio Networks -- 17.1 Preliminaries -- 17.1.1 System Model -- 17.1.2 Problem Definition -- 17.1.3 Challenges -- 17.2 Rendezvous for Fully Available Spectrum -- 17.2.1 Rendezvous Scheme for Two Available Channels -- 17.2.2 Traversing Pointer Algorithm -- 17.2.3 Correctness and Complexity -- 17.3 Rendezvous for Partially Available Spectrum -- 17.3.1 Moving Traversing Pointer Algorithm -- 17.3.2 Correctness and Complexity -- 17.4 Chapter Summary -- References -- 18 Rendezvous Search in a Graph -- 18.1 Symmetry of Rendezvous Search -- 18.2 Rendezvous Search Along a Cycle -- 18.3 Rendezvous Search Algorithms
  • 18.4 Chapter Summary -- Reference -- 19 Neighbor Discovery in Wireless Sensor Networks -- 19.1 Motivational Example -- 19.2 Problem Definition -- 19.3 Brute Force Algorithm -- 19.4 Relax Difference Set Based Algorithm -- 19.5 Co-Prime Algorithm -- 19.6 Chapter Summary -- Part V Conclusions and Future Works -- 20 Conclusions and Future Works -- 20.1 Conclusions -- 20.2 Future Works -- References
http://library.link/vocab/cover_art
https://contentcafe2.btol.com/ContentCafe/Jacket.aspx?Return=1&Type=S&Value=9789811036804&userID=ebsco-test&password=ebsco-test
Dimensions
unknown
http://library.link/vocab/discovery_link
{'f': 'http://opac.lib.rpi.edu/record=b4388882'}
Extent
1 online resource (263 pages)
Form of item
online
Isbn
9789811036804
Media category
computer
Media MARC source
rdamedia
Media type code
c
Sound
unknown sound
Specific material designation
remote

Library Locations

    • Folsom LibraryBorrow it
      110 8th St, Troy, NY, 12180, US
      42.729766 -73.682577
Processing Feedback ...