[go: up one dir, main page]

Law et al., 2000 - Google Patents

An O (log n) randomized resource discovery algorithm

Law et al., 2000

View PDF
Document ID
3573542243706350433
Author
Law C
Siu K
Publication year
Publication venue
Brief Announcements of the 14th International Symposium on Distributed Computing, Technical University of Madrid, Technical Report FIM/110.1/DLSIIS

External Links

Snippet

The problem of a distributed network of computers discovering one another by making network connections is called the resource discovery problem. In this paper, we present the first randomized algorithm, called 'Absorption', that can solve the resource discovery …
Continue reading at citeseerx.ist.psu.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/26—Monitoring arrangements; Testing arrangements
    • H04L12/2602—Monitoring arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Application independent communication protocol aspects or techniques in packet data networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing

Similar Documents

Publication Publication Date Title
Lerner et al. The Case for Network Accelerated Query Processing.
Waldvogel Fast longest prefix matching: algorithms, analysis, and applications
US5671222A (en) Multicast routing in self-routing multistage networks
Garay et al. Fully polynomial Byzantine agreement for n> 3 t processors in t+ 1 rounds
US7535906B2 (en) Packet classification
US8289853B2 (en) Method of accelerating the shortest path problem
Law et al. An O (log n) randomized resource discovery algorithm
EP1249988B1 (en) System and method for slot based arl table learning and searching using insertion blocking
Balliu et al. Exponential speedup over locality in MPC with optimal memory
CN108462715B (en) Network information filtering method based on MPI WM (pulse Width modulation) string matching parallel algorithm
Cohen et al. Label-guided graph exploration by a finite automaton
Bakhshi et al. Leader election in anonymous rings: Franklin goes probabilistic
Dinitz et al. Distributed minimum degree spanning trees
Khanmirza WildMinnie: compression of software-defined networking (SDN) rules with wildcard patterns
Halldórsson et al. Ultrafast distributed coloring of high degree graphs
Blin et al. Optimal space lower bound for deterministic self-stabilizing leader election algorithms
EP1253765B1 (en) System and method for slot based ARL table learning and searching using write snoop
Bicknell et al. Performance analysis of fast distributed network restoration algorithms
Lavault et al. A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Shabtay et al. Low complexity network synchronization
Padmanabhan Efficient architectures for data access in a shared memory hierarchy
Duchon et al. Optimal randomized self-stabilizing mutual exclusion on synchronous rings
Devismes et al. Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments
Anagnostopoulos et al. Stability and efficiency of a random local load balancing protocol
Charron-Bost et al. Routing without ordering