Matches in SemOpenAlex for { <https://semopenalex.org/work/W2952511579> ?p ?o ?g. }
Showing items 1 to 100 of
100
with 100 items per page.
- W2952511579 abstract "Block scheduling is difficult to implement in P2P network since there is no central coordinator. This problem can be solved by employing network coding technique which allows intermediate nodes to perform the coding operation instead of conventional store and forward the received data. There is a general assumption in this area of research so far that a target download rate is always attainable at every peer as long as coding operation is performed at all the nodes in the network. An interesting study is made that a maximum download rate can be attained by performing the coding operation at relatively small portion of the network. The problem of finding the minimal set of node to perform the coding operation and links to carry the coded data is called as a network code minimization problem (NCMP). It is proved to be NP hard problem. It can be solved using genetic algorithm (GA) because GA can be used to solve the diverse NP hard problem. A new NCMP model is proposed which considers both minimize the resources needed to perform coding operation and dynamic change in network topology due to disconnection. Based on this new NCMP model, an effective and novel GA is proposed by implementing problem specific GA operators into the evolutionary process. There is an attempt to implement the different compositions and several options of GA elements which worked well in many other problems and pick the one that works best for this resource minimization problem. Our simulation results prove that the proposed system outperforms the random selection and coding at all possible node mechanisms in terms of both download time and system throughput." @default.
- W2952511579 created "2019-06-27" @default.
- W2952511579 creator A5032304721 @default.
- W2952511579 creator A5039746932 @default.
- W2952511579 creator A5057377390 @default.
- W2952511579 creator A5081329912 @default.
- W2952511579 creator A5081490680 @default.
- W2952511579 date "2019-06-15" @default.
- W2952511579 modified "2023-10-02" @default.
- W2952511579 title "Genetic Algorithm Based Resource Minimization in Network Code Based Peer-to-Peer Network" @default.
- W2952511579 cites W1497256448 @default.
- W2952511579 cites W1501676939 @default.
- W2952511579 cites W1512383952 @default.
- W2952511579 cites W1912527142 @default.
- W2952511579 cites W1963516735 @default.
- W2952511579 cites W1997825969 @default.
- W2952511579 cites W2001249579 @default.
- W2952511579 cites W2011628012 @default.
- W2952511579 cites W2016373727 @default.
- W2952511579 cites W2018599250 @default.
- W2952511579 cites W2043977911 @default.
- W2952511579 cites W2044435829 @default.
- W2952511579 cites W2062975634 @default.
- W2952511579 cites W2063190340 @default.
- W2952511579 cites W2072056578 @default.
- W2952511579 cites W2080643341 @default.
- W2952511579 cites W2097571405 @default.
- W2952511579 cites W2105831729 @default.
- W2952511579 cites W2106403318 @default.
- W2952511579 cites W2107520978 @default.
- W2952511579 cites W2112716715 @default.
- W2952511579 cites W2130350209 @default.
- W2952511579 cites W2131566399 @default.
- W2952511579 cites W2132110147 @default.
- W2952511579 cites W2133500866 @default.
- W2952511579 cites W2134859306 @default.
- W2952511579 cites W2138928022 @default.
- W2952511579 cites W2143185888 @default.
- W2952511579 cites W2156260722 @default.
- W2952511579 cites W2179995336 @default.
- W2952511579 cites W2788003724 @default.
- W2952511579 cites W2910414172 @default.
- W2952511579 cites W2980070594 @default.
- W2952511579 cites W2983933200 @default.
- W2952511579 cites W2993502515 @default.
- W2952511579 doi "https://doi.org/10.48550/arxiv.1906.06471" @default.
- W2952511579 hasPublicationYear "2019" @default.
- W2952511579 type Work @default.
- W2952511579 sameAs 2952511579 @default.
- W2952511579 citedByCount "0" @default.
- W2952511579 crossrefType "posted-content" @default.
- W2952511579 hasAuthorship W2952511579A5032304721 @default.
- W2952511579 hasAuthorship W2952511579A5039746932 @default.
- W2952511579 hasAuthorship W2952511579A5057377390 @default.
- W2952511579 hasAuthorship W2952511579A5081329912 @default.
- W2952511579 hasAuthorship W2952511579A5081490680 @default.
- W2952511579 hasBestOaLocation W29525115791 @default.
- W2952511579 hasConcept C105795698 @default.
- W2952511579 hasConcept C111919701 @default.
- W2952511579 hasConcept C11413529 @default.
- W2952511579 hasConcept C120314980 @default.
- W2952511579 hasConcept C138293262 @default.
- W2952511579 hasConcept C147764199 @default.
- W2952511579 hasConcept C158379750 @default.
- W2952511579 hasConcept C179518139 @default.
- W2952511579 hasConcept C199360897 @default.
- W2952511579 hasConcept C2780154274 @default.
- W2952511579 hasConcept C31258907 @default.
- W2952511579 hasConcept C33923547 @default.
- W2952511579 hasConcept C41008148 @default.
- W2952511579 hasConceptScore W2952511579C105795698 @default.
- W2952511579 hasConceptScore W2952511579C111919701 @default.
- W2952511579 hasConceptScore W2952511579C11413529 @default.
- W2952511579 hasConceptScore W2952511579C120314980 @default.
- W2952511579 hasConceptScore W2952511579C138293262 @default.
- W2952511579 hasConceptScore W2952511579C147764199 @default.
- W2952511579 hasConceptScore W2952511579C158379750 @default.
- W2952511579 hasConceptScore W2952511579C179518139 @default.
- W2952511579 hasConceptScore W2952511579C199360897 @default.
- W2952511579 hasConceptScore W2952511579C2780154274 @default.
- W2952511579 hasConceptScore W2952511579C31258907 @default.
- W2952511579 hasConceptScore W2952511579C33923547 @default.
- W2952511579 hasConceptScore W2952511579C41008148 @default.
- W2952511579 hasLocation W29525115791 @default.
- W2952511579 hasOpenAccess W2952511579 @default.
- W2952511579 hasPrimaryLocation W29525115791 @default.
- W2952511579 hasRelatedWork W2101515343 @default.
- W2952511579 hasRelatedWork W2126526690 @default.
- W2952511579 hasRelatedWork W2159343877 @default.
- W2952511579 hasRelatedWork W2333698505 @default.
- W2952511579 hasRelatedWork W2350995815 @default.
- W2952511579 hasRelatedWork W2368470705 @default.
- W2952511579 hasRelatedWork W2389498470 @default.
- W2952511579 hasRelatedWork W2781803744 @default.
- W2952511579 hasRelatedWork W2791061010 @default.
- W2952511579 hasRelatedWork W2944460305 @default.
- W2952511579 isParatext "false" @default.
- W2952511579 isRetracted "false" @default.
- W2952511579 magId "2952511579" @default.
- W2952511579 workType "article" @default.