•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

A dynamic shortest path weighted routing mechanism for MANET based on complex network theory

Author:
Yinghe, Wang
,
Lin, Chang
,
Kai, Yu
,
Chong, Tan
,
Zhiyong, Bu
Publisher:
IEEE
Year
: 2014
DOI: 10.1109/IPDPS.2014.102
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/1077121
Keyword(s): data analysis,n very large databases,n I-O-intensive big data jobs,n RCMP,n big data analytics,n data replication,n double data loss events,n finer-grained task scheduling granularity,n first-order failure resilience strategy,n hot-spots,n intermediate job outputs,n job recomputation,n single data loss events,n very large datasets,n Big data,n Educational institutions,n Market research,n Middleware,n Processor scheduling,n Resilience
Collections :
  • Latin Articles
  • Show Full MetaData Hide Full MetaData
  • Statistics

    A dynamic shortest path weighted routing mechanism for MANET based on complex network theory

Show full item record

contributor authorYinghe, Wang
contributor authorLin, Chang
contributor authorKai, Yu
contributor authorChong, Tan
contributor authorZhiyong, Bu
date accessioned2020-03-12T22:16:12Z
date available2020-03-12T22:16:12Z
date issued2014
identifier other7000257.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1077121
formatgeneral
languageEnglish
publisherIEEE
titleA dynamic shortest path weighted routing mechanism for MANET based on complex network theory
typeConference Paper
contenttypeMetadata Only
identifier padid8213359
subject keywordsdata analysis
subject keywordsn very large databases
subject keywordsn I-O-intensive big data jobs
subject keywordsn RCMP
subject keywordsn big data analytics
subject keywordsn data replication
subject keywordsn double data loss events
subject keywordsn finer-grained task scheduling granularity
subject keywordsn first-order failure resilience strategy
subject keywordsn hot-spots
subject keywordsn intermediate job outputs
subject keywordsn job recomputation
subject keywordsn single data loss events
subject keywordsn very large datasets
subject keywordsn Big data
subject keywordsn Educational institutions
subject keywordsn Market research
subject keywordsn Middleware
subject keywordsn Processor scheduling
subject keywordsn Resilience
identifier doi10.1109/IPDPS.2014.102
journal titleetwork Infrastructure and Digital Content (IC-NIDC), 2014 4th IEEE International Conference on
filesize154737
citations0
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace