FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2076312247> ?p ?o ?g. }

• W2076312247 endingPage "206" @default.
• W2076312247 startingPage "190" @default.
• W2076312247 abstract "The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet site). A node (peer) can communicate with another node directly if and only if it knows a certain routing information to that other node. Hence, a critical task is for the peers to convey this routing information to each other. The problem was formalized by Harchol-Balter et al. and the specific P2P application they had in mind was the logical networks G0 of servers placed by Akamai at various Internet sites. The routing information needed for a node to reach another peer is that peer’s identifier (e.g., IP address). A logical directed edge represents the fact that the peer at the tail of the edge knows the IP address of the one at its head. The problem is to compute the connected components in the underlying graph of G0 (namely, the undirected graph obtained from G0 by removing edge directionality). A number of algorithms were developed in Harchol-Balter et al. for this problem in the model of a synchronous network over a weakly connected directed graph. That is, the assumption was that some clock delivers pulses to every node every time unit at the same time, and a message delivery takes one time unit. The best of these algorithms was randomized. Subsequently, a deterministic algorithm for the problem on synchronous networks with improved complexity was presented in a paper by Kutten et al. The current paper extends the deterministic algorithm of Kutten et al. to the environment of asynchronous networks, where no clock pulses are assumed, and the message delivery time may vary and is not known. We managed to maintain complexities similar to those of the synchronous algorithm of Kutten et al. (translated to the asynchronous model). These are lower than the complexities that would be needed to synchronize the system. The main technical difficulty in a directed, weakly connected system is to ensure that nodes take steps that are consistent with each other, even if their knowledge about each other is not symmetric. Here, this task is further complicated by the fact that there is no timeout mechanism (which does exist in synchronous systems) to assist in ensuring consistency. In particular, as opposed to the case in synchronous systems, an asynchronous algorithm cannot first transform every directed edge to be bidirectional and second, apply an algorithm for bidirectional graph. Thus, our result takes another step towards representing the actual setting in a realistic manner." @default.
• W2076312247 created "2016-06-24" @default.
• W2076312247 creator A5033442948 @default.
• W2076312247 creator A5056419022 @default.
• W2076312247 date "2007-01-01" @default.
• W2076312247 modified "2023-09-27" @default.
• W2076312247 title "Asynchronous resource discovery in peer-to-peer networks" @default.
• W2076312247 cites W1821591339 @default.
• W2076312247 cites W1974299554 @default.
• W2076312247 cites W2004350101 @default.
• W2076312247 cites W2015771569 @default.
• W2076312247 cites W2056331983 @default.
• W2076312247 cites W2071294844 @default.
• W2076312247 cites W2101337120 @default.
• W2076312247 cites W2102615478 @default.
• W2076312247 cites W2113623403 @default.
• W2076312247 cites W2149721632 @default.
• W2076312247 cites W2150519657 @default.
• W2076312247 cites W4250390143 @default.
• W2076312247 cites W4251681643 @default.
• W2076312247 cites W4255322337 @default.
• W2076312247 doi "https://doi.org/10.1016/j.comnet.2006.02.005" @default.
• W2076312247 hasPublicationYear "2007" @default.
• W2076312247 type Work @default.
• W2076312247 sameAs 2076312247 @default.
• W2076312247 citedByCount "7" @default.
• W2076312247 countsByYear W20763122472014 @default.
• W2076312247 countsByYear W20763122472015 @default.
• W2076312247 countsByYear W20763122472017 @default.
• W2076312247 countsByYear W20763122472018 @default.
• W2076312247 crossrefType "journal-article" @default.
• W2076312247 hasAuthorship W2076312247A5033442948 @default.
• W2076312247 hasAuthorship W2076312247A5056419022 @default.
• W2076312247 hasConcept C110875604 @default.
• W2076312247 hasConcept C120314980 @default.
• W2076312247 hasConcept C127413603 @default.
• W2076312247 hasConcept C136764020 @default.
• W2076312247 hasConcept C151319957 @default.
• W2076312247 hasConcept C154504017 @default.
• W2076312247 hasConcept C31258907 @default.
• W2076312247 hasConcept C41008148 @default.
• W2076312247 hasConcept C534932454 @default.
• W2076312247 hasConcept C62611344 @default.
• W2076312247 hasConcept C66938386 @default.
• W2076312247 hasConcept C80444323 @default.
• W2076312247 hasConceptScore W2076312247C110875604 @default.
• W2076312247 hasConceptScore W2076312247C120314980 @default.
• W2076312247 hasConceptScore W2076312247C127413603 @default.
• W2076312247 hasConceptScore W2076312247C136764020 @default.
• W2076312247 hasConceptScore W2076312247C151319957 @default.
• W2076312247 hasConceptScore W2076312247C154504017 @default.
• W2076312247 hasConceptScore W2076312247C31258907 @default.
• W2076312247 hasConceptScore W2076312247C41008148 @default.
• W2076312247 hasConceptScore W2076312247C534932454 @default.
• W2076312247 hasConceptScore W2076312247C62611344 @default.
• W2076312247 hasConceptScore W2076312247C66938386 @default.
• W2076312247 hasConceptScore W2076312247C80444323 @default.
• W2076312247 hasIssue "1" @default.
• W2076312247 hasLocation W20763122471 @default.
• W2076312247 hasOpenAccess W2076312247 @default.
• W2076312247 hasPrimaryLocation W20763122471 @default.
• W2076312247 hasRelatedWork W1485627940 @default.
• W2076312247 hasRelatedWork W1561560534 @default.
• W2076312247 hasRelatedWork W1595983809 @default.
• W2076312247 hasRelatedWork W2001888460 @default.
• W2076312247 hasRelatedWork W2098672555 @default.
• W2076312247 hasRelatedWork W2100136028 @default.
• W2076312247 hasRelatedWork W2115391502 @default.
• W2076312247 hasRelatedWork W2130966263 @default.
• W2076312247 hasRelatedWork W2313989154 @default.
• W2076312247 hasRelatedWork W2364921833 @default.
• W2076312247 hasVolume "51" @default.
• W2076312247 isParatext "false" @default.
• W2076312247 isRetracted "false" @default.
• W2076312247 magId "2076312247" @default.
• W2076312247 workType "article" @default.