Matches in SemOpenAlex for { <https://semopenalex.org/work/W2056331983> ?p ?o ?g. }
Showing items 1 to 53 of
53
with 100 items per page.
- W2056331983 abstract "In future networks, transmission and switching capacity will dominate processing capacity. The authors investigate the way in which distributed algorithms should be changed in order to operate efficiently in this new environment. They introduce a class of new models for distributed algorithms which make explicit the difference between switching and processing. Based on these new models they define new message and time complexity measures which, they believe, capture the costs in many high-speed networks more accurately then traditional measures. In order to explore the consequences of the new models, they examine three problems in distributed computation. For the problem of maintaining network topology they devise a broadcast algorithm which takes O(n) messages and O(log n) time for a single broadcast in the new measure. For the problem of leader election they present a simple algorithm that uses O(n) messages and O(n) time. The third problem, distributed computation of a globally sensitive function, demonstrates some important features and tradeoffs in the new models and emphasizes and differences with the traditional network model. The results of the present paper influenced later research, as well as the design of IBM Networking Broadband Services (NBBS). >" @default.
- W2056331983 created "2016-06-24" @default.
- W2056331983 creator A5005125248 @default.
- W2056331983 creator A5033442948 @default.
- W2056331983 creator A5051327793 @default.
- W2056331983 date "1988-01-01" @default.
- W2056331983 modified "2023-10-17" @default.
- W2056331983 title "New models and algorithms for future networks" @default.
- W2056331983 cites W111570186 @default.
- W2056331983 cites W1513400187 @default.
- W2056331983 cites W1977293045 @default.
- W2056331983 cites W2010178885 @default.
- W2056331983 cites W2011999472 @default.
- W2056331983 cites W2046946959 @default.
- W2056331983 cites W2077371116 @default.
- W2056331983 cites W2099012404 @default.
- W2056331983 cites W2102024624 @default.
- W2056331983 cites W2102396830 @default.
- W2056331983 cites W2126682372 @default.
- W2056331983 cites W2138045532 @default.
- W2056331983 cites W2150519657 @default.
- W2056331983 cites W2158883695 @default.
- W2056331983 cites W2340365916 @default.
- W2056331983 doi "https://doi.org/10.1145/62546.62560" @default.
- W2056331983 hasPublicationYear "1988" @default.
- W2056331983 type Work @default.
- W2056331983 sameAs 2056331983 @default.
- W2056331983 citedByCount "39" @default.
- W2056331983 crossrefType "proceedings-article" @default.
- W2056331983 hasAuthorship W2056331983A5005125248 @default.
- W2056331983 hasAuthorship W2056331983A5033442948 @default.
- W2056331983 hasAuthorship W2056331983A5051327793 @default.
- W2056331983 hasConcept C11413529 @default.
- W2056331983 hasConcept C41008148 @default.
- W2056331983 hasConceptScore W2056331983C11413529 @default.
- W2056331983 hasConceptScore W2056331983C41008148 @default.
- W2056331983 hasLocation W20563319831 @default.
- W2056331983 hasOpenAccess W2056331983 @default.
- W2056331983 hasPrimaryLocation W20563319831 @default.
- W2056331983 hasRelatedWork W2051487156 @default.
- W2056331983 hasRelatedWork W2073681303 @default.
- W2056331983 hasRelatedWork W2317200988 @default.
- W2056331983 hasRelatedWork W2358668433 @default.
- W2056331983 hasRelatedWork W2376932109 @default.
- W2056331983 hasRelatedWork W2382290278 @default.
- W2056331983 hasRelatedWork W2386767533 @default.
- W2056331983 hasRelatedWork W2390279801 @default.
- W2056331983 hasRelatedWork W2748952813 @default.
- W2056331983 hasRelatedWork W2899084033 @default.
- W2056331983 isParatext "false" @default.
- W2056331983 isRetracted "false" @default.
- W2056331983 magId "2056331983" @default.
- W2056331983 workType "article" @default.