CINXE.COM

<!DOCTYPE html> <html lang="en" xmlns:fb="http://www.facebook.com/2008/fbml" class="wf-loading"> <head prefix="og: https://ogp.me/ns# fb: https://ogp.me/ns/fb# academia: https://ogp.me/ns/fb/academia#"> <meta charset="utf-8"> <meta name=viewport content="width=device-width, initial-scale=1"> <meta rel="search" type="application/opensearchdescription+xml" href="/open_search.xml" title="Academia.edu"> <title>Routing algorithm Research Papers - Academia.edu</title>  <link href="//a.academia-assets.com/images/favicons/favicon-production.ico" rel="shortcut icon" type="image/vnd.microsoft.icon"> <link rel="apple-touch-icon" sizes="57x57" href="//a.academia-assets.com/images/favicons/apple-touch-icon-57x57.png"> <link rel="apple-touch-icon" sizes="60x60" href="//a.academia-assets.com/images/favicons/apple-touch-icon-60x60.png"> <link rel="apple-touch-icon" sizes="72x72" href="//a.academia-assets.com/images/favicons/apple-touch-icon-72x72.png"> <link rel="apple-touch-icon" sizes="76x76" href="//a.academia-assets.com/images/favicons/apple-touch-icon-76x76.png"> <link rel="apple-touch-icon" sizes="114x114" href="//a.academia-assets.com/images/favicons/apple-touch-icon-114x114.png"> <link rel="apple-touch-icon" sizes="120x120" href="//a.academia-assets.com/images/favicons/apple-touch-icon-120x120.png"> <link rel="apple-touch-icon" sizes="144x144" href="//a.academia-assets.com/images/favicons/apple-touch-icon-144x144.png"> <link rel="apple-touch-icon" sizes="152x152" href="//a.academia-assets.com/images/favicons/apple-touch-icon-152x152.png"> <link rel="apple-touch-icon" sizes="180x180" href="//a.academia-assets.com/images/favicons/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-194x194.png" sizes="194x194"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-16x16.png" sizes="16x16"> <link rel="manifest" href="//a.academia-assets.com/images/favicons/manifest.json"> <meta name="msapplication-TileColor" content="#2b5797"> <meta name="msapplication-TileImage" content="//a.academia-assets.com/images/favicons/mstile-144x144.png"> <meta name="theme-color" content="#ffffff"> <script> window.performance && window.performance.measure && window.performance.measure("Time To First Byte", "requestStart", "responseStart"); </script> <script> (function() { if (!window.URLSearchParams || !window.history || !window.history.replaceState) { return; } var searchParams = new URLSearchParams(window.location.search); var paramsToDelete = [ 'fs', 'sm', 'swp', 'iid', 'nbs', 'rcc', // related content category 'rcpos', // related content carousel position 'rcpg', // related carousel page 'rchid', // related content hit id 'f_ri', // research interest id, for SEO tracking 'f_fri', // featured research interest, for SEO tracking (param key without value) 'f_rid', // from research interest directory for SEO tracking 'f_loswp', // from research interest pills on LOSWP sidebar for SEO tracking 'rhid', // referrring hit id ]; if (paramsToDelete.every((key) => searchParams.get(key) === null)) { return; } paramsToDelete.forEach((key) => { searchParams.delete(key); }); var cleanUrl = new URL(window.location.href); cleanUrl.search = searchParams.toString(); history.replaceState({}, document.title, cleanUrl); })(); </script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-5VKX33P2DS"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-5VKX33P2DS', { cookie_domain: 'academia.edu', send_page_view: false, }); gtag('event', 'page_view', { 'controller': "by_tag", 'action': "show_one", 'controller_action': 'by_tag#show_one', 'logged_in': 'false', 'edge': 'unknown', // Send nil if there is no A/B test bucket, in case some records get logged // with missing data - that way we can distinguish between the two cases. // ab_test_bucket should be of the form <ab_test_name>:<bucket> 'ab_test_bucket': null, }) </script> <script type="text/javascript"> window.sendUserTiming = function(timingName) { if (!(window.performance && window.performance.measure)) return; var entries = window.performance.getEntriesByName(timingName, "measure"); if (entries.length !== 1) return; var timingValue = Math.round(entries[0].duration); gtag('event', 'timing_complete', { name: timingName, value: timingValue, event_category: 'User-centric', }); }; window.sendUserTiming("Time To First Byte"); </script> <meta name="csrf-param" content="authenticity_token" /> <meta name="csrf-token" content="_dn9_EGwlLduHSzZPSNmhm5G346zvHcdFob1t6i6wxaRgB_brZpdSjnGIs6IGmWrtaw2wjvro-2P7BG2R21mUg" /> <link href="/Documents/in/Routing_algorithm?after=50%2C803670" rel="next" /><link crossorigin="" href="https://fonts.gstatic.com/" rel="preconnect" /><link href="https://fonts.googleapis.com/css2?family=DM+Sans:ital,opsz,wght@0,9..40,100..1000;1,9..40,100..1000&family=Gupter:wght@400;500;700&family=IBM+Plex+Mono:wght@300;400&family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@20,400,0,0&display=swap" rel="stylesheet" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/common-2b6f90dbd75f5941bc38f4ad716615f3ac449e7398313bb3bc225fba451cd9fa.css" /> <meta name="description" content="View Routing algorithm Research Papers on Academia.edu for free." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'by_tag'; var $action_name = "show_one"; var $rails_env = 'production'; var $app_rev = '260e66119368726bca8f95528d13f8b3d10b2ef8'; var $domain = 'academia.edu'; var $app_host = "academia.edu"; var $asset_host = "academia-assets.com"; var $start_time = new Date().getTime(); var $recaptcha_key = "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB"; var $recaptcha_invisible_key = "6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj"; var $disableClientRecordHit = false; </script> <script> window.Aedu = { hit_data: null }; window.Aedu.SiteStats = {"premium_universities_count":14008,"monthly_visitors":"108 million","monthly_visitor_count":108476212,"monthly_visitor_count_in_millions":108,"user_count":283792782,"paper_count":55203019,"paper_count_in_millions":55,"page_count":432000000,"page_count_in_millions":432,"pdf_count":16500000,"pdf_count_in_millions":16}; window.Aedu.serverRenderTime = new Date(1740592968000); window.Aedu.timeDifference = new Date().getTime() - 1740592968000; window.Aedu.isUsingCssV1 = false; window.Aedu.enableLocalization = true; window.Aedu.activateFullstory = false; window.Aedu.serviceAvailability = { status: {"attention_db":"on","bibliography_db":"on","contacts_db":"on","email_db":"on","indexability_db":"on","mentions_db":"on","news_db":"on","notifications_db":"on","offsite_mentions_db":"on","redshift":"on","redshift_exports_db":"on","related_works_db":"on","ring_db":"on","user_tests_db":"on"}, serviceEnabled: function(service) { return this.status[service] === "on"; }, readEnabled: function(service) { return this.serviceEnabled(service) || this.status[service] === "read_only"; }, }; window.Aedu.viewApmTrace = function() { // Check if x-apm-trace-id meta tag is set, and open the trace in APM // in a new window if it is. var apmTraceId = document.head.querySelector('meta[name="x-apm-trace-id"]'); if (apmTraceId) { var traceId = apmTraceId.content; // Use trace ID to construct URL, an example URL looks like: // https://app.datadoghq.com/apm/traces?query=trace_id%31298410148923562634 var apmUrl = 'https://app.datadoghq.com/apm/traces?query=trace_id%3A' + traceId; window.open(apmUrl, '_blank'); } }; </script>  <link href="https://fonts.googleapis.com/css?family=Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i" rel="stylesheet"> <link rel="preload" href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" as="style" onload="this.rel='stylesheet'"> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/libraries-a9675dcb01ec4ef6aa807ba772c7a5a00c1820d3ff661c1038a20f80d06bb4e4.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/academia-1eb081e01ca8bc0c1b1d866df79d9eb4dd2c484e4beecf76e79a7806c72fee08.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system_legacy-056a9113b9a0f5343d013b29ee1929d5a18be35fdcdceb616600b4db8bd20054.css" /> <script src="//a.academia-assets.com/assets/webpack_bundles/runtime-bundle-005434038af4252ca37c527588411a3d6a0eabb5f727fac83f8bbe7fd88d93bb.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/webpack_libraries_and_infrequently_changed.wjs-bundle-63c3b84e278fb86e50772ccc2ac0281a0f74ac7e2f88741ecad58131583d4c47.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-85b27a68dc793256271cea8ce6f178025923f9e7e3c7450780e59eacecf59a75.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/sentry.wjs-bundle-5fe03fddca915c8ba0f7edbe64c194308e8ce5abaed7bffe1255ff37549c4808.js"></script> <script> jade = window.jade || {}; jade.helpers = window.$h; jade._ = window._; </script>  <script id="tag-manager-head-root">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer_old','GTM-5G9JF7Z');</script>  <script> window.gptadslots = []; window.googletag = window.googletag || {}; window.googletag.cmd = window.googletag.cmd || []; </script> <script type="text/javascript"> // TODO(jacob): This should be defined, may be rare load order problem. // Checking if null is just a quick fix, will default to en if unset. // Better fix is to run this immedietely after I18n is set. if (window.I18n != null) { I18n.defaultLocale = "en"; I18n.locale = "en"; I18n.fallbacks = true; } </script> <link rel="canonical" href="https://www.academia.edu/Documents/in/Routing_algorithm" /> </head>   <body class='c-by_tag a-show_one logged_out u-bgColorWhite'>  <div id="fb-root"></div><script>window.fbAsyncInit = function() { FB.init({ appId: "2369844204", version: "v8.0", status: true, cookie: true, xfbml: true }); // Additional initialization code. if (window.InitFacebook) { // facebook.ts already loaded, set it up. window.InitFacebook(); } else { // Set a flag for facebook.ts to find when it loads. window.academiaAuthReadyFacebook = true; } };</script><script>window.fbAsyncLoad = function() { // Protection against double calling of this function if (window.FB) { return; } (function(d, s, id){ var js, fjs = d.getElementsByTagName(s)[0]; if (d.getElementById(id)) {return;} js = d.createElement(s); js.id = id; js.src = "//connect.facebook.net/en_US/sdk.js"; fjs.parentNode.insertBefore(js, fjs); }(document, 'script', 'facebook-jssdk')); } if (!window.defer_facebook) { // Autoload if not deferred window.fbAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.fbAsyncLoad(); }, 5000); }</script> <div id="google-root"></div><script>window.loadGoogle = function() { if (window.InitGoogle) { // google.ts already loaded, set it up. window.InitGoogle("331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"); } else { // Set a flag for google.ts to use when it loads. window.GoogleClientID = "331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"; } };</script><script>window.googleAsyncLoad = function() { // Protection against double calling of this function (function(d) { var js; var id = 'google-jssdk'; var ref = d.getElementsByTagName('script')[0]; if (d.getElementById(id)) { return; } js = d.createElement('script'); js.id = id; js.async = true; js.onload = loadGoogle; js.src = "https://accounts.google.com/gsi/client" ref.parentNode.insertBefore(js, ref); }(document)); } if (!window.defer_google) { // Autoload if not deferred window.googleAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.googleAsyncLoad(); }, 5000); }</script> <div id="tag-manager-body-root">  <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>   <script> window.addEventListener('load', function() { if (document.querySelector('input[name="commit"]')) { document.querySelector('input[name="commit"]').addEventListener('click', function() { gtag('event', 'click', { event_category: 'button', event_label: 'Log In' }) }) } }); </script> </div> <script>var _comscore = _comscore || []; _comscore.push({ c1: "2", c2: "26766707" }); (function() { var s = document.createElement("script"), el = document.getElementsByTagName("script")[0]; s.async = true; s.src = (document.location.protocol == "https:" ? "https://sb" : "http://b") + ".scorecardresearch.com/beacon.js"; el.parentNode.insertBefore(s, el); })();</script><img src="https://sb.scorecardresearch.com/p?c1=2&c2=26766707&cv=2.0&cj=1" style="position: absolute; visibility: hidden" /> <div id='react-modal'></div> <div class='DesignSystem'> <a class='u-showOnFocus' href='#site'> Skip to main content </a> </div> <div id="upgrade_ie_banner" style="display: none;"><p>Academia.edu no longer supports Internet Explorer.</p><p>To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to <a href="https://www.academia.edu/upgrade-browser">upgrade your browser</a>.</p></div><script>// Show this banner for all versions of IE if (!!window.MSInputMethodContext || /(MSIE)/.test(navigator.userAgent)) { document.getElementById('upgrade_ie_banner').style.display = 'block'; }</script> <div class="DesignSystem bootstrap ShrinkableNav no-sm no-md"><div class="navbar navbar-default main-header"><div class="container-wrapper" id="main-header-container"><div class="container"><div class="navbar-header"><div class="nav-left-wrapper u-mt0x"><div class="nav-logo"><a data-main-header-link-target="logo_home" href="https://www.academia.edu/"><img class="visible-xs-inline-block" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015-A.svg" width="24" height="24" /><img width="145.2" height="18" class="hidden-xs" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015.svg" /></a></div><div class="nav-search"><div class="SiteSearch-wrapper select2-no-default-pills"><form class="js-SiteSearch-form DesignSystem" action="https://www.academia.edu/search" accept-charset="UTF-8" method="get"><i class="SiteSearch-icon fa fa-search u-fw700 u-positionAbsolute u-tcGrayDark"></i><input class="js-SiteSearch-form-input SiteSearch-form-input form-control" data-main-header-click-target="search_input" name="q" placeholder="Search" type="text" value="" /></form></div></div></div><div class="nav-right-wrapper pull-right"><ul class="NavLinks js-main-nav list-unstyled"><li class="NavLinks-link"><a class="js-header-login-url Button Button--inverseGray Button--sm u-mb4x" id="nav_log_in" rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="NavLinks-link u-p0x"><a class="Button Button--inverseGray Button--sm u-mb4x" rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li></ul><button class="hidden-lg hidden-md hidden-sm u-ml4x navbar-toggle collapsed" data-target=".js-mobile-header-links" data-toggle="collapse" type="button"><span class="icon-bar"></span><span class="icon-bar"></span><span class="icon-bar"></span></button></div></div><div class="collapse navbar-collapse js-mobile-header-links"><ul class="nav navbar-nav"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li><li class="u-borderColorGrayLight u-borderBottom1 js-mobile-nav-expand-trigger"><a href="#">more&nbsp<span class="caret"></span></a></li><li><ul class="js-mobile-nav-expand-section nav navbar-nav u-m0x collapse"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/about">About</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/press">Press</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/documents">Papers</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/hiring"><i class="fa fa-briefcase"></i> We're Hiring!</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://support.academia.edu/hc/en-us"><i class="fa fa-question-circle"></i> Help Center</a></li><li class="js-mobile-nav-collapse-trigger u-borderColorGrayLight u-borderBottom1 dropup" style="display:none"><a href="#">less&nbsp<span class="caret"></span></a></li></ul></li></ul></div></div></div><script>(function(){ var $moreLink = $(".js-mobile-nav-expand-trigger"); var $lessLink = $(".js-mobile-nav-collapse-trigger"); var $section = $('.js-mobile-nav-expand-section'); $moreLink.click(function(ev){ ev.preventDefault(); $moreLink.hide(); $lessLink.show(); $section.collapse('show'); }); $lessLink.click(function(ev){ ev.preventDefault(); $moreLink.show(); $lessLink.hide(); $section.collapse('hide'); }); })() if ($a.is_logged_in() || false) { new Aedu.NavigationController({ el: '.js-main-nav', showHighlightedNotification: false }); } else { $(".js-header-login-url").attr("href", $a.loginUrlWithRedirect()); } Aedu.autocompleteSearch = new AutocompleteSearch({el: '.js-SiteSearch-form'});</script></div></div> <div id='site' class='fixed'> <div id="content" class="clearfix"> <script>document.addEventListener('DOMContentLoaded', function(){ var $dismissible = $(".dismissible_banner"); $dismissible.click(function(ev) { $dismissible.hide(); }); });</script> <div class="DesignSystem" style="margin-top:-40px"><div class="PageHeader"><div class="container"><div class="row"><style type="text/css">.sor-abstract { display: -webkit-box; overflow: hidden; text-overflow: ellipsis; -webkit-line-clamp: 3; -webkit-box-orient: vertical; }</style><div class="col-xs-12 clearfix"><div class="u-floatLeft"><h1 class="PageHeader-title u-m0x u-fs30">Routing algorithm</h1><div class="u-tcGrayDark">8,479 Followers</div><div class="u-tcGrayDark u-mt2x">Recent papers in <b>Routing algorithm</b></div></div></div></div></div></div><div class="TabbedNavigation"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><ul class="nav u-m0x u-p0x list-inline u-displayFlex"><li class="active"><a href="https://www.academia.edu/Documents/in/Routing_algorithm">Top Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Routing_algorithm/MostCited">Most Cited Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Routing_algorithm/MostDownloaded">Most Downloaded Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Routing_algorithm/MostRecent">Newest Papers</a></li><li><a class="" href="https://www.academia.edu/People/Routing_algorithm">People</a></li></ul></div><style type="text/css">ul.nav{flex-direction:row}@media(max-width: 567px){ul.nav{flex-direction:column}.TabbedNavigation li{max-width:100%}.TabbedNavigation li.active{background-color:var(--background-grey, #dddde2)}.TabbedNavigation li.active:before,.TabbedNavigation li.active:after{display:none}}</style></div></div></div><div class="container"><div class="row"><div class="col-xs-12"><div class="u-displayFlex"><div class="u-flexGrow1"><div class="works"><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_58572267" data-work_id="58572267" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" rel="nofollow" href="https://www.academia.edu/58572267/Wormhole_attack_prevention_using_clustering_and_digital_signatures_in_reactive_routing">Wormhole attack prevention using clustering and digital signatures in reactive routing</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Owing to features of open medium, absence of infrastructure, dynamic network topology, cooperative algorithms, lack of centralized monitoring and resource constraints, ad hoc networks are vulnerable to many kinds of attacks, among which... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_58572267" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Owing to features of open medium, absence of infrastructure, dynamic network topology, cooperative algorithms, lack of centralized monitoring and resource constraints, ad hoc networks are vulnerable to many kinds of attacks, among which wormhole attack is chosen as the topic of discussion. This attack, when launched during route discovery phase can percolate wrong route/topology information into the network thereby, defeating the purpose of routing algorithms. In this paper we propose a novel technique based on clustering and digital signatures for prevention against wormhole attacks without use of special hardware, time synchronisation or dependency on time or hop difference between colluding nodes to identify attacked routes. We employ independent algorithms to form clusters and to implement intra-cluster and inter-cluster routing of data packets. Simulation Results show that the method achieved high level of efficiency in isolating wormhole nodes in the network.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/58572267" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="174017720" href="https://nsit.academia.edu/AmarjitMalhotra">Amarjit Malhotra</a><script data-card-contents-for-user="174017720" type="text/json">{"id":174017720,"first_name":"Amarjit","last_name":"Malhotra","domain_name":"nsit","page_name":"AmarjitMalhotra","display_name":"Amarjit Malhotra","profile_url":"https://nsit.academia.edu/AmarjitMalhotra?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_58572267 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="58572267"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 58572267, container: ".js-paper-rank-work_58572267", }); });</script></li><li class="js-percentile-work_58572267 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 58572267; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_58572267"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_58572267 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="58572267"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 58572267; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=58572267]").text(description); $(".js-view-count-work_58572267").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_58572267").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="58572267"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="4383" rel="nofollow" href="https://www.academia.edu/Documents/in/Digital_Signature">Digital Signature</a>, <script data-card-contents-for-ri="4383" type="text/json">{"id":4383,"name":"Digital Signature","url":"https://www.academia.edu/Documents/in/Digital_Signature?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="58607" rel="nofollow" href="https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Network">Mobile Ad Hoc Network</a>, <script data-card-contents-for-ri="58607" type="text/json">{"id":58607,"name":"Mobile Ad Hoc Network","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="236814" rel="nofollow" href="https://www.academia.edu/Documents/in/Ad_hoc_network">Ad hoc network</a><script data-card-contents-for-ri="236814" type="text/json">{"id":236814,"name":"Ad hoc network","url":"https://www.academia.edu/Documents/in/Ad_hoc_network?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=58572267]'), work: {"id":58572267,"title":"Wormhole attack prevention using clustering and digital signatures in reactive routing","created_at":"2021-10-17T04:49:14.073-07:00","url":"https://www.academia.edu/58572267/Wormhole_attack_prevention_using_clustering_and_digital_signatures_in_reactive_routing?f_ri=11040","dom_id":"work_58572267","summary":"Owing to features of open medium, absence of infrastructure, dynamic network topology, cooperative algorithms, lack of centralized monitoring and resource constraints, ad hoc networks are vulnerable to many kinds of attacks, among which wormhole attack is chosen as the topic of discussion. This attack, when launched during route discovery phase can percolate wrong route/topology information into the network thereby, defeating the purpose of routing algorithms. In this paper we propose a novel technique based on clustering and digital signatures for prevention against wormhole attacks without use of special hardware, time synchronisation or dependency on time or hop difference between colluding nodes to identify attacked routes. We employ independent algorithms to form clusters and to implement intra-cluster and inter-cluster routing of data packets. Simulation Results show that the method achieved high level of efficiency in isolating wormhole nodes in the network.","downloadable_attachments":[],"ordered_authors":[{"id":174017720,"first_name":"Amarjit","last_name":"Malhotra","domain_name":"nsit","page_name":"AmarjitMalhotra","display_name":"Amarjit Malhotra","profile_url":"https://nsit.academia.edu/AmarjitMalhotra?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":4383,"name":"Digital Signature","url":"https://www.academia.edu/Documents/in/Digital_Signature?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":58607,"name":"Mobile Ad Hoc Network","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Network?f_ri=11040","nofollow":true},{"id":236814,"name":"Ad hoc network","url":"https://www.academia.edu/Documents/in/Ad_hoc_network?f_ri=11040","nofollow":true},{"id":288703,"name":"Routing Protocol","url":"https://www.academia.edu/Documents/in/Routing_Protocol?f_ri=11040"},{"id":369290,"name":"Route Discovery","url":"https://www.academia.edu/Documents/in/Route_Discovery?f_ri=11040"},{"id":1340139,"name":"Dynamic Networks","url":"https://www.academia.edu/Documents/in/Dynamic_Networks?f_ri=11040"},{"id":1688205,"name":"Global position ing system","url":"https://www.academia.edu/Documents/in/Global_position_ing_system?f_ri=11040"},{"id":2986501,"name":"Public Key","url":"https://www.academia.edu/Documents/in/Public_Key?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7354042" data-work_id="7354042" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7354042/Realistic_mobility_modeling_of_pedestrian_traffic_in_wireless_networks">Realistic mobility modeling of pedestrian traffic in wireless networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper a new pedestrian mobility model for outdoor scenarios is presented. It captures realistic features like moving-in-groups, conscious traveling and smart traveling. The routing algorithm proposed within the model works under a... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_7354042" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper a new pedestrian mobility model for outdoor scenarios is presented. It captures realistic features like moving-in-groups, conscious traveling and smart traveling. The routing algorithm proposed within the model works under a step by step approach, leading users to their destination while, at the same time, using more attractable streets from a pedestrian point of view. The model concept is perfectly generic and applicable to any pedestrian outdoor scenario, provided that the street database and pedestrian traffic information is available. The mobility model was validated using Lisbon's downtown as a case study. The output shows a high correlation between simulated and real data, thus validating the approach.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7354042" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="db0f33940f30e6008383d340f6129435" rel="nofollow" data-download="{"attachment_id":48520407,"asset_id":7354042,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48520407/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12953983" href="https://independent.academia.edu/IvoSousa1">Ivo Sousa</a><script data-card-contents-for-user="12953983" type="text/json">{"id":12953983,"first_name":"Ivo","last_name":"Sousa","domain_name":"independent","page_name":"IvoSousa1","display_name":"Ivo Sousa","profile_url":"https://independent.academia.edu/IvoSousa1?f_ri=11040","photo":"https://0.academia-photos.com/12953983/73315052/61794601/s65_ivo.sousa.jpeg"}</script></span></span></li><li class="js-paper-rank-work_7354042 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7354042"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7354042, container: ".js-paper-rank-work_7354042", }); });</script></li><li class="js-percentile-work_7354042 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7354042; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7354042"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7354042 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7354042"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7354042; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7354042]").text(description); $(".js-view-count-work_7354042").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7354042").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7354042"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="13845" rel="nofollow" href="https://www.academia.edu/Documents/in/Time_Use">Time Use</a>, <script data-card-contents-for-ri="13845" type="text/json">{"id":13845,"name":"Time Use","url":"https://www.academia.edu/Documents/in/Time_Use?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="65429" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_Network">Wireless Network</a>, <script data-card-contents-for-ri="65429" type="text/json">{"id":65429,"name":"Wireless Network","url":"https://www.academia.edu/Documents/in/Wireless_Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="85294" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Model">Computer Model</a><script data-card-contents-for-ri="85294" type="text/json">{"id":85294,"name":"Computer Model","url":"https://www.academia.edu/Documents/in/Computer_Model?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7354042]'), work: {"id":7354042,"title":"Realistic mobility modeling of pedestrian traffic in wireless networks","created_at":"2014-06-15T08:19:20.096-07:00","url":"https://www.academia.edu/7354042/Realistic_mobility_modeling_of_pedestrian_traffic_in_wireless_networks?f_ri=11040","dom_id":"work_7354042","summary":"In this paper a new pedestrian mobility model for outdoor scenarios is presented. It captures realistic features like moving-in-groups, conscious traveling and smart traveling. The routing algorithm proposed within the model works under a step by step approach, leading users to their destination while, at the same time, using more attractable streets from a pedestrian point of view. The model concept is perfectly generic and applicable to any pedestrian outdoor scenario, provided that the street database and pedestrian traffic information is available. The mobility model was validated using Lisbon's downtown as a case study. The output shows a high correlation between simulated and real data, thus validating the approach.","downloadable_attachments":[{"id":48520407,"asset_id":7354042,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12953983,"first_name":"Ivo","last_name":"Sousa","domain_name":"independent","page_name":"IvoSousa1","display_name":"Ivo Sousa","profile_url":"https://independent.academia.edu/IvoSousa1?f_ri=11040","photo":"https://0.academia-photos.com/12953983/73315052/61794601/s65_ivo.sousa.jpeg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":13845,"name":"Time Use","url":"https://www.academia.edu/Documents/in/Time_Use?f_ri=11040","nofollow":true},{"id":65429,"name":"Wireless Network","url":"https://www.academia.edu/Documents/in/Wireless_Network?f_ri=11040","nofollow":true},{"id":85294,"name":"Computer Model","url":"https://www.academia.edu/Documents/in/Computer_Model?f_ri=11040","nofollow":true},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=11040"},{"id":188095,"name":"Legged Locomotion","url":"https://www.academia.edu/Documents/in/Legged_Locomotion?f_ri=11040"},{"id":892890,"name":"Point of View","url":"https://www.academia.edu/Documents/in/Point_of_View?f_ri=11040"},{"id":1011798,"name":"Mobility Model","url":"https://www.academia.edu/Documents/in/Mobility_Model?f_ri=11040"},{"id":1232975,"name":"Wireless Communication","url":"https://www.academia.edu/Documents/in/Wireless_Communication-1?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_16731193" data-work_id="16731193" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/16731193/Design_and_Implementation_of_Efficient_Routers_in_NoC_Application">Design and Implementation of Efficient Routers in NoC Application</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Abstract: - As innovation shrink, the force scattered by the connections of a network-on-chip (NoC) begins to imitate with the force dispersed by alternate components like as switches and the network interfaces (NIs).In this venture... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_16731193" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Abstract: - As innovation shrink, the force scattered by the connections of a network-on-chip (NoC) begins to imitate with the force dispersed by alternate components like as switches and the network interfaces (NIs).In this venture Cartesian switch is outlined keeping in mind the end goal to diminish the force dissipation. Cartesian switch is a composite of gatherer and arterials. A gatherer is a 'horizontal network' connecting authority switches, while a blood vessel is a 'vertical network' that divide gatherers. Authority switches has an east and a west port, connecting the switch to its gatherer, while blood vessel switches have sufficient ports to permit connection to its authorities and its arterials. To guarantee connectivity, a blood vessel is not allowed to diversion a gatherer. Every switch is given a location that indicate its location in Cartesian space (spoke to, for instance, utilizing scope and longitude); inside an authority, all gatherer switches offer common scope. At last we choose that the port transition of double information between the ports are proficient in NOC application for exchange the information rates in effective way and it additionally lessened Area of the switch. At long last the Cartesian switch will be actualized by utilizing FPGA Kit.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/16731193" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="381c3e79fecd0d0d5b3ef2dc190b3c50" rel="nofollow" data-download="{"attachment_id":39151384,"asset_id":16731193,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/39151384/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="17574014" href="https://ijtet.academia.edu/IJTETJournal">IJTET Journal</a><script data-card-contents-for-user="17574014" type="text/json">{"id":17574014,"first_name":"IJTET","last_name":"Journal","domain_name":"ijtet","page_name":"IJTETJournal","display_name":"IJTET Journal","profile_url":"https://ijtet.academia.edu/IJTETJournal?f_ri=11040","photo":"https://0.academia-photos.com/17574014/5069100/5814203/s65_ijtet.journal.jpg"}</script></span></span></li><li class="js-paper-rank-work_16731193 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="16731193"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 16731193, container: ".js-paper-rank-work_16731193", }); });</script></li><li class="js-percentile-work_16731193 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 16731193; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_16731193"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_16731193 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="16731193"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 16731193; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=16731193]").text(description); $(".js-view-count-work_16731193").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_16731193").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="16731193"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="190758" rel="nofollow" href="https://www.academia.edu/Documents/in/Verilog">Verilog</a>, <script data-card-contents-for-ri="190758" type="text/json">{"id":190758,"name":"Verilog","url":"https://www.academia.edu/Documents/in/Verilog?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="295820" rel="nofollow" href="https://www.academia.edu/Documents/in/NoC">NoC</a>, <script data-card-contents-for-ri="295820" type="text/json">{"id":295820,"name":"NoC","url":"https://www.academia.edu/Documents/in/NoC?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="1635646" rel="nofollow" href="https://www.academia.edu/Documents/in/Xilinx">Xilinx</a><script data-card-contents-for-ri="1635646" type="text/json">{"id":1635646,"name":"Xilinx","url":"https://www.academia.edu/Documents/in/Xilinx?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=16731193]'), work: {"id":16731193,"title":"Design and Implementation of Efficient Routers in NoC Application","created_at":"2015-10-13T03:31:44.784-07:00","url":"https://www.academia.edu/16731193/Design_and_Implementation_of_Efficient_Routers_in_NoC_Application?f_ri=11040","dom_id":"work_16731193","summary":"Abstract: - As innovation shrink, the force scattered by the connections of a network-on-chip (NoC) begins to imitate with the force dispersed by alternate components like as switches and the network interfaces (NIs).In this venture Cartesian switch is outlined keeping in mind the end goal to diminish the force dissipation. Cartesian switch is a composite of gatherer and arterials. A gatherer is a 'horizontal network' connecting authority switches, while a blood vessel is a 'vertical network' that divide gatherers. Authority switches has an east and a west port, connecting the switch to its gatherer, while blood vessel switches have sufficient ports to permit connection to its authorities and its arterials. To guarantee connectivity, a blood vessel is not allowed to diversion a gatherer. Every switch is given a location that indicate its location in Cartesian space (spoke to, for instance, utilizing scope and longitude); inside an authority, all gatherer switches offer common scope. At last we choose that the port transition of double information between the ports are proficient in NOC application for exchange the information rates in effective way and it additionally lessened Area of the switch. At long last the Cartesian switch will be actualized by utilizing FPGA Kit.","downloadable_attachments":[{"id":39151384,"asset_id":16731193,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":17574014,"first_name":"IJTET","last_name":"Journal","domain_name":"ijtet","page_name":"IJTETJournal","display_name":"IJTET Journal","profile_url":"https://ijtet.academia.edu/IJTETJournal?f_ri=11040","photo":"https://0.academia-photos.com/17574014/5069100/5814203/s65_ijtet.journal.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":190758,"name":"Verilog","url":"https://www.academia.edu/Documents/in/Verilog?f_ri=11040","nofollow":true},{"id":295820,"name":"NoC","url":"https://www.academia.edu/Documents/in/NoC?f_ri=11040","nofollow":true},{"id":1635646,"name":"Xilinx","url":"https://www.academia.edu/Documents/in/Xilinx?f_ri=11040","nofollow":true},{"id":2177368,"name":"Modelsim","url":"https://www.academia.edu/Documents/in/Modelsim?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_70331344" data-work_id="70331344" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/70331344/Region_based_routing_An_efficient_routing_mechanism_to_tackle_unreliable_hardware_in_network_on_chips">Region-based routing: An efficient routing mechanism to tackle unreliable hardware in network on chips</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The design of scalable and reliable interconnection net-works for System on Chips (SoCs) introduce new design constraints not present in current multicomputer systems. Although regular topologies are preferred for building NoCs,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_70331344" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The design of scalable and reliable interconnection net-works for System on Chips (SoCs) introduce new design constraints not present in current multicomputer systems. Although regular topologies are preferred for building NoCs, heterogeneous blocks, fabrication faults and reliabil-ity ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/70331344" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="334bca7d98a37e4c674694b9a17b961f" rel="nofollow" data-download="{"attachment_id":80129161,"asset_id":70331344,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80129161/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="64307088" href="https://independent.academia.edu/Andr%C3%A9BacaMejia">André Baca Mejia</a><script data-card-contents-for-user="64307088" type="text/json">{"id":64307088,"first_name":"André","last_name":"Baca Mejia","domain_name":"independent","page_name":"AndréBacaMejia","display_name":"André Baca Mejia","profile_url":"https://independent.academia.edu/Andr%C3%A9BacaMejia?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_70331344 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="70331344"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 70331344, container: ".js-paper-rank-work_70331344", }); });</script></li><li class="js-percentile-work_70331344 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 70331344; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_70331344"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_70331344 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="70331344"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 70331344; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=70331344]").text(description); $(".js-view-count-work_70331344").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_70331344").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="70331344"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">19</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="19145" rel="nofollow" href="https://www.academia.edu/Documents/in/Network_on_Chips">Network on Chips</a><script data-card-contents-for-ri="19145" type="text/json">{"id":19145,"name":"Network on Chips","url":"https://www.academia.edu/Documents/in/Network_on_Chips?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=70331344]'), work: {"id":70331344,"title":"Region-based routing: An efficient routing mechanism to tackle unreliable hardware in network on chips","created_at":"2022-02-03T10:24:29.150-08:00","url":"https://www.academia.edu/70331344/Region_based_routing_An_efficient_routing_mechanism_to_tackle_unreliable_hardware_in_network_on_chips?f_ri=11040","dom_id":"work_70331344","summary":"The design of scalable and reliable interconnection net-works for System on Chips (SoCs) introduce new design constraints not present in current multicomputer systems. Although regular topologies are preferred for building NoCs, heterogeneous blocks, fabrication faults and reliabil-ity ...","downloadable_attachments":[{"id":80129161,"asset_id":70331344,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":64307088,"first_name":"André","last_name":"Baca Mejia","domain_name":"independent","page_name":"AndréBacaMejia","display_name":"André Baca Mejia","profile_url":"https://independent.academia.edu/Andr%C3%A9BacaMejia?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":19145,"name":"Network on Chips","url":"https://www.academia.edu/Documents/in/Network_on_Chips?f_ri=11040","nofollow":true},{"id":91936,"name":"Hardware","url":"https://www.academia.edu/Documents/in/Hardware?f_ri=11040"},{"id":99572,"name":"System on Chip","url":"https://www.academia.edu/Documents/in/System_on_Chip?f_ri=11040"},{"id":136801,"name":"Fabrication","url":"https://www.academia.edu/Documents/in/Fabrication?f_ri=11040"},{"id":350868,"name":"Network Routing","url":"https://www.academia.edu/Documents/in/Network_Routing?f_ri=11040"},{"id":432786,"name":"System on a Chip","url":"https://www.academia.edu/Documents/in/System_on_a_Chip?f_ri=11040"},{"id":456909,"name":"Network on chip","url":"https://www.academia.edu/Documents/in/Network_on_chip?f_ri=11040"},{"id":459378,"name":"Very high throughput","url":"https://www.academia.edu/Documents/in/Very_high_throughput?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":609191,"name":"Logic Design","url":"https://www.academia.edu/Documents/in/Logic_Design?f_ri=11040"},{"id":676853,"name":"Networks on Chip","url":"https://www.academia.edu/Documents/in/Networks_on_Chip?f_ri=11040"},{"id":808173,"name":"Logic Gate","url":"https://www.academia.edu/Documents/in/Logic_Gate?f_ri=11040"},{"id":1128770,"name":"System on Chips","url":"https://www.academia.edu/Documents/in/System_on_Chips?f_ri=11040"},{"id":1259267,"name":"Switches","url":"https://www.academia.edu/Documents/in/Switches?f_ri=11040"},{"id":1396752,"name":"Network on a Chip","url":"https://www.academia.edu/Documents/in/Network_on_a_Chip?f_ri=11040"},{"id":3060221,"name":"link failure","url":"https://www.academia.edu/Documents/in/link_failure?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_52574125" data-work_id="52574125" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/52574125/Agro_sense_Precision_agriculture_using_sensor_based_wireless_mesh_networks">Agro-sense: Precision agriculture using sensor-based wireless mesh networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Advances in wireless personal area networks have made the practical deployment of various services possible, which until a few years ago was considered extremely costly or labor intensive. We build such a wireless sensor network for... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_52574125" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Advances in wireless personal area networks have made the practical deployment of various services possible, which until a few years ago was considered extremely costly or labor intensive. We build such a wireless sensor network for precision agriculture where real time data of the climatological and other environmental properties are sensed and relayed to a central repository. The architecture comprises of three distinct sections-(a) the sensor-nodes (b) the wireless mesh network and (c) the actuation components. The sensors are selected based on the properties suited for the most common crops and we identify four such attributes. The sensor network is based on the IEEE-802.15.4 standard and we develop a new static routing algorithm suited for the sensing application. The algorithm overrides the deficiency of the Hierarchical Routing scheme inherent in the ZigBee specification where the C skip addressing algorithm limits the possible depth of the network topology due to address wastage. The new algorithm maintains the hierarchical network topology and thus ensures routing at its optimal best. The algorithms for both addressing and routing are provided. The actuation components are also a part of mesh network and are activated wirelessly for controlling irrigation and fertigation.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/52574125" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="29651eac174ab634d8d7904739824229" rel="nofollow" data-download="{"attachment_id":69775888,"asset_id":52574125,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/69775888/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="8262028" href="https://independent.academia.edu/SomprakashBandyopadhyay">Somprakash Bandyopadhyay</a><script data-card-contents-for-user="8262028" type="text/json">{"id":8262028,"first_name":"Somprakash","last_name":"Bandyopadhyay","domain_name":"independent","page_name":"SomprakashBandyopadhyay","display_name":"Somprakash Bandyopadhyay","profile_url":"https://independent.academia.edu/SomprakashBandyopadhyay?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_52574125 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="52574125"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 52574125, container: ".js-paper-rank-work_52574125", }); });</script></li><li class="js-percentile-work_52574125 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 52574125; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_52574125"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_52574125 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="52574125"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 52574125; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=52574125]").text(description); $(".js-view-count-work_52574125").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_52574125").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="52574125"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="4731" rel="nofollow" href="https://www.academia.edu/Documents/in/Precision_Agriculture">Precision Agriculture</a>, <script data-card-contents-for-ri="4731" type="text/json">{"id":4731,"name":"Precision Agriculture","url":"https://www.academia.edu/Documents/in/Precision_Agriculture?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="9136" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_Sensor_Networks">Wireless Sensor Networks</a>, <script data-card-contents-for-ri="9136" type="text/json">{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="10225" rel="nofollow" href="https://www.academia.edu/Documents/in/Agriculture">Agriculture</a><script data-card-contents-for-ri="10225" type="text/json">{"id":10225,"name":"Agriculture","url":"https://www.academia.edu/Documents/in/Agriculture?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=52574125]'), work: {"id":52574125,"title":"Agro-sense: Precision agriculture using sensor-based wireless mesh networks","created_at":"2021-09-16T19:52:51.895-07:00","url":"https://www.academia.edu/52574125/Agro_sense_Precision_agriculture_using_sensor_based_wireless_mesh_networks?f_ri=11040","dom_id":"work_52574125","summary":"Advances in wireless personal area networks have made the practical deployment of various services possible, which until a few years ago was considered extremely costly or labor intensive. We build such a wireless sensor network for precision agriculture where real time data of the climatological and other environmental properties are sensed and relayed to a central repository. The architecture comprises of three distinct sections-(a) the sensor-nodes (b) the wireless mesh network and (c) the actuation components. The sensors are selected based on the properties suited for the most common crops and we identify four such attributes. The sensor network is based on the IEEE-802.15.4 standard and we develop a new static routing algorithm suited for the sensing application. The algorithm overrides the deficiency of the Hierarchical Routing scheme inherent in the ZigBee specification where the C skip addressing algorithm limits the possible depth of the network topology due to address wastage. The new algorithm maintains the hierarchical network topology and thus ensures routing at its optimal best. The algorithms for both addressing and routing are provided. The actuation components are also a part of mesh network and are activated wirelessly for controlling irrigation and fertigation.","downloadable_attachments":[{"id":69775888,"asset_id":52574125,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":8262028,"first_name":"Somprakash","last_name":"Bandyopadhyay","domain_name":"independent","page_name":"SomprakashBandyopadhyay","display_name":"Somprakash Bandyopadhyay","profile_url":"https://independent.academia.edu/SomprakashBandyopadhyay?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":4731,"name":"Precision Agriculture","url":"https://www.academia.edu/Documents/in/Precision_Agriculture?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true},{"id":10225,"name":"Agriculture","url":"https://www.academia.edu/Documents/in/Agriculture?f_ri=11040","nofollow":true},{"id":10297,"name":"Wireless Mesh Networks","url":"https://www.academia.edu/Documents/in/Wireless_Mesh_Networks?f_ri=11040"},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040"},{"id":142536,"name":"Crops","url":"https://www.academia.edu/Documents/in/Crops?f_ri=11040"},{"id":158569,"name":"Sensor Network","url":"https://www.academia.edu/Documents/in/Sensor_Network?f_ri=11040"},{"id":309737,"name":"Wireless Mesh Network","url":"https://www.academia.edu/Documents/in/Wireless_Mesh_Network?f_ri=11040"},{"id":524475,"name":"MESH NETWORK","url":"https://www.academia.edu/Documents/in/MESH_NETWORK?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":1211847,"name":"Wireless Sensor Network","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Network?f_ri=11040"},{"id":1605361,"name":"Sensor nodes","url":"https://www.academia.edu/Documents/in/Sensor_nodes?f_ri=11040"},{"id":1662955,"name":"Hierarchical Routing","url":"https://www.academia.edu/Documents/in/Hierarchical_Routing?f_ri=11040"},{"id":2729068,"name":"wireless personal area network (WPAN)","url":"https://www.academia.edu/Documents/in/wireless_personal_area_network_WPAN_?f_ri=11040"},{"id":3468642,"name":"Real Time Data","url":"https://www.academia.edu/Documents/in/Real_Time_Data?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3053233" data-work_id="3053233" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3053233/A_Responsive_Distributed_Routing_Algorithm_for_Computer_Networks">A Responsive Distributed Routing Algorithm for Computer Networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks. The major features of the algorithm are that the paths .defined do not form transient loops when... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_3053233" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks. The major features of the algorithm are that the paths .defined do not form transient loops when weights change and the number of steps required to find new shortest paths when network links fail is less than for previous algorithms. Specifically, the worst case recovery time is proportional to the largest number of hops h in any of the weighted shortest paths. For previous loop-free distributed algorithms this recovery time is proportional to h2.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3053233" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f62ab7a6fc699d6d7b28aaa71a773e5a" rel="nofollow" data-download="{"attachment_id":50495364,"asset_id":3053233,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50495364/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3510234" href="https://ldrp.academia.edu/patelnilam">patel nilam</a><script data-card-contents-for-user="3510234" type="text/json">{"id":3510234,"first_name":"patel","last_name":"nilam","domain_name":"ldrp","page_name":"patelnilam","display_name":"patel nilam","profile_url":"https://ldrp.academia.edu/patelnilam?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_3053233 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3053233"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3053233, container: ".js-paper-rank-work_3053233", }); });</script></li><li class="js-percentile-work_3053233 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3053233; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3053233"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3053233 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3053233"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3053233; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3053233]").text(description); $(".js-view-count-work_3053233").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3053233").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3053233"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="440" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="2658" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Algorithms">Distributed Algorithms</a>, <script data-card-contents-for-ri="2658" type="text/json">{"id":2658,"name":"Distributed Algorithms","url":"https://www.academia.edu/Documents/in/Distributed_Algorithms?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="4252" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Networks">Computer Networks</a>, <script data-card-contents-for-ri="4252" type="text/json">{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a><script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3053233]'), work: {"id":3053233,"title":"A Responsive Distributed Routing Algorithm for Computer Networks","created_at":"2013-03-18T14:48:58.983-07:00","url":"https://www.academia.edu/3053233/A_Responsive_Distributed_Routing_Algorithm_for_Computer_Networks?f_ri=11040","dom_id":"work_3053233","summary":"new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks. The major features of the algorithm are that the paths .defined do not form transient loops when weights change and the number of steps required to find new shortest paths when network links fail is less than for previous algorithms. Specifically, the worst case recovery time is proportional to the largest number of hops h in any of the weighted shortest paths. For previous loop-free distributed algorithms this recovery time is proportional to h2.","downloadable_attachments":[{"id":50495364,"asset_id":3053233,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3510234,"first_name":"patel","last_name":"nilam","domain_name":"ldrp","page_name":"patelnilam","display_name":"patel nilam","profile_url":"https://ldrp.academia.edu/patelnilam?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true},{"id":2658,"name":"Distributed Algorithms","url":"https://www.academia.edu/Documents/in/Distributed_Algorithms?f_ri=11040","nofollow":true},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040"},{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040"},{"id":64716,"name":"Distributed Processing","url":"https://www.academia.edu/Documents/in/Distributed_Processing?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":937133,"name":"Shortest Path","url":"https://www.academia.edu/Documents/in/Shortest_Path?f_ri=11040"},{"id":2537671,"name":"Distributed Algorithm","url":"https://www.academia.edu/Documents/in/Distributed_Algorithm?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28842582" data-work_id="28842582" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28842582/A_new_deadlock_free_fault_tolerant_routing_algorithm_for_NoC_interconnections">A new deadlock-free fault-tolerant routing algorithm for NoC interconnections</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper, we present a new deadlock-free fault-tolerant adaptive routing algorithm for the 2D mesh NoC interconnections. The main contribution of this routing algorithm is that it allows both, routing of messages in the networks... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_28842582" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper, we present a new deadlock-free fault-tolerant adaptive routing algorithm for the 2D mesh NoC interconnections. The main contribution of this routing algorithm is that it allows both, routing of messages in the networks incorporating the regions not necessarily rectangular, and routing to all nodes which are not completely blocked by faulty nodes. The proposed routing algorithm is based on a modified turn model and well known XY algorithm. We detail the basic principle of this routing algorithm, prove its deadlock freeness, its feasibility and efficiency through the simulation results.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28842582" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9ef085e6b261bc08ac5c27568fc78d0a" rel="nofollow" data-download="{"attachment_id":49262606,"asset_id":28842582,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49262606/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="54204118" href="https://univ-lorraine.academia.edu/SergeWeber">Serge Weber</a><script data-card-contents-for-user="54204118" type="text/json">{"id":54204118,"first_name":"Serge","last_name":"Weber","domain_name":"univ-lorraine","page_name":"SergeWeber","display_name":"Serge Weber","profile_url":"https://univ-lorraine.academia.edu/SergeWeber?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_28842582 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28842582"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28842582, container: ".js-paper-rank-work_28842582", }); });</script></li><li class="js-percentile-work_28842582 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28842582; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28842582"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28842582 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28842582"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28842582; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28842582]").text(description); $(".js-view-count-work_28842582").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28842582").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28842582"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="8252" rel="nofollow" href="https://www.academia.edu/Documents/in/Mesh_generation">Mesh generation</a>, <script data-card-contents-for-ri="8252" type="text/json">{"id":8252,"name":"Mesh generation","url":"https://www.academia.edu/Documents/in/Mesh_generation?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="36300" rel="nofollow" href="https://www.academia.edu/Documents/in/Fault_Tolerance">Fault Tolerance</a>, <script data-card-contents-for-ri="36300" type="text/json">{"id":36300,"name":"Fault Tolerance","url":"https://www.academia.edu/Documents/in/Fault_Tolerance?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="304351" rel="nofollow" href="https://www.academia.edu/Documents/in/Adaptive_Routing">Adaptive Routing</a><script data-card-contents-for-ri="304351" type="text/json">{"id":304351,"name":"Adaptive Routing","url":"https://www.academia.edu/Documents/in/Adaptive_Routing?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28842582]'), work: {"id":28842582,"title":"A new deadlock-free fault-tolerant routing algorithm for NoC interconnections","created_at":"2016-10-01T03:12:20.942-07:00","url":"https://www.academia.edu/28842582/A_new_deadlock_free_fault_tolerant_routing_algorithm_for_NoC_interconnections?f_ri=11040","dom_id":"work_28842582","summary":"In this paper, we present a new deadlock-free fault-tolerant adaptive routing algorithm for the 2D mesh NoC interconnections. The main contribution of this routing algorithm is that it allows both, routing of messages in the networks incorporating the regions not necessarily rectangular, and routing to all nodes which are not completely blocked by faulty nodes. The proposed routing algorithm is based on a modified turn model and well known XY algorithm. We detail the basic principle of this routing algorithm, prove its deadlock freeness, its feasibility and efficiency through the simulation results.","downloadable_attachments":[{"id":49262606,"asset_id":28842582,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":54204118,"first_name":"Serge","last_name":"Weber","domain_name":"univ-lorraine","page_name":"SergeWeber","display_name":"Serge Weber","profile_url":"https://univ-lorraine.academia.edu/SergeWeber?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":8252,"name":"Mesh generation","url":"https://www.academia.edu/Documents/in/Mesh_generation?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":36300,"name":"Fault Tolerance","url":"https://www.academia.edu/Documents/in/Fault_Tolerance?f_ri=11040","nofollow":true},{"id":304351,"name":"Adaptive Routing","url":"https://www.academia.edu/Documents/in/Adaptive_Routing?f_ri=11040","nofollow":true},{"id":350868,"name":"Network Routing","url":"https://www.academia.edu/Documents/in/Network_Routing?f_ri=11040"},{"id":456909,"name":"Network on chip","url":"https://www.academia.edu/Documents/in/Network_on_chip?f_ri=11040"},{"id":813981,"name":"Fault Tolerant","url":"https://www.academia.edu/Documents/in/Fault_Tolerant?f_ri=11040"},{"id":1032196,"name":"Fault Tolerant Routing","url":"https://www.academia.edu/Documents/in/Fault_Tolerant_Routing?f_ri=11040"},{"id":1952469,"name":"Wormhole routing","url":"https://www.academia.edu/Documents/in/Wormhole_routing?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_8078478" data-work_id="8078478" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/8078478/GOAL_A_Load_Balanced_Adaptive_Routing_Algorithm_for_Torus_Networks">GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL -Globally Oblivious Adaptive Locally -that provides high throughput on adversarial traffic patterns, matching or exceeding fully randomized routing and... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_8078478" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL -Globally Oblivious Adaptive Locally -that provides high throughput on adversarial traffic patterns, matching or exceeding fully randomized routing and exceeding the worst-case performance of Chaos , RLB [14], and minimal routing [8] by more than 40%. GOAL also preserves locality to provide up to 4.6× the throughput of fully randomized routing [19] on local traffic. GOAL achieves global load balance by randomly choosing the direction to route in each dimension. Local load balance is then achieved by routing in the selected directions adaptively. We compare the throughput, latency, stability and hot-spot performance of GOAL to six previously published routing algorithms on six specific traffic patterns and 1,000 randomly generated permutations.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/8078478" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1f90bd5b892aa7ef626b65e8460ab25d" rel="nofollow" data-download="{"attachment_id":34530878,"asset_id":8078478,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/34530878/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="15612328" href="https://independent.academia.edu/arjunsingh56">arjun singh</a><script data-card-contents-for-user="15612328" type="text/json">{"id":15612328,"first_name":"arjun","last_name":"singh","domain_name":"independent","page_name":"arjunsingh56","display_name":"arjun singh","profile_url":"https://independent.academia.edu/arjunsingh56?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_8078478 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="8078478"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 8078478, container: ".js-paper-rank-work_8078478", }); });</script></li><li class="js-percentile-work_8078478 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 8078478; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_8078478"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_8078478 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="8078478"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 8078478; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=8078478]").text(description); $(".js-view-count-work_8078478").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_8078478").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="8078478"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="9742" rel="nofollow" href="https://www.academia.edu/Documents/in/Resource_Allocation">Resource Allocation</a>, <script data-card-contents-for-ri="9742" type="text/json">{"id":9742,"name":"Resource Allocation","url":"https://www.academia.edu/Documents/in/Resource_Allocation?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="25600" rel="nofollow" href="https://www.academia.edu/Documents/in/Stability">Stability</a><script data-card-contents-for-ri="25600" type="text/json">{"id":25600,"name":"Stability","url":"https://www.academia.edu/Documents/in/Stability?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=8078478]'), work: {"id":8078478,"title":"GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks","created_at":"2014-08-25T04:36:50.621-07:00","url":"https://www.academia.edu/8078478/GOAL_A_Load_Balanced_Adaptive_Routing_Algorithm_for_Torus_Networks?f_ri=11040","dom_id":"work_8078478","summary":"We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL -Globally Oblivious Adaptive Locally -that provides high throughput on adversarial traffic patterns, matching or exceeding fully randomized routing and exceeding the worst-case performance of Chaos , RLB [14], and minimal routing [8] by more than 40%. GOAL also preserves locality to provide up to 4.6× the throughput of fully randomized routing [19] on local traffic. GOAL achieves global load balance by randomly choosing the direction to route in each dimension. Local load balance is then achieved by routing in the selected directions adaptively. We compare the throughput, latency, stability and hot-spot performance of GOAL to six previously published routing algorithms on six specific traffic patterns and 1,000 randomly generated permutations.","downloadable_attachments":[{"id":34530878,"asset_id":8078478,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":15612328,"first_name":"arjun","last_name":"singh","domain_name":"independent","page_name":"arjunsingh56","display_name":"arjun singh","profile_url":"https://independent.academia.edu/arjunsingh56?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":9742,"name":"Resource Allocation","url":"https://www.academia.edu/Documents/in/Resource_Allocation?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":25600,"name":"Stability","url":"https://www.academia.edu/Documents/in/Stability?f_ri=11040","nofollow":true},{"id":155958,"name":"Pattern Matching","url":"https://www.academia.edu/Documents/in/Pattern_Matching?f_ri=11040"},{"id":198557,"name":"Throughput","url":"https://www.academia.edu/Documents/in/Throughput?f_ri=11040"},{"id":304351,"name":"Adaptive Routing","url":"https://www.academia.edu/Documents/in/Adaptive_Routing?f_ri=11040"},{"id":342071,"name":"Hot Spot","url":"https://www.academia.edu/Documents/in/Hot_Spot?f_ri=11040"},{"id":350868,"name":"Network Routing","url":"https://www.academia.edu/Documents/in/Network_Routing?f_ri=11040"},{"id":459378,"name":"Very high throughput","url":"https://www.academia.edu/Documents/in/Very_high_throughput?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":545424,"name":"Load Balance","url":"https://www.academia.edu/Documents/in/Load_Balance?f_ri=11040"},{"id":1259267,"name":"Switches","url":"https://www.academia.edu/Documents/in/Switches?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1968660" data-work_id="1968660" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1968660/Packet_routing_in_dynamically_changing_networks_A_reinforcement_learning_approach">Packet routing in dynamically changing networks: A reinforcement learning approach</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1968660" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="de1b7be0f3cc50640f3e2b31c369b646" rel="nofollow" data-download="{"attachment_id":30925165,"asset_id":1968660,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/30925165/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="2563322" href="https://vtu-in.academia.edu/parashuramBS">parashuram B S</a><script data-card-contents-for-user="2563322" type="text/json">{"id":2563322,"first_name":"parashuram","last_name":"B S","domain_name":"vtu-in","page_name":"parashuramBS","display_name":"parashuram B S","profile_url":"https://vtu-in.academia.edu/parashuramBS?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_1968660 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1968660"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1968660, container: ".js-paper-rank-work_1968660", }); });</script></li><li class="js-percentile-work_1968660 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1968660; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1968660"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1968660 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1968660"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1968660; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1968660]").text(description); $(".js-view-count-work_1968660").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1968660").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1968660"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="1688" rel="nofollow" href="https://www.academia.edu/Documents/in/Reinforcement_Learning">Reinforcement Learning</a>, <script data-card-contents-for-ri="1688" type="text/json">{"id":1688,"name":"Reinforcement Learning","url":"https://www.academia.edu/Documents/in/Reinforcement_Learning?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a><script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1968660]'), work: {"id":1968660,"title":"Packet routing in dynamically changing networks: A reinforcement learning approach","created_at":"2012-09-25T14:20:16.419-07:00","url":"https://www.academia.edu/1968660/Packet_routing_in_dynamically_changing_networks_A_reinforcement_learning_approach?f_ri=11040","dom_id":"work_1968660","summary":null,"downloadable_attachments":[{"id":30925165,"asset_id":1968660,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":2563322,"first_name":"parashuram","last_name":"B S","domain_name":"vtu-in","page_name":"parashuramBS","display_name":"parashuram B S","profile_url":"https://vtu-in.academia.edu/parashuramBS?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true},{"id":1688,"name":"Reinforcement Learning","url":"https://www.academia.edu/Documents/in/Reinforcement_Learning?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":13845,"name":"Time Use","url":"https://www.academia.edu/Documents/in/Time_Use?f_ri=11040"},{"id":99572,"name":"System on Chip","url":"https://www.academia.edu/Documents/in/System_on_Chip?f_ri=11040"},{"id":350868,"name":"Network Routing","url":"https://www.academia.edu/Documents/in/Network_Routing?f_ri=11040"},{"id":371285,"name":"Local Community","url":"https://www.academia.edu/Documents/in/Local_Community?f_ri=11040"},{"id":413301,"name":"Perforation","url":"https://www.academia.edu/Documents/in/Perforation?f_ri=11040"},{"id":456909,"name":"Network on chip","url":"https://www.academia.edu/Documents/in/Network_on_chip?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":937133,"name":"Shortest Path","url":"https://www.academia.edu/Documents/in/Shortest_Path?f_ri=11040"},{"id":1208322,"name":"Neural Information Processing","url":"https://www.academia.edu/Documents/in/Neural_Information_Processing?f_ri=11040"},{"id":1365949,"name":"Intelligent Networks","url":"https://www.academia.edu/Documents/in/Intelligent_Networks?f_ri=11040"},{"id":1396752,"name":"Network on a Chip","url":"https://www.academia.edu/Documents/in/Network_on_a_Chip?f_ri=11040"},{"id":2472817,"name":"Packet Routing","url":"https://www.academia.edu/Documents/in/Packet_Routing?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11845633" data-work_id="11845633" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11845633/A_modular_router_architecture_desgin_for_Network_on_Chip">A modular router architecture desgin for Network on Chip</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Network on Chip is an efficient on-chip communication architecture for SoC architectures. It enables the integration of a large number of computational and storage blocks on a single chip. The router is the basic element of NoC with... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_11845633" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Network on Chip is an efficient on-chip communication architecture for SoC architectures. It enables the integration of a large number of computational and storage blocks on a single chip. The router is the basic element of NoC with multiple, connecting to other router and to a local IP core. This router architecture can be used later for building a NoC with standard or arbitrary topology with low latency and high speed and High maximal peak performance. The low latency and high speed is achieved by allowing for each input port a routing function which runs in parallel with Link controler and with distributed arbiters. To evaluate our approach, A wormhole input queued 2-D mesh router was created to verify the capability of our router. Various parameterized designs were synthesized to provide a comparative study with other implementations in FPGA thechnology, with different flit size.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11845633" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="66323001cd011c5900955539a6b781b5" rel="nofollow" data-download="{"attachment_id":46489957,"asset_id":11845633,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46489957/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="29235480" href="https://independent.academia.edu/AbdelkrimZitouni">Abdelkrim Zitouni</a><script data-card-contents-for-user="29235480" type="text/json">{"id":29235480,"first_name":"Abdelkrim","last_name":"Zitouni","domain_name":"independent","page_name":"AbdelkrimZitouni","display_name":"Abdelkrim Zitouni","profile_url":"https://independent.academia.edu/AbdelkrimZitouni?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_11845633 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11845633"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11845633, container: ".js-paper-rank-work_11845633", }); });</script></li><li class="js-percentile-work_11845633 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11845633; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11845633"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11845633 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11845633"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11845633; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11845633]").text(description); $(".js-view-count-work_11845633").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11845633").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11845633"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">17</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="433" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Architecture">Computer Architecture</a>, <script data-card-contents-for-ri="433" type="text/json">{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="14604" rel="nofollow" href="https://www.academia.edu/Documents/in/Flow_Control">Flow Control</a><script data-card-contents-for-ri="14604" type="text/json">{"id":14604,"name":"Flow Control","url":"https://www.academia.edu/Documents/in/Flow_Control?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11845633]'), work: {"id":11845633,"title":"A modular router architecture desgin for Network on Chip","created_at":"2015-04-08T04:10:09.061-07:00","url":"https://www.academia.edu/11845633/A_modular_router_architecture_desgin_for_Network_on_Chip?f_ri=11040","dom_id":"work_11845633","summary":"Network on Chip is an efficient on-chip communication architecture for SoC architectures. It enables the integration of a large number of computational and storage blocks on a single chip. The router is the basic element of NoC with multiple, connecting to other router and to a local IP core. This router architecture can be used later for building a NoC with standard or arbitrary topology with low latency and high speed and High maximal peak performance. The low latency and high speed is achieved by allowing for each input port a routing function which runs in parallel with Link controler and with distributed arbiters. To evaluate our approach, A wormhole input queued 2-D mesh router was created to verify the capability of our router. Various parameterized designs were synthesized to provide a comparative study with other implementations in FPGA thechnology, with different flit size.","downloadable_attachments":[{"id":46489957,"asset_id":11845633,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":29235480,"first_name":"Abdelkrim","last_name":"Zitouni","domain_name":"independent","page_name":"AbdelkrimZitouni","display_name":"Abdelkrim Zitouni","profile_url":"https://independent.academia.edu/AbdelkrimZitouni?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":14604,"name":"Flow Control","url":"https://www.academia.edu/Documents/in/Flow_Control?f_ri=11040","nofollow":true},{"id":15118,"name":"Topology","url":"https://www.academia.edu/Documents/in/Topology?f_ri=11040"},{"id":17194,"name":"Field-Programmable Gate Arrays","url":"https://www.academia.edu/Documents/in/Field-Programmable_Gate_Arrays?f_ri=11040"},{"id":23890,"name":"Comparative Study","url":"https://www.academia.edu/Documents/in/Comparative_Study?f_ri=11040"},{"id":99572,"name":"System on Chip","url":"https://www.academia.edu/Documents/in/System_on_Chip?f_ri=11040"},{"id":317745,"name":"High Speed","url":"https://www.academia.edu/Documents/in/High_Speed?f_ri=11040"},{"id":322954,"name":"Chip","url":"https://www.academia.edu/Documents/in/Chip?f_ri=11040"},{"id":432786,"name":"System on a Chip","url":"https://www.academia.edu/Documents/in/System_on_a_Chip?f_ri=11040"},{"id":456909,"name":"Network on chip","url":"https://www.academia.edu/Documents/in/Network_on_chip?f_ri=11040"},{"id":469133,"name":"Signals and Systems","url":"https://www.academia.edu/Documents/in/Signals_and_Systems?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":644548,"name":"Low Latency","url":"https://www.academia.edu/Documents/in/Low_Latency?f_ri=11040"},{"id":1259267,"name":"Switches","url":"https://www.academia.edu/Documents/in/Switches?f_ri=11040"},{"id":2257662,"name":"Network Interface","url":"https://www.academia.edu/Documents/in/Network_Interface?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10305717" data-work_id="10305717" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10305717/A_Hybrid_Algorithm_for_Dynamic_Lightpath_Protection_in_Survivable_WDM_Optical_Networks">A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_10305717" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this paper, we propose a novel hybrid algorithm for this problem based on a combination of the mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report diverse routes into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without requiring the time consuming process associated with current GA-based lightpath protection schemes. We furthermore improve the performance of our algorithm by introducing a more advanced fitness function. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieve a significantly lower blocking probability and a smaller execution time than the conventional survivable routing algorithms.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10305717" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1d212b2920b48f9b7d63b9a1ae5f37eb" rel="nofollow" data-download="{"attachment_id":47444852,"asset_id":10305717,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47444852/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="25253314" href="https://independent.academia.edu/VINHLE27">VINH LE</a><script data-card-contents-for-user="25253314" type="text/json">{"id":25253314,"first_name":"VINH","last_name":"LE","domain_name":"independent","page_name":"VINHLE27","display_name":"VINH LE","profile_url":"https://independent.academia.edu/VINHLE27?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_10305717 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10305717"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10305717, container: ".js-paper-rank-work_10305717", }); });</script></li><li class="js-percentile-work_10305717 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10305717; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10305717"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10305717 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10305717"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10305717; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10305717]").text(description); $(".js-view-count-work_10305717").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10305717").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10305717"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="5026" rel="nofollow" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="8218" rel="nofollow" href="https://www.academia.edu/Documents/in/Networks">Networks</a>, <script data-card-contents-for-ri="8218" type="text/json">{"id":8218,"name":"Networks","url":"https://www.academia.edu/Documents/in/Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" rel="nofollow" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a><script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10305717]'), work: {"id":10305717,"title":"A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks","created_at":"2015-01-23T19:18:47.311-08:00","url":"https://www.academia.edu/10305717/A_Hybrid_Algorithm_for_Dynamic_Lightpath_Protection_in_Survivable_WDM_Optical_Networks?f_ri=11040","dom_id":"work_10305717","summary":"Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this paper, we propose a novel hybrid algorithm for this problem based on a combination of the mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report diverse routes into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without requiring the time consuming process associated with current GA-based lightpath protection schemes. We furthermore improve the performance of our algorithm by introducing a more advanced fitness function. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieve a significantly lower blocking probability and a smaller execution time than the conventional survivable routing algorithms.","downloadable_attachments":[{"id":47444852,"asset_id":10305717,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":25253314,"first_name":"VINH","last_name":"LE","domain_name":"independent","page_name":"VINHLE27","display_name":"VINH LE","profile_url":"https://independent.academia.edu/VINHLE27?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=11040","nofollow":true},{"id":8218,"name":"Networks","url":"https://www.academia.edu/Documents/in/Networks?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=11040","nofollow":true},{"id":201165,"name":"Mobile Agents","url":"https://www.academia.edu/Documents/in/Mobile_Agents?f_ri=11040"},{"id":323690,"name":"Hybrid Algorithm","url":"https://www.academia.edu/Documents/in/Hybrid_Algorithm?f_ri=11040"},{"id":421837,"name":"Wavelength Division Multiplexing","url":"https://www.academia.edu/Documents/in/Wavelength_Division_Multiplexing?f_ri=11040"},{"id":423253,"name":"Mobile Agent","url":"https://www.academia.edu/Documents/in/Mobile_Agent?f_ri=11040"},{"id":501386,"name":"Fitness Function","url":"https://www.academia.edu/Documents/in/Fitness_Function?f_ri=11040"},{"id":509785,"name":"Simulation Study","url":"https://www.academia.edu/Documents/in/Simulation_Study?f_ri=11040"},{"id":599267,"name":"Blocking Probability","url":"https://www.academia.edu/Documents/in/Blocking_Probability?f_ri=11040"},{"id":1127947,"name":"Network Simulator","url":"https://www.academia.edu/Documents/in/Network_Simulator?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_13141007 coauthored" data-work_id="13141007" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/13141007/Self_adapting_maxflow_routing_algorithm_for_WSNs_Practical_issues_and_simulation_based_assessment">Self-adapting maxflow routing algorithm for WSNs: Practical issues and simulation-based assessment</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/13141007" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="dded370073bcd5edbfa967a728afdfd4" rel="nofollow" data-download="{"attachment_id":45639128,"asset_id":13141007,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/45639128/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="32395304" href="https://independent.academia.edu/AndreaSeraghiti">Andrea Seraghiti</a><script data-card-contents-for-user="32395304" type="text/json">{"id":32395304,"first_name":"Andrea","last_name":"Seraghiti","domain_name":"independent","page_name":"AndreaSeraghiti","display_name":"Andrea Seraghiti","profile_url":"https://independent.academia.edu/AndreaSeraghiti?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-13141007">+1</span><div class="hidden js-additional-users-13141007"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://urbinoc.academia.edu/AlessandroBogliolo">Alessandro Bogliolo</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-13141007'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-13141007').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_13141007 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="13141007"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 13141007, container: ".js-paper-rank-work_13141007", }); });</script></li><li class="js-percentile-work_13141007 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 13141007; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_13141007"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_13141007 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="13141007"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 13141007; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=13141007]").text(description); $(".js-view-count-work_13141007").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_13141007").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="13141007"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="47838" rel="nofollow" href="https://www.academia.edu/Documents/in/Energy_Harvesting">Energy Harvesting</a>, <script data-card-contents-for-ri="47838" type="text/json">{"id":47838,"name":"Energy Harvesting","url":"https://www.academia.edu/Documents/in/Energy_Harvesting?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="127578" rel="nofollow" href="https://www.academia.edu/Documents/in/Resource_Limitation">Resource Limitation</a><script data-card-contents-for-ri="127578" type="text/json">{"id":127578,"name":"Resource Limitation","url":"https://www.academia.edu/Documents/in/Resource_Limitation?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=13141007]'), work: {"id":13141007,"title":"Self-adapting maxflow routing algorithm for WSNs: Practical issues and simulation-based assessment","created_at":"2015-06-21T03:53:48.372-07:00","url":"https://www.academia.edu/13141007/Self_adapting_maxflow_routing_algorithm_for_WSNs_Practical_issues_and_simulation_based_assessment?f_ri=11040","dom_id":"work_13141007","summary":null,"downloadable_attachments":[{"id":45639128,"asset_id":13141007,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":32395304,"first_name":"Andrea","last_name":"Seraghiti","domain_name":"independent","page_name":"AndreaSeraghiti","display_name":"Andrea Seraghiti","profile_url":"https://independent.academia.edu/AndreaSeraghiti?f_ri=11040","photo":"/images/s65_no_pic.png"},{"id":693728,"first_name":"Alessandro","last_name":"Bogliolo","domain_name":"urbinoc","page_name":"AlessandroBogliolo","display_name":"Alessandro Bogliolo","profile_url":"https://urbinoc.academia.edu/AlessandroBogliolo?f_ri=11040","photo":"https://0.academia-photos.com/693728/774701/35451835/s65_alessandro.bogliolo.jpg"}],"research_interests":[{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":47838,"name":"Energy Harvesting","url":"https://www.academia.edu/Documents/in/Energy_Harvesting?f_ri=11040","nofollow":true},{"id":127578,"name":"Resource Limitation","url":"https://www.academia.edu/Documents/in/Resource_Limitation?f_ri=11040","nofollow":true},{"id":382550,"name":"Wireless Sensor","url":"https://www.academia.edu/Documents/in/Wireless_Sensor?f_ri=11040"},{"id":476526,"name":"Data Flow Diagram","url":"https://www.academia.edu/Documents/in/Data_Flow_Diagram?f_ri=11040"},{"id":477865,"name":"Operant Conditioning","url":"https://www.academia.edu/Documents/in/Operant_Conditioning?f_ri=11040"},{"id":585047,"name":"Maxflow","url":"https://www.academia.edu/Documents/in/Maxflow?f_ri=11040"},{"id":1211847,"name":"Wireless Sensor Network","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Network?f_ri=11040"},{"id":1480215,"name":"Time varying","url":"https://www.academia.edu/Documents/in/Time_varying?f_ri=11040"},{"id":1605361,"name":"Sensor nodes","url":"https://www.academia.edu/Documents/in/Sensor_nodes?f_ri=11040"},{"id":2141485,"name":"Capacity constraint","url":"https://www.academia.edu/Documents/in/Capacity_constraint?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_20769070" data-work_id="20769070" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/20769070/ONALIN_Ontology_and_Algorithm_for_Indoor_Routing">ONALIN: Ontology and Algorithm for Indoor Routing</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Much research has recently been devoted to developing approaches, techniques, and technologies which assist people with navigation within buildings. Routing is an essential technique often requested by users prior to real-time navigation,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_20769070" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Much research has recently been devoted to developing approaches, techniques, and technologies which assist people with navigation within buildings. Routing is an essential technique often requested by users prior to real-time navigation, providing them with appropriate routes within buildings. A survey of the literature reveals indoor routing approaches primarily based on shortest distance or fastest travel time as the main criteria. However, such routing criteria that are common in outdoor navigation may not be as applicable to indoor navigation. Presenting users with appropriate indoor routes could be beneficial to many users in various situations. For example, people with physical, cognitive, or sensory impairments may need routes that take into account their special needs as well as preferences rather than ones that are shortest or fastest. In this paper, we present a new ontology and an algorithm (ONALIN) that provides routing for individuals with various needs and preferences. To this end, ONALIN takes the ADA (American Disability Act) standards, among other requirements, into consideration. An indoor routing algorithm based on this ontology is presented and analyzed in detail where it first finds feasible routes with respect to the special needs of the users and then from those will select the comfortable routes.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/20769070" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d57608437e0e98a76680a2b973fee08d" rel="nofollow" data-download="{"attachment_id":41551908,"asset_id":20769070,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41551908/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="42055858" href="https://independent.academia.edu/PDudas">Patrick Dudas</a><script data-card-contents-for-user="42055858" type="text/json">{"id":42055858,"first_name":"Patrick","last_name":"Dudas","domain_name":"independent","page_name":"PDudas","display_name":"Patrick Dudas","profile_url":"https://independent.academia.edu/PDudas?f_ri=11040","photo":"https://gravatar.com/avatar/0bfac31793d4e3dcccfd067dcd2add76?s=65"}</script></span></span></li><li class="js-paper-rank-work_20769070 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="20769070"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 20769070, container: ".js-paper-rank-work_20769070", }); });</script></li><li class="js-percentile-work_20769070 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 20769070; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_20769070"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_20769070 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="20769070"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 20769070; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=20769070]").text(description); $(".js-view-count-work_20769070").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_20769070").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="20769070"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="229390" rel="nofollow" href="https://www.academia.edu/Documents/in/Real_Time">Real Time</a>, <script data-card-contents-for-ri="229390" type="text/json">{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="234951" rel="nofollow" href="https://www.academia.edu/Documents/in/Travel_Time">Travel Time</a>, <script data-card-contents-for-ri="234951" type="text/json">{"id":234951,"name":"Travel Time","url":"https://www.academia.edu/Documents/in/Travel_Time?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="277912" rel="nofollow" href="https://www.academia.edu/Documents/in/Special_Needs">Special Needs</a><script data-card-contents-for-ri="277912" type="text/json">{"id":277912,"name":"Special Needs","url":"https://www.academia.edu/Documents/in/Special_Needs?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=20769070]'), work: {"id":20769070,"title":"ONALIN: Ontology and Algorithm for Indoor Routing","created_at":"2016-01-25T04:30:49.020-08:00","url":"https://www.academia.edu/20769070/ONALIN_Ontology_and_Algorithm_for_Indoor_Routing?f_ri=11040","dom_id":"work_20769070","summary":"Much research has recently been devoted to developing approaches, techniques, and technologies which assist people with navigation within buildings. Routing is an essential technique often requested by users prior to real-time navigation, providing them with appropriate routes within buildings. A survey of the literature reveals indoor routing approaches primarily based on shortest distance or fastest travel time as the main criteria. However, such routing criteria that are common in outdoor navigation may not be as applicable to indoor navigation. Presenting users with appropriate indoor routes could be beneficial to many users in various situations. For example, people with physical, cognitive, or sensory impairments may need routes that take into account their special needs as well as preferences rather than ones that are shortest or fastest. In this paper, we present a new ontology and an algorithm (ONALIN) that provides routing for individuals with various needs and preferences. To this end, ONALIN takes the ADA (American Disability Act) standards, among other requirements, into consideration. An indoor routing algorithm based on this ontology is presented and analyzed in detail where it first finds feasible routes with respect to the special needs of the users and then from those will select the comfortable routes.","downloadable_attachments":[{"id":41551908,"asset_id":20769070,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":42055858,"first_name":"Patrick","last_name":"Dudas","domain_name":"independent","page_name":"PDudas","display_name":"Patrick Dudas","profile_url":"https://independent.academia.edu/PDudas?f_ri=11040","photo":"https://gravatar.com/avatar/0bfac31793d4e3dcccfd067dcd2add76?s=65"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=11040","nofollow":true},{"id":234951,"name":"Travel Time","url":"https://www.academia.edu/Documents/in/Travel_Time?f_ri=11040","nofollow":true},{"id":277912,"name":"Special Needs","url":"https://www.academia.edu/Documents/in/Special_Needs?f_ri=11040","nofollow":true},{"id":312654,"name":"Mobile Data Management","url":"https://www.academia.edu/Documents/in/Mobile_Data_Management?f_ri=11040"},{"id":339653,"name":"Design for All","url":"https://www.academia.edu/Documents/in/Design_for_All?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3084830" data-work_id="3084830" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3084830/Ant_Colony_Optimization_for_traffic_dispersion_routing">Ant Colony Optimization for traffic dispersion routing</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Ant Colony Optimization (ACO) has proven to be a very powerful optimization heuristic for combinatorial optimization problems. This paper introduces a new type of ACO algorithm that will be used for routing along multiple routes in a... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_3084830" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Ant Colony Optimization (ACO) has proven to be a very powerful optimization heuristic for combinatorial optimization problems. This paper introduces a new type of ACO algorithm that will be used for routing along multiple routes in a network as opposed to optimizing a single route. Contrary to traditional routing algorithms, the Ant Dispersion Routing (ADR) algorithm has the objective of determining recommended routes for every driver in the network, in order to increase network efficiency. We present the framework for the new ADR algorithm, as well as the design of a new cost function that translates the motivations and objectives of the algorithm. The proposed approach is illustrated with a small simulation-based case study for the Singapore Expressway Network.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3084830" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="454b8dea3f9109a18bac762d0c014dd1" rel="nofollow" data-download="{"attachment_id":50476123,"asset_id":3084830,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50476123/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3299305" href="https://tudelft.academia.edu/RobertBabuska">Robert Babuska</a><script data-card-contents-for-user="3299305" type="text/json">{"id":3299305,"first_name":"Robert","last_name":"Babuska","domain_name":"tudelft","page_name":"RobertBabuska","display_name":"Robert Babuska","profile_url":"https://tudelft.academia.edu/RobertBabuska?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_3084830 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3084830"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3084830, container: ".js-paper-rank-work_3084830", }); });</script></li><li class="js-percentile-work_3084830 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3084830; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3084830"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3084830 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3084830"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3084830; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3084830]").text(description); $(".js-view-count-work_3084830").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3084830").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3084830"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="6420" rel="nofollow" href="https://www.academia.edu/Documents/in/Ant_Colony_Optimization">Ant Colony Optimization</a>, <script data-card-contents-for-ri="6420" type="text/json">{"id":6420,"name":"Ant Colony Optimization","url":"https://www.academia.edu/Documents/in/Ant_Colony_Optimization?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="10432" rel="nofollow" href="https://www.academia.edu/Documents/in/Transportation">Transportation</a>, <script data-card-contents-for-ri="10432" type="text/json">{"id":10432,"name":"Transportation","url":"https://www.academia.edu/Documents/in/Transportation?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="96047" rel="nofollow" href="https://www.academia.edu/Documents/in/Case_Study">Case Study</a><script data-card-contents-for-ri="96047" type="text/json">{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3084830]'), work: {"id":3084830,"title":"Ant Colony Optimization for traffic dispersion routing","created_at":"2013-03-22T21:56:58.407-07:00","url":"https://www.academia.edu/3084830/Ant_Colony_Optimization_for_traffic_dispersion_routing?f_ri=11040","dom_id":"work_3084830","summary":"Ant Colony Optimization (ACO) has proven to be a very powerful optimization heuristic for combinatorial optimization problems. This paper introduces a new type of ACO algorithm that will be used for routing along multiple routes in a network as opposed to optimizing a single route. Contrary to traditional routing algorithms, the Ant Dispersion Routing (ADR) algorithm has the objective of determining recommended routes for every driver in the network, in order to increase network efficiency. We present the framework for the new ADR algorithm, as well as the design of a new cost function that translates the motivations and objectives of the algorithm. The proposed approach is illustrated with a small simulation-based case study for the Singapore Expressway Network.","downloadable_attachments":[{"id":50476123,"asset_id":3084830,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3299305,"first_name":"Robert","last_name":"Babuska","domain_name":"tudelft","page_name":"RobertBabuska","display_name":"Robert Babuska","profile_url":"https://tudelft.academia.edu/RobertBabuska?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":6420,"name":"Ant Colony Optimization","url":"https://www.academia.edu/Documents/in/Ant_Colony_Optimization?f_ri=11040","nofollow":true},{"id":10432,"name":"Transportation","url":"https://www.academia.edu/Documents/in/Transportation?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=11040","nofollow":true},{"id":687889,"name":"Power Optimization","url":"https://www.academia.edu/Documents/in/Power_Optimization?f_ri=11040"},{"id":1003508,"name":"Cost Function","url":"https://www.academia.edu/Documents/in/Cost_Function?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_22596249" data-work_id="22596249" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/22596249/A_review_of_constraint_based_routing_algorithms">A review of constraint-based routing algorithms</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Constraint-based routing is an invaluable part of a full-ßedged Quality of Service (QoS) architecture. Unfortunately, routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_22596249" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Constraint-based routing is an invaluable part of a full-ßedged Quality of Service (QoS) architecture. Unfortunately, routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. Although at times an overview of QoS algorithms has been published, a comparative study to the performance of QoS algorithms is still missing. With this paper we attempt to Þll this gap.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/22596249" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7dbadd3f4303d1ac9165b7ff86ad74f5" rel="nofollow" data-download="{"attachment_id":43198768,"asset_id":22596249,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43198768/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="44151462" href="https://independent.academia.edu/PietVanMieghem">Piet Van Mieghem</a><script data-card-contents-for-user="44151462" type="text/json">{"id":44151462,"first_name":"Piet Van","last_name":"Mieghem","domain_name":"independent","page_name":"PietVanMieghem","display_name":"Piet Van Mieghem","profile_url":"https://independent.academia.edu/PietVanMieghem?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_22596249 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="22596249"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 22596249, container: ".js-paper-rank-work_22596249", }); });</script></li><li class="js-percentile-work_22596249 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 22596249; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_22596249"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_22596249 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="22596249"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 22596249; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=22596249]").text(description); $(".js-view-count-work_22596249").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_22596249").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="22596249"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="23890" rel="nofollow" href="https://www.academia.edu/Documents/in/Comparative_Study">Comparative Study</a>, <script data-card-contents-for-ri="23890" type="text/json">{"id":23890,"name":"Comparative Study","url":"https://www.academia.edu/Documents/in/Comparative_Study?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="55641" rel="nofollow" href="https://www.academia.edu/Documents/in/Performance_Evaluation">Performance Evaluation</a>, <script data-card-contents-for-ri="55641" type="text/json">{"id":55641,"name":"Performance Evaluation","url":"https://www.academia.edu/Documents/in/Performance_Evaluation?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="91375" rel="nofollow" href="https://www.academia.edu/Documents/in/Quality_of_Service">Quality of Service</a><script data-card-contents-for-ri="91375" type="text/json">{"id":91375,"name":"Quality of Service","url":"https://www.academia.edu/Documents/in/Quality_of_Service?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=22596249]'), work: {"id":22596249,"title":"A review of constraint-based routing algorithms","created_at":"2016-02-29T06:10:50.014-08:00","url":"https://www.academia.edu/22596249/A_review_of_constraint_based_routing_algorithms?f_ri=11040","dom_id":"work_22596249","summary":"Constraint-based routing is an invaluable part of a full-ßedged Quality of Service (QoS) architecture. Unfortunately, routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. Although at times an overview of QoS algorithms has been published, a comparative study to the performance of QoS algorithms is still missing. With this paper we attempt to Þll this gap.","downloadable_attachments":[{"id":43198768,"asset_id":22596249,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":44151462,"first_name":"Piet Van","last_name":"Mieghem","domain_name":"independent","page_name":"PietVanMieghem","display_name":"Piet Van Mieghem","profile_url":"https://independent.academia.edu/PietVanMieghem?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":23890,"name":"Comparative Study","url":"https://www.academia.edu/Documents/in/Comparative_Study?f_ri=11040","nofollow":true},{"id":55641,"name":"Performance Evaluation","url":"https://www.academia.edu/Documents/in/Performance_Evaluation?f_ri=11040","nofollow":true},{"id":91375,"name":"Quality of Service","url":"https://www.academia.edu/Documents/in/Quality_of_Service?f_ri=11040","nofollow":true},{"id":396234,"name":"Complexity Analysis","url":"https://www.academia.edu/Documents/in/Complexity_Analysis?f_ri=11040"},{"id":1991649,"name":"Shortest Path algorithm","url":"https://www.academia.edu/Documents/in/Shortest_Path_algorithm?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14997394 coauthored" data-work_id="14997394" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14997394/ZRP_versus_DSR_and_TORA_A_comprehensive_survey_on_ZRP_performance">ZRP versus DSR and TORA: A comprehensive survey on ZRP performance</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Ad hoc networks are characterized by dynamic topology caused by node mobility, multihop wireless connectivity and channel non-deterministic behavior (interference, multipath, hidden and exposed node problem make the wireless channel very... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_14997394" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Ad hoc networks are characterized by dynamic topology caused by node mobility, multihop wireless connectivity and channel non-deterministic behavior (interference, multipath, hidden and exposed node problem make the wireless channel very difficult to predict). The behavior of ad hoc networks must be analyzed in detail as a result of the pairing of the selected MAC and Routing protocols. We focus our studies in the routing layer while closely observing the developments in MAC layer. We present and examine analytical simulation results for the routing protocols DSR, TORA and ZRP especially focusing in ZRP and the impact of some of its most important attributes to network performance, using the well known network simulator OPNET 10.0.PL2.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14997394" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="cd580de900acd8186aa473efd2837482" rel="nofollow" data-download="{"attachment_id":43666877,"asset_id":14997394,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43666877/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33952454" href="https://independent.academia.edu/AntonopoulosC">Christos Antonopoulos</a><script data-card-contents-for-user="33952454" type="text/json">{"id":33952454,"first_name":"Christos","last_name":"Antonopoulos","domain_name":"independent","page_name":"AntonopoulosC","display_name":"Christos Antonopoulos","profile_url":"https://independent.academia.edu/AntonopoulosC?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-14997394">+1</span><div class="hidden js-additional-users-14997394"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://upatras.academia.edu/StavrosKoubias">Stavros Koubias</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-14997394'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-14997394').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_14997394 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14997394"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14997394, container: ".js-paper-rank-work_14997394", }); });</script></li><li class="js-percentile-work_14997394 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14997394; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14997394"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14997394 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14997394"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14997394; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14997394]").text(description); $(".js-view-count-work_14997394").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14997394").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14997394"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="150654" rel="nofollow" href="https://www.academia.edu/Documents/in/MAC_Layer">MAC Layer</a>, <script data-card-contents-for-ri="150654" type="text/json">{"id":150654,"name":"MAC Layer","url":"https://www.academia.edu/Documents/in/MAC_Layer?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="201111" rel="nofollow" href="https://www.academia.edu/Documents/in/Network_Performance">Network Performance</a>, <script data-card-contents-for-ri="201111" type="text/json">{"id":201111,"name":"Network Performance","url":"https://www.academia.edu/Documents/in/Network_Performance?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="236814" rel="nofollow" href="https://www.academia.edu/Documents/in/Ad_hoc_network">Ad hoc network</a><script data-card-contents-for-ri="236814" type="text/json">{"id":236814,"name":"Ad hoc network","url":"https://www.academia.edu/Documents/in/Ad_hoc_network?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14997394]'), work: {"id":14997394,"title":"ZRP versus DSR and TORA: A comprehensive survey on ZRP performance","created_at":"2015-08-17T22:07:58.485-07:00","url":"https://www.academia.edu/14997394/ZRP_versus_DSR_and_TORA_A_comprehensive_survey_on_ZRP_performance?f_ri=11040","dom_id":"work_14997394","summary":"Ad hoc networks are characterized by dynamic topology caused by node mobility, multihop wireless connectivity and channel non-deterministic behavior (interference, multipath, hidden and exposed node problem make the wireless channel very difficult to predict). The behavior of ad hoc networks must be analyzed in detail as a result of the pairing of the selected MAC and Routing protocols. We focus our studies in the routing layer while closely observing the developments in MAC layer. We present and examine analytical simulation results for the routing protocols DSR, TORA and ZRP especially focusing in ZRP and the impact of some of its most important attributes to network performance, using the well known network simulator OPNET 10.0.PL2.","downloadable_attachments":[{"id":43666877,"asset_id":14997394,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33952454,"first_name":"Christos","last_name":"Antonopoulos","domain_name":"independent","page_name":"AntonopoulosC","display_name":"Christos Antonopoulos","profile_url":"https://independent.academia.edu/AntonopoulosC?f_ri=11040","photo":"/images/s65_no_pic.png"},{"id":536146,"first_name":"Stavros","last_name":"Koubias","domain_name":"upatras","page_name":"StavrosKoubias","display_name":"Stavros Koubias","profile_url":"https://upatras.academia.edu/StavrosKoubias?f_ri=11040","photo":"https://0.academia-photos.com/536146/191647/223472/s65_stavros.koubias.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":150654,"name":"MAC Layer","url":"https://www.academia.edu/Documents/in/MAC_Layer?f_ri=11040","nofollow":true},{"id":201111,"name":"Network Performance","url":"https://www.academia.edu/Documents/in/Network_Performance?f_ri=11040","nofollow":true},{"id":236814,"name":"Ad hoc network","url":"https://www.academia.edu/Documents/in/Ad_hoc_network?f_ri=11040","nofollow":true},{"id":288703,"name":"Routing Protocol","url":"https://www.academia.edu/Documents/in/Routing_Protocol?f_ri=11040"},{"id":457420,"name":"Factory Automation","url":"https://www.academia.edu/Documents/in/Factory_Automation?f_ri=11040"},{"id":1127947,"name":"Network Simulator","url":"https://www.academia.edu/Documents/in/Network_Simulator?f_ri=11040"},{"id":1940380,"name":"Zone Routing Protocol","url":"https://www.academia.edu/Documents/in/Zone_Routing_Protocol?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_17601473" data-work_id="17601473" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/17601473/A_parametric_fuzzy_logic_approach_to_dynamic_part_routing_under_full_routing_flexibility">A parametric fuzzy logic approach to dynamic part routing under full routing flexibility</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Manufacturing flexibility is a competitive weapon for surviving today's highly variable and volatile markets. It is critical therefore, to select the appropriate type of flexibility for a given manufacturing system, and to design... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_17601473" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Manufacturing flexibility is a competitive weapon for surviving today's highly variable and volatile markets. It is critical therefore, to select the appropriate type of flexibility for a given manufacturing system, and to design effective strategies for using this flexibility in a way to improve the system performance. This study focuses on full routing flexibility which includes not only alternative machines for operations but also alternative sequences of operations for producing the same work piece. Upon completion of an operation, an on-line dispatching decision called part routing is required to choose one of the alternatives as the next step. This study introduces three new approaches, including a fuzzy logic approach, for dynamic part routing. The fuzzy part routing system adapts itself to the characteristics of a given flexible manufacturing system (FMS) installation by setting the key parameters of the membership functions as well as its Takagi-Sugeno type rule base, in such a way to capture the bottlenecks in the environment. Thus, the model does not require a search or training for the parameter set. The proposed approaches are tested against several crisp and fuzzy routing algorithms taken from the literature, by means of extensive simulation experiments in hypothetical FMS environments under variable system configurations. The results show that the proposed fuzzy approach remains robust across different system configurations and flexibility levels, and performs favourably compared to the other algorithms. The results also reveal important characteristic behaviour regarding routing flexibility.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/17601473" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="45e784605fa360fa72e91b20bacd72f1" rel="nofollow" data-download="{"attachment_id":39606173,"asset_id":17601473,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/39606173/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="37439641" href="https://boun.academia.edu/%C3%9CmitBilge">Ümit Bilge</a><script data-card-contents-for-user="37439641" type="text/json">{"id":37439641,"first_name":"Ümit","last_name":"Bilge","domain_name":"boun","page_name":"ÜmitBilge","display_name":"Ümit Bilge","profile_url":"https://boun.academia.edu/%C3%9CmitBilge?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_17601473 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="17601473"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 17601473, container: ".js-paper-rank-work_17601473", }); });</script></li><li class="js-percentile-work_17601473 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 17601473; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_17601473"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_17601473 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="17601473"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 17601473; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=17601473]").text(description); $(".js-view-count-work_17601473").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_17601473").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="17601473"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" rel="nofollow" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="4165" rel="nofollow" href="https://www.academia.edu/Documents/in/Fuzzy_Logic">Fuzzy Logic</a>, <script data-card-contents-for-ri="4165" type="text/json">{"id":4165,"name":"Fuzzy Logic","url":"https://www.academia.edu/Documents/in/Fuzzy_Logic?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="80414" rel="nofollow" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a><script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=17601473]'), work: {"id":17601473,"title":"A parametric fuzzy logic approach to dynamic part routing under full routing flexibility","created_at":"2015-11-02T02:09:13.792-08:00","url":"https://www.academia.edu/17601473/A_parametric_fuzzy_logic_approach_to_dynamic_part_routing_under_full_routing_flexibility?f_ri=11040","dom_id":"work_17601473","summary":"Manufacturing flexibility is a competitive weapon for surviving today's highly variable and volatile markets. It is critical therefore, to select the appropriate type of flexibility for a given manufacturing system, and to design effective strategies for using this flexibility in a way to improve the system performance. This study focuses on full routing flexibility which includes not only alternative machines for operations but also alternative sequences of operations for producing the same work piece. Upon completion of an operation, an on-line dispatching decision called part routing is required to choose one of the alternatives as the next step. This study introduces three new approaches, including a fuzzy logic approach, for dynamic part routing. The fuzzy part routing system adapts itself to the characteristics of a given flexible manufacturing system (FMS) installation by setting the key parameters of the membership functions as well as its Takagi-Sugeno type rule base, in such a way to capture the bottlenecks in the environment. Thus, the model does not require a search or training for the parameter set. The proposed approaches are tested against several crisp and fuzzy routing algorithms taken from the literature, by means of extensive simulation experiments in hypothetical FMS environments under variable system configurations. The results show that the proposed fuzzy approach remains robust across different system configurations and flexibility levels, and performs favourably compared to the other algorithms. The results also reveal important characteristic behaviour regarding routing flexibility.","downloadable_attachments":[{"id":39606173,"asset_id":17601473,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":37439641,"first_name":"Ümit","last_name":"Bilge","domain_name":"boun","page_name":"ÜmitBilge","display_name":"Ümit Bilge","profile_url":"https://boun.academia.edu/%C3%9CmitBilge?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=11040","nofollow":true},{"id":4165,"name":"Fuzzy Logic","url":"https://www.academia.edu/Documents/in/Fuzzy_Logic?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=11040","nofollow":true},{"id":150723,"name":"Process Planning","url":"https://www.academia.edu/Documents/in/Process_Planning?f_ri=11040"},{"id":284267,"name":"Membership Function","url":"https://www.academia.edu/Documents/in/Membership_Function?f_ri=11040"},{"id":550568,"name":"Simulation experiment","url":"https://www.academia.edu/Documents/in/Simulation_experiment?f_ri=11040"},{"id":623396,"name":"Manufacturing System","url":"https://www.academia.edu/Documents/in/Manufacturing_System?f_ri=11040"},{"id":838973,"name":"System performance","url":"https://www.academia.edu/Documents/in/System_performance?f_ri=11040"},{"id":1216932,"name":"Rule Based","url":"https://www.academia.edu/Documents/in/Rule_Based?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_67908120 coauthored" data-work_id="67908120" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/67908120/Reducing_delays_in_Fi_Wi_networks">Reducing delays in Fi-Wi networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Fi-Wi (Fiber-Wireless) is the combination of optical networking technology and wireless networks. Fi-Wi networks are very cost effective, gives high capacity, bandwidth and the best solution to full fill the demand of bandwidth hungry... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_67908120" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Fi-Wi (Fiber-Wireless) is the combination of optical networking technology and wireless networks. Fi-Wi networks are very cost effective, gives high capacity, bandwidth and the best solution to full fill the demand of bandwidth hungry applications like quad play, online gaming etc. Our goal is to reduce the delays in Fi-wi networks. In this paper we proposed most nearest most used routing algorithm (MNMU-RA) to overcome the delays in wireless (front end of Fi-Wi). Our algorithm shows the significant improvement in Delay and throughput of the network.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/67908120" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bb21bcf84a0070efb81be9968e478af2" rel="nofollow" data-download="{"attachment_id":78579667,"asset_id":67908120,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/78579667/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="124544861" href="https://independent.academia.edu/BilalKhalil12">Bilal Khalil</a><script data-card-contents-for-user="124544861" type="text/json">{"id":124544861,"first_name":"Bilal","last_name":"Khalil","domain_name":"independent","page_name":"BilalKhalil12","display_name":"Bilal Khalil","profile_url":"https://independent.academia.edu/BilalKhalil12?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-67908120">+1</span><div class="hidden js-additional-users-67908120"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/AdilBashir36">Adil Bashir</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-67908120'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-67908120').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_67908120 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="67908120"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 67908120, container: ".js-paper-rank-work_67908120", }); });</script></li><li class="js-percentile-work_67908120 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 67908120; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_67908120"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_67908120 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="67908120"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 67908120; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=67908120]").text(description); $(".js-view-count-work_67908120").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_67908120").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="67908120"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="65429" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_Network">Wireless Network</a>, <script data-card-contents-for-ri="65429" type="text/json">{"id":65429,"name":"Wireless Network","url":"https://www.academia.edu/Documents/in/Wireless_Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="165565" rel="nofollow" href="https://www.academia.edu/Documents/in/Cost_effectiveness">Cost effectiveness</a>, <script data-card-contents-for-ri="165565" type="text/json">{"id":165565,"name":"Cost effectiveness","url":"https://www.academia.edu/Documents/in/Cost_effectiveness?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="241633" rel="nofollow" href="https://www.academia.edu/Documents/in/Optical_network">Optical network</a><script data-card-contents-for-ri="241633" type="text/json">{"id":241633,"name":"Optical network","url":"https://www.academia.edu/Documents/in/Optical_network?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=67908120]'), work: {"id":67908120,"title":"Reducing delays in Fi-Wi networks","created_at":"2022-01-12T23:30:39.605-08:00","url":"https://www.academia.edu/67908120/Reducing_delays_in_Fi_Wi_networks?f_ri=11040","dom_id":"work_67908120","summary":"Fi-Wi (Fiber-Wireless) is the combination of optical networking technology and wireless networks. Fi-Wi networks are very cost effective, gives high capacity, bandwidth and the best solution to full fill the demand of bandwidth hungry applications like quad play, online gaming etc. Our goal is to reduce the delays in Fi-wi networks. In this paper we proposed most nearest most used routing algorithm (MNMU-RA) to overcome the delays in wireless (front end of Fi-Wi). Our algorithm shows the significant improvement in Delay and throughput of the network.","downloadable_attachments":[{"id":78579667,"asset_id":67908120,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":124544861,"first_name":"Bilal","last_name":"Khalil","domain_name":"independent","page_name":"BilalKhalil12","display_name":"Bilal Khalil","profile_url":"https://independent.academia.edu/BilalKhalil12?f_ri=11040","photo":"/images/s65_no_pic.png"},{"id":214894498,"first_name":"Adil","last_name":"Bashir","domain_name":"independent","page_name":"AdilBashir36","display_name":"Adil Bashir","profile_url":"https://independent.academia.edu/AdilBashir36?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":65429,"name":"Wireless Network","url":"https://www.academia.edu/Documents/in/Wireless_Network?f_ri=11040","nofollow":true},{"id":165565,"name":"Cost effectiveness","url":"https://www.academia.edu/Documents/in/Cost_effectiveness?f_ri=11040","nofollow":true},{"id":241633,"name":"Optical network","url":"https://www.academia.edu/Documents/in/Optical_network?f_ri=11040","nofollow":true},{"id":303656,"name":"Online Game","url":"https://www.academia.edu/Documents/in/Online_Game?f_ri=11040"},{"id":382725,"name":"Delays","url":"https://www.academia.edu/Documents/in/Delays?f_ri=11040"},{"id":969892,"name":"Front end","url":"https://www.academia.edu/Documents/in/Front_end?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10120412" data-work_id="10120412" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10120412/Matrix_based_Nonblocking_Routing_Algorithm_for_Bene%CB%87s_Networks">Matrix-based Nonblocking Routing Algorithm for Beneˇs Networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper presents a nonblocking routing algorithm for Beneˇs networks. Such networks are of potential interest in implementing large scale optical cross-connects, but their complex routing algorithm limits their applications. We use... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_10120412" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper presents a nonblocking routing algorithm <br />for Beneˇs networks. Such networks are of potential interest <br />in implementing large scale optical cross-connects, but their <br />complex routing algorithm limits their applications. We use a <br />simple approach to determine the routing tags for a conflict <br />free routing. Available methods proposed in the literature use <br />computationally complex solutions to determine the routing tags. <br />We propose a new approach for determining the paths through <br />the network for all the requests coming to the inputs of the switch <br />for unicast routing. Each switching stage has been represented by <br />a set of sub-matrices and hence a conflict free routing is found. <br />The correctness of the generated routing tags have been validated <br />with mathematical method as well as with a simulator that <br />can validate the correctness of the routing tags. This algorithm <br />requires less complex practical implementation than the looping <br />algorithm, making it viable for use in cross connect systems. <br />Keywords: Rearrangeable Network, Permutation, Interconnection <br />Networks, Blocking, Routing Tags, Parallel Processing, <br />Distributed Processing.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10120412" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="62abbc09109b74f1629cd55c7aa23780" rel="nofollow" data-download="{"attachment_id":36236317,"asset_id":10120412,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/36236317/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12154244" href="https://srbiau.academia.edu/MSharifi">Mohammad Sharifi</a><script data-card-contents-for-user="12154244" type="text/json">{"id":12154244,"first_name":"Mohammad","last_name":"Sharifi","domain_name":"srbiau","page_name":"MSharifi","display_name":"Mohammad Sharifi","profile_url":"https://srbiau.academia.edu/MSharifi?f_ri=11040","photo":"https://0.academia-photos.com/12154244/3486897/4096579/s65_mohammad.sharifi.jpg"}</script></span></span></li><li class="js-paper-rank-work_10120412 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10120412"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10120412, container: ".js-paper-rank-work_10120412", }); });</script></li><li class="js-percentile-work_10120412 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10120412; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10120412"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10120412 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10120412"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10120412; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10120412]").text(description); $(".js-view-count-work_10120412").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10120412").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10120412"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="26817" rel="nofollow" href="https://www.academia.edu/Documents/in/Algorithm">Algorithm</a>, <script data-card-contents-for-ri="26817" type="text/json">{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="41559" rel="nofollow" href="https://www.academia.edu/Documents/in/Network">Network</a>, <script data-card-contents-for-ri="41559" type="text/json">{"id":41559,"name":"Network","url":"https://www.academia.edu/Documents/in/Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="1757801" rel="nofollow" href="https://www.academia.edu/Documents/in/Network_Algorithm">Network Algorithm</a><script data-card-contents-for-ri="1757801" type="text/json">{"id":1757801,"name":"Network Algorithm","url":"https://www.academia.edu/Documents/in/Network_Algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10120412]'), work: {"id":10120412,"title":"Matrix-based Nonblocking Routing Algorithm for Beneˇs Networks","created_at":"2015-01-11T23:46:13.726-08:00","url":"https://www.academia.edu/10120412/Matrix_based_Nonblocking_Routing_Algorithm_for_Bene%CB%87s_Networks?f_ri=11040","dom_id":"work_10120412","summary":"This paper presents a nonblocking routing algorithm\r\nfor Beneˇs networks. Such networks are of potential interest\r\nin implementing large scale optical cross-connects, but their\r\ncomplex routing algorithm limits their applications. We use a\r\nsimple approach to determine the routing tags for a conflict\r\nfree routing. Available methods proposed in the literature use\r\ncomputationally complex solutions to determine the routing tags.\r\nWe propose a new approach for determining the paths through\r\nthe network for all the requests coming to the inputs of the switch\r\nfor unicast routing. Each switching stage has been represented by\r\na set of sub-matrices and hence a conflict free routing is found.\r\nThe correctness of the generated routing tags have been validated\r\nwith mathematical method as well as with a simulator that\r\ncan validate the correctness of the routing tags. This algorithm\r\nrequires less complex practical implementation than the looping\r\nalgorithm, making it viable for use in cross connect systems.\r\nKeywords: Rearrangeable Network, Permutation, Interconnection\r\nNetworks, Blocking, Routing Tags, Parallel Processing,\r\nDistributed Processing.","downloadable_attachments":[{"id":36236317,"asset_id":10120412,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12154244,"first_name":"Mohammad","last_name":"Sharifi","domain_name":"srbiau","page_name":"MSharifi","display_name":"Mohammad Sharifi","profile_url":"https://srbiau.academia.edu/MSharifi?f_ri=11040","photo":"https://0.academia-photos.com/12154244/3486897/4096579/s65_mohammad.sharifi.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=11040","nofollow":true},{"id":41559,"name":"Network","url":"https://www.academia.edu/Documents/in/Network?f_ri=11040","nofollow":true},{"id":1757801,"name":"Network Algorithm","url":"https://www.academia.edu/Documents/in/Network_Algorithm?f_ri=11040","nofollow":true},{"id":1757803,"name":"Benes Networks","url":"https://www.academia.edu/Documents/in/Benes_Networks?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28678468" data-work_id="28678468" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28678468/Dynamic_Routing_of_Automated_Guided_Vehicles_in_Real_time">Dynamic Routing of Automated Guided Vehicles in Real-time</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Automated Guided Vehicles (AGVs) are state-of-the-art technology for optimizing large scale production systems and are used in a wide range of application areas. A standard task in this context is to find efficient routing schemes, i.e.,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_28678468" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Automated Guided Vehicles (AGVs) are state-of-the-art technology for optimizing large scale production systems and are used in a wide range of application areas. A standard task in this context is to find efficient routing schemes, i.e., algorithms that route these vehicles through the particular environment. The productivity of the AGVs is highly dependent on the used routing scheme.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28678468" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d920a4a3ea5dd7b7e110babbf2921d00" rel="nofollow" data-download="{"attachment_id":49062085,"asset_id":28678468,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49062085/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="53883428" href="https://independent.academia.edu/EwgenijGawrilow">Ewgenij Gawrilow</a><script data-card-contents-for-user="53883428" type="text/json">{"id":53883428,"first_name":"Ewgenij","last_name":"Gawrilow","domain_name":"independent","page_name":"EwgenijGawrilow","display_name":"Ewgenij Gawrilow","profile_url":"https://independent.academia.edu/EwgenijGawrilow?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_28678468 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28678468"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28678468, container: ".js-paper-rank-work_28678468", }); });</script></li><li class="js-percentile-work_28678468 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28678468; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28678468"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28678468 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28678468"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28678468; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28678468]").text(description); $(".js-view-count-work_28678468").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28678468").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28678468"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="181362" rel="nofollow" href="https://www.academia.edu/Documents/in/Container_Terminal">Container Terminal</a>, <script data-card-contents-for-ri="181362" type="text/json">{"id":181362,"name":"Container Terminal","url":"https://www.academia.edu/Documents/in/Container_Terminal?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="229390" rel="nofollow" href="https://www.academia.edu/Documents/in/Real_Time">Real Time</a>, <script data-card-contents-for-ri="229390" type="text/json">{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="743999" rel="nofollow" href="https://www.academia.edu/Documents/in/Production_System">Production System</a><script data-card-contents-for-ri="743999" type="text/json">{"id":743999,"name":"Production System","url":"https://www.academia.edu/Documents/in/Production_System?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28678468]'), work: {"id":28678468,"title":"Dynamic Routing of Automated Guided Vehicles in Real-time","created_at":"2016-09-23T06:07:10.733-07:00","url":"https://www.academia.edu/28678468/Dynamic_Routing_of_Automated_Guided_Vehicles_in_Real_time?f_ri=11040","dom_id":"work_28678468","summary":"Automated Guided Vehicles (AGVs) are state-of-the-art technology for optimizing large scale production systems and are used in a wide range of application areas. A standard task in this context is to find efficient routing schemes, i.e., algorithms that route these vehicles through the particular environment. The productivity of the AGVs is highly dependent on the used routing scheme.","downloadable_attachments":[{"id":49062085,"asset_id":28678468,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":53883428,"first_name":"Ewgenij","last_name":"Gawrilow","domain_name":"independent","page_name":"EwgenijGawrilow","display_name":"Ewgenij Gawrilow","profile_url":"https://independent.academia.edu/EwgenijGawrilow?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":181362,"name":"Container Terminal","url":"https://www.academia.edu/Documents/in/Container_Terminal?f_ri=11040","nofollow":true},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=11040","nofollow":true},{"id":743999,"name":"Production System","url":"https://www.academia.edu/Documents/in/Production_System?f_ri=11040","nofollow":true},{"id":758278,"name":"Large Scale","url":"https://www.academia.edu/Documents/in/Large_Scale?f_ri=11040"},{"id":874370,"name":"STATIC \u0026 DYNAMIC ROUTING","url":"https://www.academia.edu/Documents/in/STATIC_and_DYNAMIC_ROUTING?f_ri=11040"},{"id":1228946,"name":"Physical Properties","url":"https://www.academia.edu/Documents/in/Physical_Properties?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_6327840" data-work_id="6327840" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/6327840/A_dynamic_logistics_coordination_model_for_evacuation_and_support_in_disaster_response_activities">A dynamic logistics coordination model for evacuation and support in disaster response activities</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper describes an integrated location-distribution model for coordinating logistics support and evacuation operations in disaster response activities. Logistics planning in emergencies involves dispatching commodities (e.g., medical... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_6327840" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper describes an integrated location-distribution model for coordinating logistics support and evacuation operations in disaster response activities. Logistics planning in emergencies involves dispatching commodities (e.g., medical materials and personnel, specialised rescue equipment and rescue teams, food, etc.) to distribution centres in affected areas and evacuation and transfer of wounded people to emergency units. During the initial response time it is also necessary to set up temporary emergency centers and shelters in affected areas to speed up medical care for less heavily wounded survivors. In risk mitigation studies for natural disasters, possible sites where these units can be situated are specified according to risk based urban structural analysis. Logistics coordination in disasters involves the selection of sites that result in maximum coverage of medical need in affected areas. Another important issue that arises in such emergencies is that medical personnel who are on duty in nearby hospitals have to be re-shuffled to serve both temporary and permanent emergency units. Thus, an optimal medical personnel allocation must be determined among these units. The proposed model also considers this issue.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/6327840" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4ce078c427a805b87c641152b9268d57" rel="nofollow" data-download="{"attachment_id":33160001,"asset_id":6327840,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/33160001/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="9845788" href="https://ipip.academia.edu/WeiYi">Wei Yi</a><script data-card-contents-for-user="9845788" type="text/json">{"id":9845788,"first_name":"Wei","last_name":"Yi","domain_name":"ipip","page_name":"WeiYi","display_name":"Wei Yi","profile_url":"https://ipip.academia.edu/WeiYi?f_ri=11040","photo":"https://0.academia-photos.com/9845788/3242705/3816232/s65_wei.yi.jpg"}</script></span></span></li><li class="js-paper-rank-work_6327840 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="6327840"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 6327840, container: ".js-paper-rank-work_6327840", }); });</script></li><li class="js-percentile-work_6327840 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 6327840; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_6327840"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_6327840 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="6327840"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 6327840; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=6327840]").text(description); $(".js-view-count-work_6327840").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_6327840").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="6327840"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">27</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="4974" rel="nofollow" href="https://www.academia.edu/Documents/in/Logistics">Logistics</a>, <script data-card-contents-for-ri="4974" type="text/json">{"id":4974,"name":"Logistics","url":"https://www.academia.edu/Documents/in/Logistics?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="6177" rel="nofollow" href="https://www.academia.edu/Documents/in/Modeling">Modeling</a>, <script data-card-contents-for-ri="6177" type="text/json">{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="10194" rel="nofollow" href="https://www.academia.edu/Documents/in/Localization">Localization</a>, <script data-card-contents-for-ri="10194" type="text/json">{"id":10194,"name":"Localization","url":"https://www.academia.edu/Documents/in/Localization?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a><script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=6327840]'), work: {"id":6327840,"title":"A dynamic logistics coordination model for evacuation and support in disaster response activities","created_at":"2014-03-07T11:44:02.462-08:00","url":"https://www.academia.edu/6327840/A_dynamic_logistics_coordination_model_for_evacuation_and_support_in_disaster_response_activities?f_ri=11040","dom_id":"work_6327840","summary":"This paper describes an integrated location-distribution model for coordinating logistics support and evacuation operations in disaster response activities. Logistics planning in emergencies involves dispatching commodities (e.g., medical materials and personnel, specialised rescue equipment and rescue teams, food, etc.) to distribution centres in affected areas and evacuation and transfer of wounded people to emergency units. During the initial response time it is also necessary to set up temporary emergency centers and shelters in affected areas to speed up medical care for less heavily wounded survivors. In risk mitigation studies for natural disasters, possible sites where these units can be situated are specified according to risk based urban structural analysis. Logistics coordination in disasters involves the selection of sites that result in maximum coverage of medical need in affected areas. Another important issue that arises in such emergencies is that medical personnel who are on duty in nearby hospitals have to be re-shuffled to serve both temporary and permanent emergency units. Thus, an optimal medical personnel allocation must be determined among these units. The proposed model also considers this issue.","downloadable_attachments":[{"id":33160001,"asset_id":6327840,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":9845788,"first_name":"Wei","last_name":"Yi","domain_name":"ipip","page_name":"WeiYi","display_name":"Wei Yi","profile_url":"https://ipip.academia.edu/WeiYi?f_ri=11040","photo":"https://0.academia-photos.com/9845788/3242705/3816232/s65_wei.yi.jpg"}],"research_interests":[{"id":4974,"name":"Logistics","url":"https://www.academia.edu/Documents/in/Logistics?f_ri=11040","nofollow":true},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=11040","nofollow":true},{"id":10194,"name":"Localization","url":"https://www.academia.edu/Documents/in/Localization?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":15582,"name":"Disaster Management","url":"https://www.academia.edu/Documents/in/Disaster_Management?f_ri=11040"},{"id":15583,"name":"Disaster Response","url":"https://www.academia.edu/Documents/in/Disaster_Response?f_ri=11040"},{"id":20626,"name":"Production Management","url":"https://www.academia.edu/Documents/in/Production_Management?f_ri=11040"},{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary?f_ri=11040"},{"id":32153,"name":"Structural Analysis","url":"https://www.academia.edu/Documents/in/Structural_Analysis?f_ri=11040"},{"id":47813,"name":"Planning","url":"https://www.academia.edu/Documents/in/Planning?f_ri=11040"},{"id":50711,"name":"Risk Analysis","url":"https://www.academia.edu/Documents/in/Risk_Analysis?f_ri=11040"},{"id":91099,"name":"Vehicle routing","url":"https://www.academia.edu/Documents/in/Vehicle_routing?f_ri=11040"},{"id":104215,"name":"Disaster","url":"https://www.academia.edu/Documents/in/Disaster?f_ri=11040"},{"id":117983,"name":"Permanent Magnets","url":"https://www.academia.edu/Documents/in/Permanent_Magnets?f_ri=11040"},{"id":123411,"name":"Care","url":"https://www.academia.edu/Documents/in/Care?f_ri=11040"},{"id":158722,"name":"Natural disaster","url":"https://www.academia.edu/Documents/in/Natural_disaster?f_ri=11040"},{"id":219645,"name":"Medical Care","url":"https://www.academia.edu/Documents/in/Medical_Care?f_ri=11040"},{"id":303727,"name":"Grid","url":"https://www.academia.edu/Documents/in/Grid?f_ri=11040"},{"id":325035,"name":"Linear System","url":"https://www.academia.edu/Documents/in/Linear_System?f_ri=11040"},{"id":382020,"name":"Scenario","url":"https://www.academia.edu/Documents/in/Scenario?f_ri=11040"},{"id":405156,"name":"Coverage","url":"https://www.academia.edu/Documents/in/Coverage?f_ri=11040"},{"id":430329,"name":"Urban Structure","url":"https://www.academia.edu/Documents/in/Urban_Structure?f_ri=11040"},{"id":436192,"name":"Mixed Integer Programming","url":"https://www.academia.edu/Documents/in/Mixed_Integer_Programming?f_ri=11040"},{"id":502872,"name":"Risk mitigation","url":"https://www.academia.edu/Documents/in/Risk_mitigation?f_ri=11040"},{"id":606614,"name":"Network Flow","url":"https://www.academia.edu/Documents/in/Network_Flow?f_ri=11040"},{"id":984589,"name":"Logistic Distribution","url":"https://www.academia.edu/Documents/in/Logistic_Distribution?f_ri=11040"},{"id":1851903,"name":"Response Time","url":"https://www.academia.edu/Documents/in/Response_Time?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_537449" data-work_id="537449" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/537449/ZD_AOMDV_A_New_Routing_Algorithm_for_Mobile_Ad_Hoc_Networks">ZD-AOMDV: A New Routing Algorithm for Mobile Ad-Hoc Networks</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/537449" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e5cb035010754f8c84f804b3f16d2790" rel="nofollow" data-download="{"attachment_id":3485817,"asset_id":537449,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/3485817/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="123061" href="https://amirkabir.academia.edu/NastoohTaheriJavanPhD%D9%86%D8%B3%D8%AA%D9%88%D9%87%D8%B7%D8%A7%D9%87%D8%B1%DB%8C%D8%AC%D9%88%D8%A7%D9%86">Nastooh Taheri Javan, PhD, نستوه طاهری جوان</a><script data-card-contents-for-user="123061" type="text/json">{"id":123061,"first_name":"Nastooh Taheri Javan, PhD,","last_name":"نستوه طاهری جوان","domain_name":"amirkabir","page_name":"NastoohTaheriJavanPhDنستوهطاهریجوان","display_name":"Nastooh Taheri Javan, PhD, نستوه طاهری جوان","profile_url":"https://amirkabir.academia.edu/NastoohTaheriJavanPhD%D9%86%D8%B3%D8%AA%D9%88%D9%87%D8%B7%D8%A7%D9%87%D8%B1%DB%8C%D8%AC%D9%88%D8%A7%D9%86?f_ri=11040","photo":"https://0.academia-photos.com/123061/24685038/23551315/s65_nastooh.taheri_javan.jpg"}</script></span></span></li><li class="js-paper-rank-work_537449 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="537449"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 537449, container: ".js-paper-rank-work_537449", }); });</script></li><li class="js-percentile-work_537449 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 537449; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_537449"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_537449 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="537449"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 537449; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=537449]").text(description); $(".js-view-count-work_537449").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_537449").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="537449"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">15</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2339" rel="nofollow" href="https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks">Mobile Ad Hoc Networks</a>, <script data-card-contents-for-ri="2339" type="text/json">{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="4252" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Networks">Computer Networks</a>, <script data-card-contents-for-ri="4252" type="text/json">{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a><script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=537449]'), work: {"id":537449,"title":"ZD-AOMDV: A New Routing Algorithm for Mobile Ad-Hoc Networks","created_at":"2011-04-19T02:22:43.167-07:00","url":"https://www.academia.edu/537449/ZD_AOMDV_A_New_Routing_Algorithm_for_Mobile_Ad_Hoc_Networks?f_ri=11040","dom_id":"work_537449","summary":null,"downloadable_attachments":[{"id":3485817,"asset_id":537449,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":123061,"first_name":"Nastooh Taheri Javan, PhD,","last_name":"نستوه طاهری جوان","domain_name":"amirkabir","page_name":"NastoohTaheriJavanPhDنستوهطاهریجوان","display_name":"Nastooh Taheri Javan, PhD, نستوه طاهری جوان","profile_url":"https://amirkabir.academia.edu/NastoohTaheriJavanPhD%D9%86%D8%B3%D8%AA%D9%88%D9%87%D8%B7%D8%A7%D9%87%D8%B1%DB%8C%D8%AC%D9%88%D8%A7%D9%86?f_ri=11040","photo":"https://0.academia-photos.com/123061/24685038/23551315/s65_nastooh.taheri_javan.jpg"}],"research_interests":[{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":22992,"name":"Wireless networks","url":"https://www.academia.edu/Documents/in/Wireless_networks?f_ri=11040"},{"id":23383,"name":"Routing protocols","url":"https://www.academia.edu/Documents/in/Routing_protocols?f_ri=11040"},{"id":26825,"name":"Mobile Computing","url":"https://www.academia.edu/Documents/in/Mobile_Computing?f_ri=11040"},{"id":58607,"name":"Mobile Ad Hoc Network","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Network?f_ri=11040"},{"id":65429,"name":"Wireless Network","url":"https://www.academia.edu/Documents/in/Wireless_Network?f_ri=11040"},{"id":70493,"name":"Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Ad_Hoc_Networks?f_ri=11040"},{"id":82137,"name":"Manet","url":"https://www.academia.edu/Documents/in/Manet?f_ri=11040"},{"id":516036,"name":"Medium Access Control","url":"https://www.academia.edu/Documents/in/Medium_Access_Control?f_ri=11040"},{"id":968109,"name":"Packet Delivery Ratio","url":"https://www.academia.edu/Documents/in/Packet_Delivery_Ratio?f_ri=11040"},{"id":1483879,"name":"Multi Path Routing","url":"https://www.academia.edu/Documents/in/Multi_Path_Routing?f_ri=11040"},{"id":1708394,"name":"Data Transmission","url":"https://www.academia.edu/Documents/in/Data_Transmission?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3836364" data-work_id="3836364" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3836364/Design_implementation_and_evaluation_of_a_deadlock_free_routing_algorithm_for_concurrent_computers">Design, implementation and evaluation of a deadlock-free routing algorithm for concurrent computers</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">St. Petersburg FL 33733. USA</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3836364" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0295e08c508dc71ecb3aa2827b100b6b" rel="nofollow" data-download="{"attachment_id":50120622,"asset_id":3836364,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50120622/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4719935" href="https://independent.academia.edu/GiandomenicoSpezzano">Giandomenico Spezzano</a><script data-card-contents-for-user="4719935" type="text/json">{"id":4719935,"first_name":"Giandomenico","last_name":"Spezzano","domain_name":"independent","page_name":"GiandomenicoSpezzano","display_name":"Giandomenico Spezzano","profile_url":"https://independent.academia.edu/GiandomenicoSpezzano?f_ri=11040","photo":"https://0.academia-photos.com/4719935/1994734/2354553/s65_giandomenico.spezzano.jpg"}</script></span></span></li><li class="js-paper-rank-work_3836364 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3836364"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3836364, container: ".js-paper-rank-work_3836364", }); });</script></li><li class="js-percentile-work_3836364 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3836364; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3836364"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3836364 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3836364"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3836364; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3836364]").text(description); $(".js-view-count-work_3836364").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3836364").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3836364"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="440" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="64561" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Software">Computer Software</a><script data-card-contents-for-ri="64561" type="text/json">{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3836364]'), work: {"id":3836364,"title":"Design, implementation and evaluation of a deadlock-free routing algorithm for concurrent computers","created_at":"2013-07-01T23:53:15.203-07:00","url":"https://www.academia.edu/3836364/Design_implementation_and_evaluation_of_a_deadlock_free_routing_algorithm_for_concurrent_computers?f_ri=11040","dom_id":"work_3836364","summary":"St. Petersburg FL 33733. USA","downloadable_attachments":[{"id":50120622,"asset_id":3836364,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4719935,"first_name":"Giandomenico","last_name":"Spezzano","domain_name":"independent","page_name":"GiandomenicoSpezzano","display_name":"Giandomenico Spezzano","profile_url":"https://independent.academia.edu/GiandomenicoSpezzano?f_ri=11040","photo":"https://0.academia-photos.com/4719935/1994734/2354553/s65_giandomenico.spezzano.jpg"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=11040","nofollow":true}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_13473964" data-work_id="13473964" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/13473964/Deadlock_free_multicast_wormhole_routing_in_2_D_mesh_multicomputers">Deadlock-free multicast wormhole routing in 2-D mesh multicomputers</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_13473964" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlockfree adaptive multicast wormhole routing algorithms ever proposed, are shown to be deadlock-free. A study has been conducted that compares the performance of these multicast algorithms. The results show that the minimal fully-adaptive routing method creates the least tra c, however, double vertical channels are required in order to avoid deadlock. The nonminimal routing algorithm exhibits the best adaptivity, although it creates more network tra c than the other methods.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/13473964" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8d124ebe447faa568df7d2eec25a144c" rel="nofollow" data-download="{"attachment_id":45298507,"asset_id":13473964,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/45298507/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="32694184" href="https://michiganstate.academia.edu/PhilipMcKinley">Philip McKinley</a><script data-card-contents-for-user="32694184" type="text/json">{"id":32694184,"first_name":"Philip","last_name":"McKinley","domain_name":"michiganstate","page_name":"PhilipMcKinley","display_name":"Philip McKinley","profile_url":"https://michiganstate.academia.edu/PhilipMcKinley?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_13473964 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="13473964"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 13473964, container: ".js-paper-rank-work_13473964", }); });</script></li><li class="js-percentile-work_13473964 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 13473964; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_13473964"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_13473964 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="13473964"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 13473964; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=13473964]").text(description); $(".js-view-count-work_13473964").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_13473964").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="13473964"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="440" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="64561" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Software">Computer Software</a>, <script data-card-contents-for-ri="64561" type="text/json">{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="80870" rel="nofollow" href="https://www.academia.edu/Documents/in/Parallel_and_Distributed_Computing">Parallel & Distributed Computing</a><script data-card-contents-for-ri="80870" type="text/json">{"id":80870,"name":"Parallel \u0026 Distributed Computing","url":"https://www.academia.edu/Documents/in/Parallel_and_Distributed_Computing?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=13473964]'), work: {"id":13473964,"title":"Deadlock-free multicast wormhole routing in 2-D mesh multicomputers","created_at":"2015-07-01T02:38:44.726-07:00","url":"https://www.academia.edu/13473964/Deadlock_free_multicast_wormhole_routing_in_2_D_mesh_multicomputers?f_ri=11040","dom_id":"work_13473964","summary":"The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlockfree adaptive multicast wormhole routing algorithms ever proposed, are shown to be deadlock-free. A study has been conducted that compares the performance of these multicast algorithms. The results show that the minimal fully-adaptive routing method creates the least tra c, however, double vertical channels are required in order to avoid deadlock. The nonminimal routing algorithm exhibits the best adaptivity, although it creates more network tra c than the other methods.","downloadable_attachments":[{"id":45298507,"asset_id":13473964,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":32694184,"first_name":"Philip","last_name":"McKinley","domain_name":"michiganstate","page_name":"PhilipMcKinley","display_name":"Philip McKinley","profile_url":"https://michiganstate.academia.edu/PhilipMcKinley?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=11040","nofollow":true},{"id":80870,"name":"Parallel \u0026 Distributed Computing","url":"https://www.academia.edu/Documents/in/Parallel_and_Distributed_Computing?f_ri=11040","nofollow":true},{"id":444425,"name":"Multicast Communication","url":"https://www.academia.edu/Documents/in/Multicast_Communication?f_ri=11040"},{"id":481418,"name":"MPEG enabled Multicast Routing","url":"https://www.academia.edu/Documents/in/MPEG_enabled_Multicast_Routing?f_ri=11040"},{"id":509785,"name":"Simulation Study","url":"https://www.academia.edu/Documents/in/Simulation_Study?f_ri=11040"},{"id":692248,"name":"Parallel and Distributed Systems","url":"https://www.academia.edu/Documents/in/Parallel_and_Distributed_Systems-1?f_ri=11040"},{"id":1340139,"name":"Dynamic Networks","url":"https://www.academia.edu/Documents/in/Dynamic_Networks?f_ri=11040"},{"id":1950746,"name":"Heuristic algorithm","url":"https://www.academia.edu/Documents/in/Heuristic_algorithm?f_ri=11040"},{"id":1952469,"name":"Wormhole routing","url":"https://www.academia.edu/Documents/in/Wormhole_routing?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_74018608" data-work_id="74018608" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" rel="nofollow" href="https://www.academia.edu/74018608/Video_streaming_in_mobile_ad_hoc_networks">Video streaming in mobile ad hoc networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">... 5: Scalable Video Coding (in integrated form with ITU-T Rec. H.264 | ISO/IEC 14996-10). JointVideo Team (JVT), Doc. JVT-R201, Jan. 2006. 4. Luby, M., Stockhammer, T., Watson, M., Gasiba, T., and Xu, W. Raptor Codes for Reliable... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_74018608" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">... 5: Scalable Video Coding (in integrated form with ITU-T Rec. H.264 | ISO/IEC 14996-10). JointVideo Team (JVT), Doc. JVT-R201, Jan. 2006. 4. Luby, M., Stockhammer, T., Watson, M., Gasiba, T., and Xu, W. Raptor Codes for Reliable Download Delivery in Wireless Broadcast ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/74018608" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="136924746" href="https://independent.academia.edu/TStockhammer">Thomas Stockhammer</a><script data-card-contents-for-user="136924746" type="text/json">{"id":136924746,"first_name":"Thomas","last_name":"Stockhammer","domain_name":"independent","page_name":"TStockhammer","display_name":"Thomas Stockhammer","profile_url":"https://independent.academia.edu/TStockhammer?f_ri=11040","photo":"https://0.academia-photos.com/136924746/154350787/143965790/s65_thomas.stockhammer.jpeg"}</script></span></span></li><li class="js-paper-rank-work_74018608 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="74018608"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 74018608, container: ".js-paper-rank-work_74018608", }); });</script></li><li class="js-percentile-work_74018608 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 74018608; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_74018608"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_74018608 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="74018608"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 74018608; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=74018608]").text(description); $(".js-view-count-work_74018608").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_74018608").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="74018608"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="2339" rel="nofollow" href="https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks">Mobile Ad Hoc Networks</a>, <script data-card-contents-for-ri="2339" type="text/json">{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="6506" rel="nofollow" href="https://www.academia.edu/Documents/in/Video_Coding">Video Coding</a>, <script data-card-contents-for-ri="6506" type="text/json">{"id":6506,"name":"Video Coding","url":"https://www.academia.edu/Documents/in/Video_Coding?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="9698" rel="nofollow" href="https://www.academia.edu/Documents/in/Channel_Coding">Channel Coding</a><script data-card-contents-for-ri="9698" type="text/json">{"id":9698,"name":"Channel Coding","url":"https://www.academia.edu/Documents/in/Channel_Coding?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=74018608]'), work: {"id":74018608,"title":"Video streaming in mobile ad hoc networks","created_at":"2022-03-18T08:21:03.634-07:00","url":"https://www.academia.edu/74018608/Video_streaming_in_mobile_ad_hoc_networks?f_ri=11040","dom_id":"work_74018608","summary":"... 5: Scalable Video Coding (in integrated form with ITU-T Rec. H.264 | ISO/IEC 14996-10). JointVideo Team (JVT), Doc. JVT-R201, Jan. 2006. 4. Luby, M., Stockhammer, T., Watson, M., Gasiba, T., and Xu, W. Raptor Codes for Reliable Download Delivery in Wireless Broadcast ...","downloadable_attachments":[],"ordered_authors":[{"id":136924746,"first_name":"Thomas","last_name":"Stockhammer","domain_name":"independent","page_name":"TStockhammer","display_name":"Thomas Stockhammer","profile_url":"https://independent.academia.edu/TStockhammer?f_ri=11040","photo":"https://0.academia-photos.com/136924746/154350787/143965790/s65_thomas.stockhammer.jpeg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true},{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true},{"id":6506,"name":"Video Coding","url":"https://www.academia.edu/Documents/in/Video_Coding?f_ri=11040","nofollow":true},{"id":9698,"name":"Channel Coding","url":"https://www.academia.edu/Documents/in/Channel_Coding?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040"},{"id":58607,"name":"Mobile Ad Hoc Network","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Network?f_ri=11040"},{"id":60189,"name":"Video Streaming","url":"https://www.academia.edu/Documents/in/Video_Streaming?f_ri=11040"},{"id":68014,"name":"Scalable Video Coding","url":"https://www.academia.edu/Documents/in/Scalable_Video_Coding?f_ri=11040"},{"id":108368,"name":"Video Transmission","url":"https://www.academia.edu/Documents/in/Video_Transmission?f_ri=11040"},{"id":164636,"name":"Outage Probability","url":"https://www.academia.edu/Documents/in/Outage_Probability?f_ri=11040"},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=11040"},{"id":290886,"name":"Peer to Peer","url":"https://www.academia.edu/Documents/in/Peer_to_Peer?f_ri=11040"},{"id":516232,"name":"Source Code","url":"https://www.academia.edu/Documents/in/Source_Code?f_ri=11040"},{"id":527137,"name":"Packet Loss","url":"https://www.academia.edu/Documents/in/Packet_Loss?f_ri=11040"},{"id":546804,"name":"Forward Error Correction","url":"https://www.academia.edu/Documents/in/Forward_Error_Correction?f_ri=11040"},{"id":859645,"name":"Access Point","url":"https://www.academia.edu/Documents/in/Access_Point?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9952359" data-work_id="9952359" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9952359/ICA_Um_Novo_Algoritmo_de_Roteamento_para_Redes_de_Sensores">ICA: Um Novo Algoritmo de Roteamento para Redes de Sensores</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper presents the Inter Cluster Routing Algorithm (ICA), a new and efficient routing algorithm for wireless sensor networks based on Low-Energy Adaptive Clustering Hierarchy (LEACH) [3]. The proposed algorithm, when compared with... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9952359" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper presents the Inter Cluster Routing Algorithm (ICA), a new and efficient routing algorithm for wireless sensor networks based on Low-Energy Adaptive Clustering Hierarchy (LEACH) [3]. The proposed algorithm, when compared with LEACH and LEACH-C[1], presents not only higher network lifetime but also higher number of sent messages. The energy maps show also that ICA presents a better energy distribution and degradation, when compared to LEACH and LEACH-C. ICA is indicated to sensor networks that collect data periodically and in which the network lifetime is an important parameter. Resumo. Este artigo apresenta um novo e eficiente algoritmo de roteamento para redes de sensores sem fio chamado Inter Cluster Routing Algorithm (ICA) baseado no Low-Energy Adaptive Clustering Hierarchy (LEACH) [3] . O ICA foi desenvolvido para redes de sensores que coletam informações periodicamente durante o tempo de vida da rede. Para estes ambientes a longevidade da rede é normalmente um fator de extrema importância. Os resultados de simulações mostram que o ICA quando comparado ao LEACH e ao LEACH-C [1] apresenta não somente um tempo maior de vida da rede como também um maior número de pacotes transmitidos e uma distribuição mais homogênea do nível de energia na rede.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9952359" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d45d3149960c218ce89a4380234f18cf" rel="nofollow" data-download="{"attachment_id":47595161,"asset_id":9952359,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47595161/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="24180538" href="https://telecom-paristech.academia.edu/DanielCamara">Daniel Camara</a><script data-card-contents-for-user="24180538" type="text/json">{"id":24180538,"first_name":"Daniel","last_name":"Camara","domain_name":"telecom-paristech","page_name":"DanielCamara","display_name":"Daniel Camara","profile_url":"https://telecom-paristech.academia.edu/DanielCamara?f_ri=11040","photo":"https://0.academia-photos.com/24180538/31456834/28866814/s65_daniel.camara.jpg"}</script></span></span></li><li class="js-paper-rank-work_9952359 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9952359"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9952359, container: ".js-paper-rank-work_9952359", }); });</script></li><li class="js-percentile-work_9952359 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9952359; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9952359"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9952359 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9952359"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9952359; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9952359]").text(description); $(".js-view-count-work_9952359").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9952359").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9952359"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="158569" rel="nofollow" href="https://www.academia.edu/Documents/in/Sensor_Network">Sensor Network</a>, <script data-card-contents-for-ri="158569" type="text/json">{"id":158569,"name":"Sensor Network","url":"https://www.academia.edu/Documents/in/Sensor_Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="743315" rel="nofollow" href="https://www.academia.edu/Documents/in/Redes_De_Sensores_Sem_Fio">Redes De Sensores Sem Fio</a>, <script data-card-contents-for-ri="743315" type="text/json">{"id":743315,"name":"Redes De Sensores Sem Fio","url":"https://www.academia.edu/Documents/in/Redes_De_Sensores_Sem_Fio?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="837273" rel="nofollow" href="https://www.academia.edu/Documents/in/Energy_Distribution">Energy Distribution</a><script data-card-contents-for-ri="837273" type="text/json">{"id":837273,"name":"Energy Distribution","url":"https://www.academia.edu/Documents/in/Energy_Distribution?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9952359]'), work: {"id":9952359,"title":"ICA: Um Novo Algoritmo de Roteamento para Redes de Sensores","created_at":"2014-12-30T05:29:04.168-08:00","url":"https://www.academia.edu/9952359/ICA_Um_Novo_Algoritmo_de_Roteamento_para_Redes_de_Sensores?f_ri=11040","dom_id":"work_9952359","summary":"This paper presents the Inter Cluster Routing Algorithm (ICA), a new and efficient routing algorithm for wireless sensor networks based on Low-Energy Adaptive Clustering Hierarchy (LEACH) [3]. The proposed algorithm, when compared with LEACH and LEACH-C[1], presents not only higher network lifetime but also higher number of sent messages. The energy maps show also that ICA presents a better energy distribution and degradation, when compared to LEACH and LEACH-C. ICA is indicated to sensor networks that collect data periodically and in which the network lifetime is an important parameter. Resumo. Este artigo apresenta um novo e eficiente algoritmo de roteamento para redes de sensores sem fio chamado Inter Cluster Routing Algorithm (ICA) baseado no Low-Energy Adaptive Clustering Hierarchy (LEACH) [3] . O ICA foi desenvolvido para redes de sensores que coletam informações periodicamente durante o tempo de vida da rede. Para estes ambientes a longevidade da rede é normalmente um fator de extrema importância. Os resultados de simulações mostram que o ICA quando comparado ao LEACH e ao LEACH-C [1] apresenta não somente um tempo maior de vida da rede como também um maior número de pacotes transmitidos e uma distribuição mais homogênea do nível de energia na rede.","downloadable_attachments":[{"id":47595161,"asset_id":9952359,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":24180538,"first_name":"Daniel","last_name":"Camara","domain_name":"telecom-paristech","page_name":"DanielCamara","display_name":"Daniel Camara","profile_url":"https://telecom-paristech.academia.edu/DanielCamara?f_ri=11040","photo":"https://0.academia-photos.com/24180538/31456834/28866814/s65_daniel.camara.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":158569,"name":"Sensor Network","url":"https://www.academia.edu/Documents/in/Sensor_Network?f_ri=11040","nofollow":true},{"id":743315,"name":"Redes De Sensores Sem Fio","url":"https://www.academia.edu/Documents/in/Redes_De_Sensores_Sem_Fio?f_ri=11040","nofollow":true},{"id":837273,"name":"Energy Distribution","url":"https://www.academia.edu/Documents/in/Energy_Distribution?f_ri=11040","nofollow":true},{"id":1211847,"name":"Wireless Sensor Network","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Network?f_ri=11040"},{"id":1561368,"name":"Network Lifetime","url":"https://www.academia.edu/Documents/in/Network_Lifetime?f_ri=11040"},{"id":2495915,"name":"Low Energy Adaptive Clustering Hierarchy","url":"https://www.academia.edu/Documents/in/Low_Energy_Adaptive_Clustering_Hierarchy?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14954467 coauthored" data-work_id="14954467" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14954467/A_Switch_Box_Architecture_to_Mitigate_Bridging_and_Short_Faults_in_SRAM_Based_FPGAs">A Switch Box Architecture to Mitigate Bridging and Short Faults in SRAM-Based FPGAs</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">SRAM-based FPGAs suffer from soft errors caused by cosmic particles. This paper introduces a new switch box architecture to mitigate soft errors. In this switch box architecture, the number of SRAM bits required for programming the switch... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_14954467" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">SRAM-based FPGAs suffer from soft errors caused by cosmic particles. This paper introduces a new switch box architecture to mitigate soft errors. In this switch box architecture, the number of SRAM bits required for programming the switch boxes is reduced by means of switch reduction with slight impact on routing capability of the switch box. This architecture does not require any modification of the existing placement and routing algorithms. The proposed architecture was evaluated on several MCNC benchmarks using VPR tool. The experimental results show that this architecture decreases the susceptibility of switch boxes to single event upsets by about 18% on average compared to the traditional ones. Also, our architecture decreases the probability of bridging and short faults in the switch boxes by about 32% on average.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14954467" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0bce25444c550f52402de3e7d04bd18d" rel="nofollow" data-download="{"attachment_id":43704603,"asset_id":14954467,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43704603/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33936059" href="https://independent.academia.edu/MortezaZamani2">Morteza Zamani</a><script data-card-contents-for-user="33936059" type="text/json">{"id":33936059,"first_name":"Morteza","last_name":"Zamani","domain_name":"independent","page_name":"MortezaZamani2","display_name":"Morteza Zamani","profile_url":"https://independent.academia.edu/MortezaZamani2?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-14954467">+1</span><div class="hidden js-additional-users-14954467"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://amirkabir.academia.edu/HEbrahimi">Hassan Ebrahimi</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-14954467'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-14954467').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_14954467 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14954467"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14954467, container: ".js-paper-rank-work_14954467", }); });</script></li><li class="js-percentile-work_14954467 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14954467; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14954467"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14954467 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14954467"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14954467; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14954467]").text(description); $(".js-view-count-work_14954467").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14954467").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14954467"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="5697" rel="nofollow" href="https://www.academia.edu/Documents/in/FPGA">FPGA</a>, <script data-card-contents-for-ri="5697" type="text/json">{"id":5697,"name":"FPGA","url":"https://www.academia.edu/Documents/in/FPGA?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a><script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14954467]'), work: {"id":14954467,"title":"A Switch Box Architecture to Mitigate Bridging and Short Faults in SRAM-Based FPGAs","created_at":"2015-08-16T04:55:52.464-07:00","url":"https://www.academia.edu/14954467/A_Switch_Box_Architecture_to_Mitigate_Bridging_and_Short_Faults_in_SRAM_Based_FPGAs?f_ri=11040","dom_id":"work_14954467","summary":"SRAM-based FPGAs suffer from soft errors caused by cosmic particles. This paper introduces a new switch box architecture to mitigate soft errors. In this switch box architecture, the number of SRAM bits required for programming the switch boxes is reduced by means of switch reduction with slight impact on routing capability of the switch box. This architecture does not require any modification of the existing placement and routing algorithms. The proposed architecture was evaluated on several MCNC benchmarks using VPR tool. The experimental results show that this architecture decreases the susceptibility of switch boxes to single event upsets by about 18% on average compared to the traditional ones. Also, our architecture decreases the probability of bridging and short faults in the switch boxes by about 32% on average.","downloadable_attachments":[{"id":43704603,"asset_id":14954467,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33936059,"first_name":"Morteza","last_name":"Zamani","domain_name":"independent","page_name":"MortezaZamani2","display_name":"Morteza Zamani","profile_url":"https://independent.academia.edu/MortezaZamani2?f_ri=11040","photo":"/images/s65_no_pic.png"},{"id":12087777,"first_name":"Hassan","last_name":"Ebrahimi","domain_name":"amirkabir","page_name":"HEbrahimi","display_name":"Hassan Ebrahimi","profile_url":"https://amirkabir.academia.edu/HEbrahimi?f_ri=11040","photo":"https://0.academia-photos.com/12087777/3469942/17854866/s65_hassan.ebrahimi.png"}],"research_interests":[{"id":5697,"name":"FPGA","url":"https://www.academia.edu/Documents/in/FPGA?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3463695" data-work_id="3463695" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3463695/On_the_Design_of_a_Photonic_Network_on_Chip">On the Design of a Photonic Network-on-Chip</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Recent remarkable advances in nanoscale siliconphotonic integrated circuitry specifically compatible with CMOS fabrication have generated new opportunities for leveraging the unique capabilities of optical technologies in the on-chip... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_3463695" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Recent remarkable advances in nanoscale siliconphotonic integrated circuitry specifically compatible with CMOS fabrication have generated new opportunities for leveraging the unique capabilities of optical technologies in the on-chip communications infrastructure. Based on these nano-photonic building blocks, we consider a photonic network-on-chip architecture designed to exploit the enormous transmission bandwidths, low latencies, and low power dissipation enabled by data exchange in the optical domain. The novel architectural approach employs a broadband photonic circuit-switched network driven in a distributed fashion by an electronic overlay control network which is also used for independent exchange of short messages. We address the critical network design issues for insertion in chip multiprocessors (CMP) applications, including topology, routing algorithms, path-setup and teardown procedures, and deadlock avoidance. Simulations show that this class of photonic networks-on-chip offers a significant leap in the performance for CMP intrachip communication systems delivering low-latencies and ultra-high throughputs per core while consuming minimal power.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3463695" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5f07f814cf02177cbdf45b38797fb4da" rel="nofollow" data-download="{"attachment_id":31219001,"asset_id":3463695,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31219001/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4050269" href="https://independent.academia.edu/RahaTudu">Raha Tudu</a><script data-card-contents-for-user="4050269" type="text/json">{"id":4050269,"first_name":"Raha","last_name":"Tudu","domain_name":"independent","page_name":"RahaTudu","display_name":"Raha Tudu","profile_url":"https://independent.academia.edu/RahaTudu?f_ri=11040","photo":"https://0.academia-photos.com/4050269/1548192/1878669/s65_raha.tudu.jpg"}</script></span></span></li><li class="js-paper-rank-work_3463695 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3463695"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3463695, container: ".js-paper-rank-work_3463695", }); });</script></li><li class="js-percentile-work_3463695 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3463695; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3463695"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3463695 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3463695"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3463695; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3463695]").text(description); $(".js-view-count-work_3463695").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3463695").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3463695"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">23</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2719" rel="nofollow" href="https://www.academia.edu/Documents/in/Photonic_Integrated_Circuits">Photonic Integrated Circuits</a>, <script data-card-contents-for-ri="2719" type="text/json">{"id":2719,"name":"Photonic Integrated Circuits","url":"https://www.academia.edu/Documents/in/Photonic_Integrated_Circuits?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="20029" rel="nofollow" href="https://www.academia.edu/Documents/in/Deadlock_Avoidance">Deadlock Avoidance</a>, <script data-card-contents-for-ri="20029" type="text/json">{"id":20029,"name":"Deadlock Avoidance","url":"https://www.academia.edu/Documents/in/Deadlock_Avoidance?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="44147" rel="nofollow" href="https://www.academia.edu/Documents/in/Silicon_Photonics">Silicon Photonics</a><script data-card-contents-for-ri="44147" type="text/json">{"id":44147,"name":"Silicon Photonics","url":"https://www.academia.edu/Documents/in/Silicon_Photonics?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3463695]'), work: {"id":3463695,"title":"On the Design of a Photonic Network-on-Chip","created_at":"2013-05-04T14:47:06.321-07:00","url":"https://www.academia.edu/3463695/On_the_Design_of_a_Photonic_Network_on_Chip?f_ri=11040","dom_id":"work_3463695","summary":"Recent remarkable advances in nanoscale siliconphotonic integrated circuitry specifically compatible with CMOS fabrication have generated new opportunities for leveraging the unique capabilities of optical technologies in the on-chip communications infrastructure. Based on these nano-photonic building blocks, we consider a photonic network-on-chip architecture designed to exploit the enormous transmission bandwidths, low latencies, and low power dissipation enabled by data exchange in the optical domain. The novel architectural approach employs a broadband photonic circuit-switched network driven in a distributed fashion by an electronic overlay control network which is also used for independent exchange of short messages. We address the critical network design issues for insertion in chip multiprocessors (CMP) applications, including topology, routing algorithms, path-setup and teardown procedures, and deadlock avoidance. Simulations show that this class of photonic networks-on-chip offers a significant leap in the performance for CMP intrachip communication systems delivering low-latencies and ultra-high throughputs per core while consuming minimal power.","downloadable_attachments":[{"id":31219001,"asset_id":3463695,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4050269,"first_name":"Raha","last_name":"Tudu","domain_name":"independent","page_name":"RahaTudu","display_name":"Raha Tudu","profile_url":"https://independent.academia.edu/RahaTudu?f_ri=11040","photo":"https://0.academia-photos.com/4050269/1548192/1878669/s65_raha.tudu.jpg"}],"research_interests":[{"id":2719,"name":"Photonic Integrated Circuits","url":"https://www.academia.edu/Documents/in/Photonic_Integrated_Circuits?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":20029,"name":"Deadlock Avoidance","url":"https://www.academia.edu/Documents/in/Deadlock_Avoidance?f_ri=11040","nofollow":true},{"id":44147,"name":"Silicon Photonics","url":"https://www.academia.edu/Documents/in/Silicon_Photonics?f_ri=11040","nofollow":true},{"id":61738,"name":"Architectural Design","url":"https://www.academia.edu/Documents/in/Architectural_Design?f_ri=11040"},{"id":89123,"name":"Broadband Networks","url":"https://www.academia.edu/Documents/in/Broadband_Networks?f_ri=11040"},{"id":89305,"name":"Network Design","url":"https://www.academia.edu/Documents/in/Network_Design?f_ri=11040"},{"id":125991,"name":"Networks on Chip (NoC)","url":"https://www.academia.edu/Documents/in/Networks_on_Chip_NoC_?f_ri=11040"},{"id":148428,"name":"Routing Algorithms","url":"https://www.academia.edu/Documents/in/Routing_Algorithms?f_ri=11040"},{"id":181287,"name":"Low Power","url":"https://www.academia.edu/Documents/in/Low_Power?f_ri=11040"},{"id":247667,"name":"Circuit Switching","url":"https://www.academia.edu/Documents/in/Circuit_Switching?f_ri=11040"},{"id":301555,"name":"Data Exchange","url":"https://www.academia.edu/Documents/in/Data_Exchange?f_ri=11040"},{"id":322954,"name":"Chip","url":"https://www.academia.edu/Documents/in/Chip?f_ri=11040"},{"id":456909,"name":"Network on chip","url":"https://www.academia.edu/Documents/in/Network_on_chip?f_ri=11040"},{"id":459378,"name":"Very high throughput","url":"https://www.academia.edu/Documents/in/Very_high_throughput?f_ri=11040"},{"id":644548,"name":"Low Latency","url":"https://www.academia.edu/Documents/in/Low_Latency?f_ri=11040"},{"id":874816,"name":"Optical Technology","url":"https://www.academia.edu/Documents/in/Optical_Technology?f_ri=11040"},{"id":936410,"name":"Bandwidth","url":"https://www.academia.edu/Documents/in/Bandwidth?f_ri=11040"},{"id":973134,"name":"Wireless Control Network","url":"https://www.academia.edu/Documents/in/Wireless_Control_Network?f_ri=11040"},{"id":992531,"name":"Multiprocessor System on Chip (MPSoC)","url":"https://www.academia.edu/Documents/in/Multiprocessor_System_on_Chip_MPSoC_?f_ri=11040"},{"id":1396752,"name":"Network on a Chip","url":"https://www.academia.edu/Documents/in/Network_on_a_Chip?f_ri=11040"},{"id":1437475,"name":"Power Dissipation","url":"https://www.academia.edu/Documents/in/Power_Dissipation?f_ri=11040"},{"id":2240546,"name":"Integrated Circuit Design","url":"https://www.academia.edu/Documents/in/Integrated_Circuit_Design?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_17466353 coauthored" data-work_id="17466353" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/17466353/Routing_algorithms_in_computers_networks">Routing algorithms in computers networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Routing in computer network is an essential functionality, which influence both the network management as the quality of services in global networks. The management of the traffic flows has to satisfy requirements for volume of traffic to... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_17466353" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Routing in computer network is an essential functionality, which influence both the network management as the quality of services in global networks. The management of the traffic flows has to satisfy requirements for volume of traffic to be transmitted as avoidance of congestions for decreasing the transmission delays. These two requirements in general are contradictory. The optimal traffic management is a key issue for the quality of the information services. Routing in networks, applying shortest path algorithm is widely used in communication protocols in WAN. Short explanations and illustration of these algorithms is given.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/17466353" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="fea63074f897badc6d3ea1d8abf57f10" rel="nofollow" data-download="{"attachment_id":39525041,"asset_id":17466353,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/39525041/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="36961989" href="https://independent.academia.edu/TodorStoilov">Todor Stoilov</a><script data-card-contents-for-user="36961989" type="text/json">{"id":36961989,"first_name":"Todor","last_name":"Stoilov","domain_name":"independent","page_name":"TodorStoilov","display_name":"Todor Stoilov","profile_url":"https://independent.academia.edu/TodorStoilov?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-17466353">+1</span><div class="hidden js-additional-users-17466353"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/KrasimiraStoilova">Krasimira Stoilova</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-17466353'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-17466353').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_17466353 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="17466353"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 17466353, container: ".js-paper-rank-work_17466353", }); });</script></li><li class="js-percentile-work_17466353 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 17466353; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_17466353"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_17466353 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="17466353"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 17466353; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=17466353]").text(description); $(".js-view-count-work_17466353").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_17466353").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="17466353"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="24438" rel="nofollow" href="https://www.academia.edu/Documents/in/Network_Management">Network Management</a>, <script data-card-contents-for-ri="24438" type="text/json">{"id":24438,"name":"Network Management","url":"https://www.academia.edu/Documents/in/Network_Management?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="47295" rel="nofollow" href="https://www.academia.edu/Documents/in/Traffic_Management">Traffic Management</a>, <script data-card-contents-for-ri="47295" type="text/json">{"id":47295,"name":"Traffic Management","url":"https://www.academia.edu/Documents/in/Traffic_Management?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="62540" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Network">Computer Network</a><script data-card-contents-for-ri="62540" type="text/json">{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=17466353]'), work: {"id":17466353,"title":"Routing algorithms in computers networks","created_at":"2015-10-29T07:05:49.668-07:00","url":"https://www.academia.edu/17466353/Routing_algorithms_in_computers_networks?f_ri=11040","dom_id":"work_17466353","summary":"Routing in computer network is an essential functionality, which influence both the network management as the quality of services in global networks. The management of the traffic flows has to satisfy requirements for volume of traffic to be transmitted as avoidance of congestions for decreasing the transmission delays. These two requirements in general are contradictory. The optimal traffic management is a key issue for the quality of the information services. Routing in networks, applying shortest path algorithm is widely used in communication protocols in WAN. Short explanations and illustration of these algorithms is given.","downloadable_attachments":[{"id":39525041,"asset_id":17466353,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":36961989,"first_name":"Todor","last_name":"Stoilov","domain_name":"independent","page_name":"TodorStoilov","display_name":"Todor Stoilov","profile_url":"https://independent.academia.edu/TodorStoilov?f_ri=11040","photo":"/images/s65_no_pic.png"},{"id":37215632,"first_name":"Krasimira","last_name":"Stoilova","domain_name":"independent","page_name":"KrasimiraStoilova","display_name":"Krasimira Stoilova","profile_url":"https://independent.academia.edu/KrasimiraStoilova?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":24438,"name":"Network Management","url":"https://www.academia.edu/Documents/in/Network_Management?f_ri=11040","nofollow":true},{"id":47295,"name":"Traffic Management","url":"https://www.academia.edu/Documents/in/Traffic_Management?f_ri=11040","nofollow":true},{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040","nofollow":true},{"id":91375,"name":"Quality of Service","url":"https://www.academia.edu/Documents/in/Quality_of_Service?f_ri=11040"},{"id":177973,"name":"Information Service","url":"https://www.academia.edu/Documents/in/Information_Service?f_ri=11040"},{"id":220371,"name":"Traffic Flow","url":"https://www.academia.edu/Documents/in/Traffic_Flow?f_ri=11040"},{"id":546617,"name":"Communication Protocol","url":"https://www.academia.edu/Documents/in/Communication_Protocol?f_ri=11040"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=11040"},{"id":937133,"name":"Shortest Path","url":"https://www.academia.edu/Documents/in/Shortest_Path?f_ri=11040"},{"id":958863,"name":"Network Traffic","url":"https://www.academia.edu/Documents/in/Network_Traffic?f_ri=11040"},{"id":1991649,"name":"Shortest Path algorithm","url":"https://www.academia.edu/Documents/in/Shortest_Path_algorithm?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_584440" data-work_id="584440" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/584440/Bandwidth_delay_constrained_routing_algorithms_1">Bandwidth-delay constrained routing algorithms* 1</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/584440" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3b38995cd61528da848f03dfbc01d824" rel="nofollow" data-download="{"attachment_id":3033409,"asset_id":584440,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/3033409/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="34822" href="https://hkust.academia.edu/JogeshMuppala">Jogesh Muppala</a><script data-card-contents-for-user="34822" type="text/json">{"id":34822,"first_name":"Jogesh","last_name":"Muppala","domain_name":"hkust","page_name":"JogeshMuppala","display_name":"Jogesh Muppala","profile_url":"https://hkust.academia.edu/JogeshMuppala?f_ri=11040","photo":"https://0.academia-photos.com/34822/82072/89937/s65_jogesh.muppala.jpg"}</script></span></span></li><li class="js-paper-rank-work_584440 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="584440"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 584440, container: ".js-paper-rank-work_584440", }); });</script></li><li class="js-percentile-work_584440 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 584440; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_584440"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_584440 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="584440"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 584440; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=584440]").text(description); $(".js-view-count-work_584440").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_584440").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="584440"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" rel="nofollow" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="923" rel="nofollow" href="https://www.academia.edu/Documents/in/Technology">Technology</a>, <script data-card-contents-for-ri="923" type="text/json">{"id":923,"name":"Technology","url":"https://www.academia.edu/Documents/in/Technology?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="4252" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Networks">Computer Networks</a>, <script data-card-contents-for-ri="4252" type="text/json">{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="8132" rel="nofollow" href="https://www.academia.edu/Documents/in/Voice_over_IP">Voice over IP</a><script data-card-contents-for-ri="8132" type="text/json">{"id":8132,"name":"Voice over IP","url":"https://www.academia.edu/Documents/in/Voice_over_IP?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=584440]'), work: {"id":584440,"title":"Bandwidth-delay constrained routing algorithms* 1","created_at":"2011-05-12T08:16:39.635-07:00","url":"https://www.academia.edu/584440/Bandwidth_delay_constrained_routing_algorithms_1?f_ri=11040","dom_id":"work_584440","summary":null,"downloadable_attachments":[{"id":3033409,"asset_id":584440,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":34822,"first_name":"Jogesh","last_name":"Muppala","domain_name":"hkust","page_name":"JogeshMuppala","display_name":"Jogesh Muppala","profile_url":"https://hkust.academia.edu/JogeshMuppala?f_ri=11040","photo":"https://0.academia-photos.com/34822/82072/89937/s65_jogesh.muppala.jpg"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=11040","nofollow":true},{"id":923,"name":"Technology","url":"https://www.academia.edu/Documents/in/Technology?f_ri=11040","nofollow":true},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true},{"id":8132,"name":"Voice over IP","url":"https://www.academia.edu/Documents/in/Voice_over_IP?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040"},{"id":14359,"name":"Traffic Engineering","url":"https://www.academia.edu/Documents/in/Traffic_Engineering?f_ri=11040"},{"id":379527,"name":"MPLS","url":"https://www.academia.edu/Documents/in/MPLS?f_ri=11040"},{"id":606634,"name":"Maximum Flow","url":"https://www.academia.edu/Documents/in/Maximum_Flow?f_ri=11040"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=11040"},{"id":1015576,"name":"Multimedia Application","url":"https://www.academia.edu/Documents/in/Multimedia_Application?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9374745" data-work_id="9374745" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9374745/A_scalable_P2P_recommender_system_based_on_distributed_collaborative_filtering">A scalable P2P recommender system based on distributed collaborative filtering</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Collaborative Filtering (CF) technique has been proved to be one of the most successful techniques in recommender systems in recent years. However, most existing CF based recommender systems worked in a centralized way and suffered from... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9374745" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Collaborative Filtering (CF) technique has been proved to be one of the most successful techniques in recommender systems in recent years. However, most existing CF based recommender systems worked in a centralized way and suffered from its shortage in scalability as their calculation complexity increased quickly both in time and space when the record in user database increases. In this article, we first propose a distributed CF algorithm called PipeCF together with two novel approaches: significance refinement and unanimous amplification, to further improve the scalability and prediction accuracy. We then show how to implement this algorithm on a Peer-to-Peer (P2P) structure through distributed hash table method, which is the most popular and efficient P2P routing algorithm, to construct a scalable distributed recommender system. The experimental data show that the distributed CF-based recommender system has much better scalability than traditional centralized ones with comparable prediction efficiency and accuracy. q</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9374745" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3d9d383b2ace57437e439c1acefedee3" rel="nofollow" data-download="{"attachment_id":47805073,"asset_id":9374745,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47805073/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21732594" href="https://iaa-tz.academia.edu/FanYang">Fan Yang</a><script data-card-contents-for-user="21732594" type="text/json">{"id":21732594,"first_name":"Fan","last_name":"Yang","domain_name":"iaa-tz","page_name":"FanYang","display_name":"Fan Yang","profile_url":"https://iaa-tz.academia.edu/FanYang?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_9374745 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9374745"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9374745, container: ".js-paper-rank-work_9374745", }); });</script></li><li class="js-percentile-work_9374745 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9374745; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9374745"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9374745 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9374745"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9374745; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9374745]").text(description); $(".js-view-count-work_9374745").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9374745").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9374745"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="77193" rel="nofollow" href="https://www.academia.edu/Documents/in/Collaborative_Filtering">Collaborative Filtering</a>, <script data-card-contents-for-ri="77193" type="text/json">{"id":77193,"name":"Collaborative Filtering","url":"https://www.academia.edu/Documents/in/Collaborative_Filtering?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="80414" rel="nofollow" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a>, <script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="121754" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Hash_Table">Distributed Hash Table</a><script data-card-contents-for-ri="121754" type="text/json">{"id":121754,"name":"Distributed Hash Table","url":"https://www.academia.edu/Documents/in/Distributed_Hash_Table?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9374745]'), work: {"id":9374745,"title":"A scalable P2P recommender system based on distributed collaborative filtering","created_at":"2014-11-18T07:38:41.086-08:00","url":"https://www.academia.edu/9374745/A_scalable_P2P_recommender_system_based_on_distributed_collaborative_filtering?f_ri=11040","dom_id":"work_9374745","summary":"Collaborative Filtering (CF) technique has been proved to be one of the most successful techniques in recommender systems in recent years. However, most existing CF based recommender systems worked in a centralized way and suffered from its shortage in scalability as their calculation complexity increased quickly both in time and space when the record in user database increases. In this article, we first propose a distributed CF algorithm called PipeCF together with two novel approaches: significance refinement and unanimous amplification, to further improve the scalability and prediction accuracy. We then show how to implement this algorithm on a Peer-to-Peer (P2P) structure through distributed hash table method, which is the most popular and efficient P2P routing algorithm, to construct a scalable distributed recommender system. The experimental data show that the distributed CF-based recommender system has much better scalability than traditional centralized ones with comparable prediction efficiency and accuracy. q","downloadable_attachments":[{"id":47805073,"asset_id":9374745,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21732594,"first_name":"Fan","last_name":"Yang","domain_name":"iaa-tz","page_name":"FanYang","display_name":"Fan Yang","profile_url":"https://iaa-tz.academia.edu/FanYang?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":77193,"name":"Collaborative Filtering","url":"https://www.academia.edu/Documents/in/Collaborative_Filtering?f_ri=11040","nofollow":true},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=11040","nofollow":true},{"id":121754,"name":"Distributed Hash Table","url":"https://www.academia.edu/Documents/in/Distributed_Hash_Table?f_ri=11040","nofollow":true},{"id":153179,"name":"Recommender System","url":"https://www.academia.edu/Documents/in/Recommender_System?f_ri=11040"},{"id":290886,"name":"Peer to Peer","url":"https://www.academia.edu/Documents/in/Peer_to_Peer?f_ri=11040"},{"id":401160,"name":"Distributed Collaboration","url":"https://www.academia.edu/Documents/in/Distributed_Collaboration?f_ri=11040"},{"id":1120502,"name":"Experimental Data","url":"https://www.academia.edu/Documents/in/Experimental_Data?f_ri=11040"},{"id":1671808,"name":"Prediction Accuracy","url":"https://www.academia.edu/Documents/in/Prediction_Accuracy?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_68718295" data-work_id="68718295" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/68718295/Application_of_Hopfield_neural_network_in_routing_for_computer_networks">Application of Hopfield neural network in routing for computer networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In packet switched computer networks, data are routed along communication links making up the network, the problem arises of how to determine the shortest paths to route the data. Each link has a cost representing the desirability of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_68718295" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In packet switched computer networks, data are routed along communication links making up the network, the problem arises of how to determine the shortest paths to route the data. Each link has a cost representing the desirability of using that particular link. The shortest path then becomes the path in which the total link cost from a source node to</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/68718295" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="53a7dfe22b0db6ca9e32d8a9082d4b1c" rel="nofollow" data-download="{"attachment_id":79097882,"asset_id":68718295,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/79097882/download_file?st=MTc0MDU5Mjk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="156647815" href="https://univ-nantes.academia.edu/AdelSmeda">Adel Smeda</a><script data-card-contents-for-user="156647815" type="text/json">{"id":156647815,"first_name":"Adel","last_name":"Smeda","domain_name":"univ-nantes","page_name":"AdelSmeda","display_name":"Adel Smeda","profile_url":"https://univ-nantes.academia.edu/AdelSmeda?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_68718295 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="68718295"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 68718295, container: ".js-paper-rank-work_68718295", }); });</script></li><li class="js-percentile-work_68718295 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 68718295; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_68718295"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_68718295 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="68718295"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 68718295; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=68718295]").text(description); $(".js-view-count-work_68718295").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_68718295").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="68718295"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="26066" rel="nofollow" href="https://www.academia.edu/Documents/in/Neural_Network">Neural Network</a>, <script data-card-contents-for-ri="26066" type="text/json">{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="62540" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Network">Computer Network</a><script data-card-contents-for-ri="62540" type="text/json">{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=68718295]'), work: {"id":68718295,"title":"Application of Hopfield neural network in routing for computer networks","created_at":"2022-01-19T14:04:17.831-08:00","url":"https://www.academia.edu/68718295/Application_of_Hopfield_neural_network_in_routing_for_computer_networks?f_ri=11040","dom_id":"work_68718295","summary":"In packet switched computer networks, data are routed along communication links making up the network, the problem arises of how to determine the shortest paths to route the data. Each link has a cost representing the desirability of using that particular link. The shortest path then becomes the path in which the total link cost from a source node to","downloadable_attachments":[{"id":79097882,"asset_id":68718295,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":156647815,"first_name":"Adel","last_name":"Smeda","domain_name":"univ-nantes","page_name":"AdelSmeda","display_name":"Adel Smeda","profile_url":"https://univ-nantes.academia.edu/AdelSmeda?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=11040","nofollow":true},{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040","nofollow":true},{"id":217153,"name":"Traveling Salesman Problem","url":"https://www.academia.edu/Documents/in/Traveling_Salesman_Problem?f_ri=11040"},{"id":400023,"name":"Hopfield neural network","url":"https://www.academia.edu/Documents/in/Hopfield_neural_network?f_ri=11040"},{"id":937133,"name":"Shortest Path","url":"https://www.academia.edu/Documents/in/Shortest_Path?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_70879183" data-work_id="70879183" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" rel="nofollow" href="https://www.academia.edu/70879183/A_simple_multipath_OpenFlow_controller_using_topology_based_algorithm_for_multipath_TCP">A simple multipath OpenFlow controller using topology-based algorithm for multipath TCP</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Multipath TCP, or MPTCP, is a widely-researched mechanism that allows a single application-level connection to be split to more than one TCP stream, and consequently more than one network interface, as opposed to the traditional TCP/IP... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_70879183" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Multipath TCP, or MPTCP, is a widely-researched mechanism that allows a single application-level connection to be split to more than one TCP stream, and consequently more than one network interface, as opposed to the traditional TCP/IP model. Being a transport layer protocol, MPTCP can easily interact between the application using it and the network supporting it. However, MPTCP does not have control of its own route. Default IP routing behavior generally takes all traffic through the shortest or best-metric path. However, this behavior may actually cause paths to collide with each other, creating contention for bandwidth in a number of edges. This can result in a bottleneck which limits the throughput of the network. Therefore, a multipath routing mechanism is necessary to ensure smooth operation of MPTCP. We created smoc, a Simple Multipath OpenFlow Controller, that uses only topology information of the network to avoid collision where possible. Evaluation of smoc in a virtual local-area and a physical wide-area SDNs showed favorable results as smoc provided better performance than simple or spanning-tree routing mechanisms.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/70879183" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7eb91508475054e9a9baf40ab6fd552c" rel="nofollow" data-download="{"attachment_id":80444329,"asset_id":70879183,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80444329/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="59004125" rel="nofollow" href="https://independent.academia.edu/KoheiIchikawa">Kohei Ichikawa</a><script data-card-contents-for-user="59004125" type="text/json">{"id":59004125,"first_name":"Kohei","last_name":"Ichikawa","domain_name":"independent","page_name":"KoheiIchikawa","display_name":"Kohei Ichikawa","profile_url":"https://independent.academia.edu/KoheiIchikawa?f_ri=11040","photo":"https://gravatar.com/avatar/610cce741028e3b1b8d449e45c1a016d?s=65"}</script></span></span></li><li class="js-paper-rank-work_70879183 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="70879183"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 70879183, container: ".js-paper-rank-work_70879183", }); });</script></li><li class="js-percentile-work_70879183 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 70879183; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_70879183"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_70879183 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="70879183"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 70879183; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=70879183]").text(description); $(".js-view-count-work_70879183").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_70879183").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="70879183"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="440" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="4252" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Networks">Computer Networks</a>, <script data-card-contents-for-ri="4252" type="text/json">{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a><script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=70879183]'), work: {"id":70879183,"title":"A simple multipath OpenFlow controller using topology-based algorithm for multipath TCP","created_at":"2022-02-07T15:53:20.814-08:00","url":"https://www.academia.edu/70879183/A_simple_multipath_OpenFlow_controller_using_topology_based_algorithm_for_multipath_TCP?f_ri=11040","dom_id":"work_70879183","summary":"Multipath TCP, or MPTCP, is a widely-researched mechanism that allows a single application-level connection to be split to more than one TCP stream, and consequently more than one network interface, as opposed to the traditional TCP/IP model. Being a transport layer protocol, MPTCP can easily interact between the application using it and the network supporting it. However, MPTCP does not have control of its own route. Default IP routing behavior generally takes all traffic through the shortest or best-metric path. However, this behavior may actually cause paths to collide with each other, creating contention for bandwidth in a number of edges. This can result in a bottleneck which limits the throughput of the network. Therefore, a multipath routing mechanism is necessary to ensure smooth operation of MPTCP. We created smoc, a Simple Multipath OpenFlow Controller, that uses only topology information of the network to avoid collision where possible. Evaluation of smoc in a virtual local-area and a physical wide-area SDNs showed favorable results as smoc provided better performance than simple or spanning-tree routing mechanisms.","downloadable_attachments":[{"id":80444329,"asset_id":70879183,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":59004125,"first_name":"Kohei","last_name":"Ichikawa","domain_name":"independent","page_name":"KoheiIchikawa","display_name":"Kohei Ichikawa","profile_url":"https://independent.academia.edu/KoheiIchikawa?f_ri=11040","photo":"https://gravatar.com/avatar/610cce741028e3b1b8d449e45c1a016d?s=65"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true},{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":37747,"name":"OpenFlow","url":"https://www.academia.edu/Documents/in/OpenFlow?f_ri=11040"},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=11040"},{"id":476346,"name":"Multipath TCP","url":"https://www.academia.edu/Documents/in/Multipath_TCP?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_72216604" data-work_id="72216604" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" rel="nofollow" href="https://www.academia.edu/72216604/Deadlock_avoidance_for_interconnection_networks_with_multiple_dynamic_faults">Deadlock avoidance for interconnection networks with multiple dynamic faults</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Abstract The intensive and continuous use of high-performance computing systems for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_72216604" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Abstract The intensive and continuous use of high-performance computing systems for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of failures during their operation. Clearly, network faults have an extremely high impact because most routing algorithms are not designed to tolerate faults. In such algorithms, just a single fault may lead to deadlocked configurations thus preventing the correct finalization of applications. This paper ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/72216604" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="32066176" href="https://uab.academia.edu/EFad%C3%B3n">E. Fadón</a><script data-card-contents-for-user="32066176" type="text/json">{"id":32066176,"first_name":"E.","last_name":"Fadón","domain_name":"uab","page_name":"EFadón","display_name":"E. Fadón","profile_url":"https://uab.academia.edu/EFad%C3%B3n?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_72216604 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="72216604"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 72216604, container: ".js-paper-rank-work_72216604", }); });</script></li><li class="js-percentile-work_72216604 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 72216604; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_72216604"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_72216604 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="72216604"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 72216604; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=72216604]").text(description); $(".js-view-count-work_72216604").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_72216604").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="72216604"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="20029" rel="nofollow" href="https://www.academia.edu/Documents/in/Deadlock_Avoidance">Deadlock Avoidance</a>, <script data-card-contents-for-ri="20029" type="text/json">{"id":20029,"name":"Deadlock Avoidance","url":"https://www.academia.edu/Documents/in/Deadlock_Avoidance?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="304351" rel="nofollow" href="https://www.academia.edu/Documents/in/Adaptive_Routing">Adaptive Routing</a>, <script data-card-contents-for-ri="304351" type="text/json">{"id":304351,"name":"Adaptive Routing","url":"https://www.academia.edu/Documents/in/Adaptive_Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="850706" rel="nofollow" href="https://www.academia.edu/Documents/in/High_performance_computer">High performance computer</a><script data-card-contents-for-ri="850706" type="text/json">{"id":850706,"name":"High performance computer","url":"https://www.academia.edu/Documents/in/High_performance_computer?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=72216604]'), work: {"id":72216604,"title":"Deadlock avoidance for interconnection networks with multiple dynamic faults","created_at":"2022-02-22T04:38:59.856-08:00","url":"https://www.academia.edu/72216604/Deadlock_avoidance_for_interconnection_networks_with_multiple_dynamic_faults?f_ri=11040","dom_id":"work_72216604","summary":"Abstract The intensive and continuous use of high-performance computing systems for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of failures during their operation. Clearly, network faults have an extremely high impact because most routing algorithms are not designed to tolerate faults. In such algorithms, just a single fault may lead to deadlocked configurations thus preventing the correct finalization of applications. This paper ...","downloadable_attachments":[],"ordered_authors":[{"id":32066176,"first_name":"E.","last_name":"Fadón","domain_name":"uab","page_name":"EFadón","display_name":"E. Fadón","profile_url":"https://uab.academia.edu/EFad%C3%B3n?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":20029,"name":"Deadlock Avoidance","url":"https://www.academia.edu/Documents/in/Deadlock_Avoidance?f_ri=11040","nofollow":true},{"id":304351,"name":"Adaptive Routing","url":"https://www.academia.edu/Documents/in/Adaptive_Routing?f_ri=11040","nofollow":true},{"id":850706,"name":"High performance computer","url":"https://www.academia.edu/Documents/in/High_performance_computer?f_ri=11040","nofollow":true}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28727315" data-work_id="28727315" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28727315/Hyperbolic_Routing_HR_">Hyperbolic Routing (HR)</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28727315" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ddc864e7fbe0b74499462960b9b8471f" rel="nofollow" data-download="{"attachment_id":49135881,"asset_id":28727315,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49135881/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="38858858" href="https://teknokrat.academia.edu/ahdansyaiful">syaiful ahdan</a><script data-card-contents-for-user="38858858" type="text/json">{"id":38858858,"first_name":"syaiful","last_name":"ahdan","domain_name":"teknokrat","page_name":"ahdansyaiful","display_name":"syaiful ahdan","profile_url":"https://teknokrat.academia.edu/ahdansyaiful?f_ri=11040","photo":"https://0.academia-photos.com/38858858/11530102/12859462/s65_syaiful.ahdan.jpg"}</script></span></span></li><li class="js-paper-rank-work_28727315 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28727315"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28727315, container: ".js-paper-rank-work_28727315", }); });</script></li><li class="js-percentile-work_28727315 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28727315; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28727315"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28727315 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28727315"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28727315; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28727315]").text(description); $(".js-view-count-work_28727315").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28727315").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28727315"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="118673" rel="nofollow" href="https://www.academia.edu/Documents/in/Hyperbolic_Geometry">Hyperbolic Geometry</a>, <script data-card-contents-for-ri="118673" type="text/json">{"id":118673,"name":"Hyperbolic Geometry","url":"https://www.academia.edu/Documents/in/Hyperbolic_Geometry?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="585966" rel="nofollow" href="https://www.academia.edu/Documents/in/Ns3_Network_Simulation">Ns3 Network Simulation</a>, <script data-card-contents-for-ri="585966" type="text/json">{"id":585966,"name":"Ns3 Network Simulation","url":"https://www.academia.edu/Documents/in/Ns3_Network_Simulation?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="1257644" rel="nofollow" href="https://www.academia.edu/Documents/in/NDN_Simulator">NDN Simulator</a><script data-card-contents-for-ri="1257644" type="text/json">{"id":1257644,"name":"NDN Simulator","url":"https://www.academia.edu/Documents/in/NDN_Simulator?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28727315]'), work: {"id":28727315,"title":"Hyperbolic Routing (HR)","created_at":"2016-09-26T12:15:25.164-07:00","url":"https://www.academia.edu/28727315/Hyperbolic_Routing_HR_?f_ri=11040","dom_id":"work_28727315","summary":null,"downloadable_attachments":[{"id":49135881,"asset_id":28727315,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":38858858,"first_name":"syaiful","last_name":"ahdan","domain_name":"teknokrat","page_name":"ahdansyaiful","display_name":"syaiful ahdan","profile_url":"https://teknokrat.academia.edu/ahdansyaiful?f_ri=11040","photo":"https://0.academia-photos.com/38858858/11530102/12859462/s65_syaiful.ahdan.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":118673,"name":"Hyperbolic Geometry","url":"https://www.academia.edu/Documents/in/Hyperbolic_Geometry?f_ri=11040","nofollow":true},{"id":585966,"name":"Ns3 Network Simulation","url":"https://www.academia.edu/Documents/in/Ns3_Network_Simulation?f_ri=11040","nofollow":true},{"id":1257644,"name":"NDN Simulator","url":"https://www.academia.edu/Documents/in/NDN_Simulator?f_ri=11040","nofollow":true}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_20522039" data-work_id="20522039" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/20522039/Routing_of_real_time_traffic_in_a_transformational_communications_architecture">Routing of real-time traffic in a transformational communications architecture</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper, we study a constraint-based routing strategy using label switching in a multi-layered hierarchical satellite constellation such as transformational communications architecture. Both quality (bit error rate on free space... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_20522039" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper, we study a constraint-based routing strategy using label switching in a multi-layered hierarchical satellite constellation such as transformational communications architecture. Both quality (bit error rate on free space optical and radio inter-satellite links) and bandwidth availability on a satellite link are taken into account when setting up routes for high priority real-time traffic such as VoIP, which is sensitive to delay and jitter. To protect the real-time traffic from being swamped by bursty best-effort traffic we propose to have a ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/20522039" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5513e8b1a1562dd8b2fd4500b8070fcc" rel="nofollow" data-download="{"attachment_id":41417334,"asset_id":20522039,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41417334/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="639899" href="https://wustl.academia.edu/RJain">Raj Jain</a><script data-card-contents-for-user="639899" type="text/json">{"id":639899,"first_name":"Raj","last_name":"Jain","domain_name":"wustl","page_name":"RJain","display_name":"Raj Jain","profile_url":"https://wustl.academia.edu/RJain?f_ri=11040","photo":"https://0.academia-photos.com/639899/21605660/20950353/s65_raj.jain.jpg"}</script></span></span></li><li class="js-paper-rank-work_20522039 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="20522039"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 20522039, container: ".js-paper-rank-work_20522039", }); });</script></li><li class="js-percentile-work_20522039 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 20522039; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_20522039"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_20522039 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="20522039"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 20522039; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=20522039]").text(description); $(".js-view-count-work_20522039").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_20522039").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="20522039"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="14668" rel="nofollow" href="https://www.academia.edu/Documents/in/Aerospace">Aerospace</a>, <script data-card-contents-for-ri="14668" type="text/json">{"id":14668,"name":"Aerospace","url":"https://www.academia.edu/Documents/in/Aerospace?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="164637" rel="nofollow" href="https://www.academia.edu/Documents/in/Bit_Error_Rate">Bit Error Rate</a>, <script data-card-contents-for-ri="164637" type="text/json">{"id":164637,"name":"Bit Error Rate","url":"https://www.academia.edu/Documents/in/Bit_Error_Rate?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="952560" rel="nofollow" href="https://www.academia.edu/Documents/in/Information_Rate">Information Rate</a><script data-card-contents-for-ri="952560" type="text/json">{"id":952560,"name":"Information Rate","url":"https://www.academia.edu/Documents/in/Information_Rate?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=20522039]'), work: {"id":20522039,"title":"Routing of real-time traffic in a transformational communications architecture","created_at":"2016-01-22T04:17:53.673-08:00","url":"https://www.academia.edu/20522039/Routing_of_real_time_traffic_in_a_transformational_communications_architecture?f_ri=11040","dom_id":"work_20522039","summary":"In this paper, we study a constraint-based routing strategy using label switching in a multi-layered hierarchical satellite constellation such as transformational communications architecture. Both quality (bit error rate on free space optical and radio inter-satellite links) and bandwidth availability on a satellite link are taken into account when setting up routes for high priority real-time traffic such as VoIP, which is sensitive to delay and jitter. To protect the real-time traffic from being swamped by bursty best-effort traffic we propose to have a ...","downloadable_attachments":[{"id":41417334,"asset_id":20522039,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":639899,"first_name":"Raj","last_name":"Jain","domain_name":"wustl","page_name":"RJain","display_name":"Raj Jain","profile_url":"https://wustl.academia.edu/RJain?f_ri=11040","photo":"https://0.academia-photos.com/639899/21605660/20950353/s65_raj.jain.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":14668,"name":"Aerospace","url":"https://www.academia.edu/Documents/in/Aerospace?f_ri=11040","nofollow":true},{"id":164637,"name":"Bit Error Rate","url":"https://www.academia.edu/Documents/in/Bit_Error_Rate?f_ri=11040","nofollow":true},{"id":952560,"name":"Information Rate","url":"https://www.academia.edu/Documents/in/Information_Rate?f_ri=11040","nofollow":true},{"id":1009416,"name":"Real Time Traffic","url":"https://www.academia.edu/Documents/in/Real_Time_Traffic?f_ri=11040"},{"id":1393231,"name":"Satellite Network","url":"https://www.academia.edu/Documents/in/Satellite_Network?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_39747540" data-work_id="39747540" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" rel="nofollow" href="https://www.academia.edu/39747540/New_Trends_in_Cryptography_and_Information_Security">New Trends in Cryptography and Information Security</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">International Journal on Cryptography and Information Security ( IJCIS) is an open access peer reviewed journal that focuses on cutting-edge results in applied cryptography and Information security. It aims to bring together scientists,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_39747540" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">International Journal on Cryptography and Information Security ( IJCIS) is an open access peer reviewed journal that focuses on cutting-edge results in applied cryptography and Information security. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/39747540" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e55c078557e60f9f854fb920a0d3e31c" rel="nofollow" data-download="{"attachment_id":59927658,"asset_id":39747540,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/59927658/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="19074289" rel="nofollow" href="https://independent.academia.edu/ijcisjournal">International Journal on Cryptography and Information Security (IJCIS)</a><script data-card-contents-for-user="19074289" type="text/json">{"id":19074289,"first_name":"International Journal on Cryptography and Information Security","last_name":"(IJCIS)","domain_name":"independent","page_name":"ijcisjournal","display_name":"International Journal on Cryptography and Information Security (IJCIS)","profile_url":"https://independent.academia.edu/ijcisjournal?f_ri=11040","photo":"https://0.academia-photos.com/19074289/7767869/36564340/s65_international_journal_on_cryptography_and_information_security._ijcis_.jpg"}</script></span></span></li><li class="js-paper-rank-work_39747540 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="39747540"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 39747540, container: ".js-paper-rank-work_39747540", }); });</script></li><li class="js-percentile-work_39747540 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 39747540; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_39747540"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_39747540 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="39747540"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 39747540; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=39747540]").text(description); $(".js-view-count-work_39747540").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_39747540").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="39747540"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">18</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="324" rel="nofollow" href="https://www.academia.edu/Documents/in/Mathematics_of_Cryptography">Mathematics of Cryptography</a>, <script data-card-contents-for-ri="324" type="text/json">{"id":324,"name":"Mathematics of Cryptography","url":"https://www.academia.edu/Documents/in/Mathematics_of_Cryptography?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="2339" rel="nofollow" href="https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks">Mobile Ad Hoc Networks</a>, <script data-card-contents-for-ri="2339" type="text/json">{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a><script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=39747540]'), work: {"id":39747540,"title":"New Trends in Cryptography and Information Security","created_at":"2019-07-04T00:20:28.909-07:00","url":"https://www.academia.edu/39747540/New_Trends_in_Cryptography_and_Information_Security?f_ri=11040","dom_id":"work_39747540","summary":"International Journal on Cryptography and Information Security ( IJCIS) is an open access peer reviewed journal that focuses on cutting-edge results in applied cryptography and Information security. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.","downloadable_attachments":[{"id":59927658,"asset_id":39747540,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":19074289,"first_name":"International Journal on Cryptography and Information Security","last_name":"(IJCIS)","domain_name":"independent","page_name":"ijcisjournal","display_name":"International Journal on Cryptography and Information Security (IJCIS)","profile_url":"https://independent.academia.edu/ijcisjournal?f_ri=11040","photo":"https://0.academia-photos.com/19074289/7767869/36564340/s65_international_journal_on_cryptography_and_information_security._ijcis_.jpg"}],"research_interests":[{"id":324,"name":"Mathematics of Cryptography","url":"https://www.academia.edu/Documents/in/Mathematics_of_Cryptography?f_ri=11040","nofollow":true},{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":14335,"name":"MANET Routing protocols","url":"https://www.academia.edu/Documents/in/MANET_Routing_protocols?f_ri=11040"},{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=11040"},{"id":16585,"name":"Quantum Cryptography","url":"https://www.academia.edu/Documents/in/Quantum_Cryptography?f_ri=11040"},{"id":17634,"name":"Internet Routing Protocol","url":"https://www.academia.edu/Documents/in/Internet_Routing_Protocol?f_ri=11040"},{"id":21862,"name":"Obfuscation (Information Security And Cryptography)","url":"https://www.academia.edu/Documents/in/Obfuscation_Information_Security_And_Cryptography_?f_ri=11040"},{"id":23383,"name":"Routing protocols","url":"https://www.academia.edu/Documents/in/Routing_protocols?f_ri=11040"},{"id":40901,"name":"Network Protocols and Architectures","url":"https://www.academia.edu/Documents/in/Network_Protocols_and_Architectures?f_ri=11040"},{"id":58607,"name":"Mobile Ad Hoc Network","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Network?f_ri=11040"},{"id":67545,"name":"Network Protocols","url":"https://www.academia.edu/Documents/in/Network_Protocols?f_ri=11040"},{"id":109210,"name":"Energy Efficient Protocols in Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Energy_Efficient_Protocols_in_Wireless_Sensor_Networks?f_ri=11040"},{"id":128576,"name":"Mobile Ad-hoc Networks (MANETs)","url":"https://www.academia.edu/Documents/in/Mobile_Ad-hoc_Networks_MANETs_?f_ri=11040"},{"id":288703,"name":"Routing Protocol","url":"https://www.academia.edu/Documents/in/Routing_Protocol?f_ri=11040"},{"id":331895,"name":"Visual Cryptography","url":"https://www.academia.edu/Documents/in/Visual_Cryptography?f_ri=11040"},{"id":1007403,"name":"Network Protocols and Systems","url":"https://www.academia.edu/Documents/in/Network_Protocols_and_Systems?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_29344788 coauthored" data-work_id="29344788" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/29344788/The_Ethics_of_Algorithms_Mapping_the_Debate">The Ethics of Algorithms: Mapping the Debate</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In information societies, operations, decisions and choices previously left to humans are increasingly delegated to algorithms, which may advise, if not decide, about how data should be interpreted and what actions should be taken as a... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_29344788" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In information societies, operations, decisions and choices previously left to humans are increasingly delegated to algorithms, which may advise, if not decide, about how data should be interpreted and what actions should be taken as a result. More and more often, algorithms mediate social processes, business transactions, governmental decisions, and how we perceive, understand, and interact among ourselves and with the environment. Gaps between the design and operation of algorithms and our understanding of their ethical implications can have severe consequences affecting individuals as well as groups and whole societies. This paper makes three contributions to clarify the ethical importance of algorithmic mediation. It provides a prescriptive map to organise the debate. It reviews the current discussion of ethical aspects of algorithms. And it assesses the available literature in order to identify areas requiring further work to develop the ethics of algorithms.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/29344788" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="101ccc946d59d38decfb70d0467e4e01" rel="nofollow" data-download="{"attachment_id":51111739,"asset_id":29344788,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/51111739/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="2050164" href="https://oxford.academia.edu/BrentMittelstadt">Brent Mittelstadt</a><script data-card-contents-for-user="2050164" type="text/json">{"id":2050164,"first_name":"Brent","last_name":"Mittelstadt","domain_name":"oxford","page_name":"BrentMittelstadt","display_name":"Brent Mittelstadt","profile_url":"https://oxford.academia.edu/BrentMittelstadt?f_ri=11040","photo":"https://0.academia-photos.com/2050164/674220/4372339/s65_brent.mittelstadt.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-29344788">+4</span><div class="hidden js-additional-users-29344788"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://vub.academia.edu/PatrickAllo">Patrick Allo</a></span></div><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://oxford.academia.edu/MariaTadeo">Mariarosaria Taddeo</a></span></div><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://oxford.academia.edu/SandraWachter">Sandra Wachter</a></span></div><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://yale.academia.edu/LucianoFloridi">Luciano Floridi</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-29344788'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-29344788').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_29344788 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="29344788"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 29344788, container: ".js-paper-rank-work_29344788", }); });</script></li><li class="js-percentile-work_29344788 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 29344788; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_29344788"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_29344788 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="29344788"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 29344788; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=29344788]").text(description); $(".js-view-count-work_29344788").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_29344788").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="29344788"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">148</a>  </div><span class="InlineList-item-text u-textTruncate u-pl11x"><a class="InlineList-item-text" data-has-card-for-ri="46" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_Ethics">Business Ethics</a>, <script data-card-contents-for-ri="46" type="text/json">{"id":46,"name":"Business Ethics","url":"https://www.academia.edu/Documents/in/Business_Ethics?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="422" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="428" rel="nofollow" href="https://www.academia.edu/Documents/in/Algorithms">Algorithms</a>, <script data-card-contents-for-ri="428" type="text/json">{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="431" rel="nofollow" href="https://www.academia.edu/Documents/in/Parallel_Algorithms">Parallel Algorithms</a><script data-card-contents-for-ri="431" type="text/json">{"id":431,"name":"Parallel Algorithms","url":"https://www.academia.edu/Documents/in/Parallel_Algorithms?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=29344788]'), work: {"id":29344788,"title":"The Ethics of Algorithms: Mapping the Debate","created_at":"2016-10-22T06:37:34.948-07:00","url":"https://www.academia.edu/29344788/The_Ethics_of_Algorithms_Mapping_the_Debate?f_ri=11040","dom_id":"work_29344788","summary":"In information societies, operations, decisions and choices previously left to humans are increasingly delegated to algorithms, which may advise, if not decide, about how data should be interpreted and what actions should be taken as a result. More and more often, algorithms mediate social processes, business transactions, governmental decisions, and how we perceive, understand, and interact among ourselves and with the environment. Gaps between the design and operation of algorithms and our understanding of their ethical implications can have severe consequences affecting individuals as well as groups and whole societies. This paper makes three contributions to clarify the ethical importance of algorithmic mediation. It provides a prescriptive map to organise the debate. It reviews the current discussion of ethical aspects of algorithms. And it assesses the available literature in order to identify areas requiring further work to develop the ethics of algorithms.","downloadable_attachments":[{"id":51111739,"asset_id":29344788,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":2050164,"first_name":"Brent","last_name":"Mittelstadt","domain_name":"oxford","page_name":"BrentMittelstadt","display_name":"Brent Mittelstadt","profile_url":"https://oxford.academia.edu/BrentMittelstadt?f_ri=11040","photo":"https://0.academia-photos.com/2050164/674220/4372339/s65_brent.mittelstadt.jpg"},{"id":12226954,"first_name":"Patrick","last_name":"Allo","domain_name":"vub","page_name":"PatrickAllo","display_name":"Patrick Allo","profile_url":"https://vub.academia.edu/PatrickAllo?f_ri=11040","photo":"https://0.academia-photos.com/12226954/3941358/11634345/s65_patrick.allo.jpg"},{"id":268636,"first_name":"Mariarosaria","last_name":"Taddeo","domain_name":"oxford","page_name":"MariaTadeo","display_name":"Mariarosaria Taddeo","profile_url":"https://oxford.academia.edu/MariaTadeo?f_ri=11040","photo":"https://0.academia-photos.com/268636/531077/17072682/s65_mariarosaria.taddeo.jpg"},{"id":55640176,"first_name":"Sandra","last_name":"Wachter","domain_name":"oxford","page_name":"SandraWachter","display_name":"Sandra Wachter","profile_url":"https://oxford.academia.edu/SandraWachter?f_ri=11040","photo":"https://0.academia-photos.com/55640176/15009734/15747283/s65_sandra.wachter.jpg"},{"id":6616,"first_name":"Luciano","last_name":"Floridi","domain_name":"yale","page_name":"LucianoFloridi","display_name":"Luciano Floridi","profile_url":"https://yale.academia.edu/LucianoFloridi?f_ri=11040","photo":"https://0.academia-photos.com/6616/2546/117746817/s65_luciano.floridi.jpg"}],"research_interests":[{"id":46,"name":"Business Ethics","url":"https://www.academia.edu/Documents/in/Business_Ethics?f_ri=11040","nofollow":true},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=11040","nofollow":true},{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=11040","nofollow":true},{"id":431,"name":"Parallel Algorithms","url":"https://www.academia.edu/Documents/in/Parallel_Algorithms?f_ri=11040","nofollow":true},{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=11040"},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=11040"},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=11040"},{"id":472,"name":"Human Computer Interaction","url":"https://www.academia.edu/Documents/in/Human_Computer_Interaction?f_ri=11040"},{"id":534,"name":"Law","url":"https://www.academia.edu/Documents/in/Law?f_ri=11040"},{"id":803,"name":"Philosophy","url":"https://www.academia.edu/Documents/in/Philosophy?f_ri=11040"},{"id":806,"name":"Philosophy of Mind","url":"https://www.academia.edu/Documents/in/Philosophy_of_Mind?f_ri=11040"},{"id":807,"name":"Philosophy Of Language","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Language?f_ri=11040"},{"id":813,"name":"Political Philosophy","url":"https://www.academia.edu/Documents/in/Political_Philosophy?f_ri=11040"},{"id":814,"name":"Ethics","url":"https://www.academia.edu/Documents/in/Ethics?f_ri=11040"},{"id":821,"name":"Philosophy of Science","url":"https://www.academia.edu/Documents/in/Philosophy_of_Science?f_ri=11040"},{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=11040"},{"id":855,"name":"Philosophy of Technology","url":"https://www.academia.edu/Documents/in/Philosophy_of_Technology?f_ri=11040"},{"id":904,"name":"Normative Ethics","url":"https://www.academia.edu/Documents/in/Normative_Ethics?f_ri=11040"},{"id":905,"name":"Meta-Ethics","url":"https://www.academia.edu/Documents/in/Meta-Ethics?f_ri=11040"},{"id":906,"name":"Applied Ethics","url":"https://www.academia.edu/Documents/in/Applied_Ethics?f_ri=11040"},{"id":907,"name":"Moral Psychology","url":"https://www.academia.edu/Documents/in/Moral_Psychology?f_ri=11040"},{"id":1380,"name":"Computer Engineering","url":"https://www.academia.edu/Documents/in/Computer_Engineering?f_ri=11040"},{"id":1448,"name":"Software Security","url":"https://www.academia.edu/Documents/in/Software_Security?f_ri=11040"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms?f_ri=11040"},{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning?f_ri=11040"},{"id":2459,"name":"Social Philosophy","url":"https://www.academia.edu/Documents/in/Social_Philosophy?f_ri=11040"},{"id":2504,"name":"Research Ethics","url":"https://www.academia.edu/Documents/in/Research_Ethics?f_ri=11040"},{"id":2509,"name":"Philosophy Of Mathematics","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Mathematics?f_ri=11040"},{"id":2559,"name":"Philosophy of Education","url":"https://www.academia.edu/Documents/in/Philosophy_of_Education?f_ri=11040"},{"id":2592,"name":"Human Rights","url":"https://www.academia.edu/Documents/in/Human_Rights?f_ri=11040"},{"id":2658,"name":"Distributed Algorithms","url":"https://www.academia.edu/Documents/in/Distributed_Algorithms?f_ri=11040"},{"id":3078,"name":"Ethics \u0026 Social Sustainability","url":"https://www.academia.edu/Documents/in/Ethics_and_Social_Sustainability?f_ri=11040"},{"id":3095,"name":"Computer-Based Learning","url":"https://www.academia.edu/Documents/in/Computer-Based_Learning?f_ri=11040"},{"id":3153,"name":"Algorithmic Composition","url":"https://www.academia.edu/Documents/in/Algorithmic_Composition?f_ri=11040"},{"id":3234,"name":"Animal Ethics","url":"https://www.academia.edu/Documents/in/Animal_Ethics?f_ri=11040"},{"id":3468,"name":"Virtue Ethics","url":"https://www.academia.edu/Documents/in/Virtue_Ethics?f_ri=11040"},{"id":3730,"name":"Philosophy of Psychology","url":"https://www.academia.edu/Documents/in/Philosophy_of_Psychology?f_ri=11040"},{"id":4065,"name":"Software Process Improvement and Assessment","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement_and_Assessment?f_ri=11040"},{"id":4213,"name":"Evolution of Morality","url":"https://www.academia.edu/Documents/in/Evolution_of_Morality?f_ri=11040"},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040"},{"id":4636,"name":"Information Ethics","url":"https://www.academia.edu/Documents/in/Information_Ethics?f_ri=11040"},{"id":4672,"name":"Open Source Software","url":"https://www.academia.edu/Documents/in/Open_Source_Software?f_ri=11040"},{"id":4759,"name":"Computer Ethics","url":"https://www.academia.edu/Documents/in/Computer_Ethics?f_ri=11040"},{"id":4761,"name":"Software Testing","url":"https://www.academia.edu/Documents/in/Software_Testing?f_ri=11040"},{"id":4955,"name":"Computational Modelling","url":"https://www.academia.edu/Documents/in/Computational_Modelling?f_ri=11040"},{"id":5006,"name":"Computer Games Technology","url":"https://www.academia.edu/Documents/in/Computer_Games_Technology?f_ri=11040"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=11040"},{"id":5242,"name":"Agile Software Process Improvement","url":"https://www.academia.edu/Documents/in/Agile_Software_Process_Improvement?f_ri=11040"},{"id":5274,"name":"Ethical Consumption","url":"https://www.academia.edu/Documents/in/Ethical_Consumption?f_ri=11040"},{"id":5401,"name":"Computer-Mediated Communication","url":"https://www.academia.edu/Documents/in/Computer-Mediated_Communication?f_ri=11040"},{"id":5457,"name":"Artificial Life","url":"https://www.academia.edu/Documents/in/Artificial_Life?f_ri=11040"},{"id":5960,"name":"Continental Philosophy","url":"https://www.academia.edu/Documents/in/Continental_Philosophy?f_ri=11040"},{"id":6551,"name":"Public Health Ethics","url":"https://www.academia.edu/Documents/in/Public_Health_Ethics?f_ri=11040"},{"id":6728,"name":"Philosophy Of Law","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Law?f_ri=11040"},{"id":7195,"name":"Media Ethics","url":"https://www.academia.edu/Documents/in/Media_Ethics?f_ri=11040"},{"id":7334,"name":"Software Studies","url":"https://www.academia.edu/Documents/in/Software_Studies?f_ri=11040"},{"id":7646,"name":"Professional Ethics","url":"https://www.academia.edu/Documents/in/Professional_Ethics?f_ri=11040"},{"id":7695,"name":"Environmental Ethics","url":"https://www.academia.edu/Documents/in/Environmental_Ethics?f_ri=11040"},{"id":7973,"name":"Approximation Algorithms","url":"https://www.academia.edu/Documents/in/Approximation_Algorithms?f_ri=11040"},{"id":8022,"name":"Mass-Media Ethics","url":"https://www.academia.edu/Documents/in/Mass-Media_Ethics?f_ri=11040"},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=11040"},{"id":9116,"name":"Software Evolution","url":"https://www.academia.edu/Documents/in/Software_Evolution?f_ri=11040"},{"id":9243,"name":"Communication Ethics","url":"https://www.academia.edu/Documents/in/Communication_Ethics?f_ri=11040"},{"id":9270,"name":"Software Architecture","url":"https://www.academia.edu/Documents/in/Software_Architecture?f_ri=11040"},{"id":9312,"name":"Software Reuse","url":"https://www.academia.edu/Documents/in/Software_Reuse?f_ri=11040"},{"id":9322,"name":"Software Product Lines","url":"https://www.academia.edu/Documents/in/Software_Product_Lines?f_ri=11040"},{"id":9435,"name":"Medical Ethics","url":"https://www.academia.edu/Documents/in/Medical_Ethics?f_ri=11040"},{"id":9457,"name":"Morality (Social Psychology)","url":"https://www.academia.edu/Documents/in/Morality_Social_Psychology_?f_ri=11040"},{"id":9795,"name":"Personal and Moral Autonomy","url":"https://www.academia.edu/Documents/in/Personal_and_Moral_Autonomy?f_ri=11040"},{"id":9967,"name":"Software Engineering education","url":"https://www.academia.edu/Documents/in/Software_Engineering_education?f_ri=11040"},{"id":10389,"name":"Philosophy of Mathematics Education","url":"https://www.academia.edu/Documents/in/Philosophy_of_Mathematics_Education?f_ri=11040"},{"id":10810,"name":"Ethical Theory","url":"https://www.academia.edu/Documents/in/Ethical_Theory?f_ri=11040"},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040"},{"id":11185,"name":"Journalism Ethics","url":"https://www.academia.edu/Documents/in/Journalism_Ethics?f_ri=11040"},{"id":11688,"name":"Ethics \u0026 Compliance Management","url":"https://www.academia.edu/Documents/in/Ethics_and_Compliance_Management?f_ri=11040"},{"id":11720,"name":"Social Ethics","url":"https://www.academia.edu/Documents/in/Social_Ethics?f_ri=11040"},{"id":12890,"name":"Moral Development","url":"https://www.academia.edu/Documents/in/Moral_Development?f_ri=11040"},{"id":13143,"name":"Clustering Algorithms","url":"https://www.academia.edu/Documents/in/Clustering_Algorithms?f_ri=11040"},{"id":13693,"name":"Sociology of Ethics and Morality","url":"https://www.academia.edu/Documents/in/Sociology_of_Ethics_and_Morality?f_ri=11040"},{"id":13923,"name":"Computer Security","url":"https://www.academia.edu/Documents/in/Computer_Security?f_ri=11040"},{"id":14122,"name":"Moral and Ethical Issues in Science","url":"https://www.academia.edu/Documents/in/Moral_and_Ethical_Issues_in_Science?f_ri=11040"},{"id":14192,"name":"Legal Ethics","url":"https://www.academia.edu/Documents/in/Legal_Ethics?f_ri=11040"},{"id":15117,"name":"Empirical Software Engineering","url":"https://www.academia.edu/Documents/in/Empirical_Software_Engineering?f_ri=11040"},{"id":15235,"name":"Health Care Ethics","url":"https://www.academia.edu/Documents/in/Health_Care_Ethics?f_ri=11040"},{"id":15341,"name":"Aesthetics and Ethics","url":"https://www.academia.edu/Documents/in/Aesthetics_and_Ethics?f_ri=11040"},{"id":18373,"name":"Moral Philosophy","url":"https://www.academia.edu/Documents/in/Moral_Philosophy?f_ri=11040"},{"id":19254,"name":"Moral Education","url":"https://www.academia.edu/Documents/in/Moral_Education?f_ri=11040"},{"id":20715,"name":"Legal Philosophy","url":"https://www.academia.edu/Documents/in/Legal_Philosophy?f_ri=11040"},{"id":21347,"name":"Social Software","url":"https://www.academia.edu/Documents/in/Social_Software?f_ri=11040"},{"id":22547,"name":"Social and Political Philosophy","url":"https://www.academia.edu/Documents/in/Social_and_Political_Philosophy?f_ri=11040"},{"id":24333,"name":"Global Ethics","url":"https://www.academia.edu/Documents/in/Global_Ethics?f_ri=11040"},{"id":24793,"name":"Metaphysics of Free Will and Moral Responsibility","url":"https://www.academia.edu/Documents/in/Metaphysics_of_Free_Will_and_Moral_Responsibility?f_ri=11040"},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=11040"},{"id":26825,"name":"Mobile Computing","url":"https://www.academia.edu/Documents/in/Mobile_Computing?f_ri=11040"},{"id":26860,"name":"Cloud Computing","url":"https://www.academia.edu/Documents/in/Cloud_Computing?f_ri=11040"},{"id":28306,"name":"Open Source and Free Software Studies","url":"https://www.academia.edu/Documents/in/Open_Source_and_Free_Software_Studies?f_ri=11040"},{"id":28383,"name":"Aristotle's Ethics","url":"https://www.academia.edu/Documents/in/Aristotles_Ethics?f_ri=11040"},{"id":28530,"name":"Software Quality Engineering","url":"https://www.academia.edu/Documents/in/Software_Quality_Engineering?f_ri=11040"},{"id":29777,"name":"Free Will and Moral Responsibility","url":"https://www.academia.edu/Documents/in/Free_Will_and_Moral_Responsibility?f_ri=11040"},{"id":29944,"name":"Optimization Algorithms","url":"https://www.academia.edu/Documents/in/Optimization_Algorithms?f_ri=11040"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=11040"},{"id":31408,"name":"Free Software","url":"https://www.academia.edu/Documents/in/Free_Software?f_ri=11040"},{"id":32703,"name":"Graph/Network Algorithms","url":"https://www.academia.edu/Documents/in/Graph_Network_Algorithms?f_ri=11040"},{"id":33093,"name":"Medical and Research ethics","url":"https://www.academia.edu/Documents/in/Medical_and_Research_ethics?f_ri=11040"},{"id":33705,"name":"Software Project Management","url":"https://www.academia.edu/Documents/in/Software_Project_Management?f_ri=11040"},{"id":33855,"name":"Moral and Political Philosophy","url":"https://www.academia.edu/Documents/in/Moral_and_Political_Philosophy?f_ri=11040"},{"id":35486,"name":"Agile Methods (Software Engineering)","url":"https://www.academia.edu/Documents/in/Agile_Methods_Software_Engineering_?f_ri=11040"},{"id":42558,"name":"Artifical Intelligence","url":"https://www.academia.edu/Documents/in/Artifical_Intelligence?f_ri=11040"},{"id":42814,"name":"Ethics and economics","url":"https://www.academia.edu/Documents/in/Ethics_and_economics?f_ri=11040"},{"id":42816,"name":"Kantian ethics","url":"https://www.academia.edu/Documents/in/Kantian_ethics?f_ri=11040"},{"id":43385,"name":"Anthropology of ethics and morality","url":"https://www.academia.edu/Documents/in/Anthropology_of_ethics_and_morality?f_ri=11040"},{"id":44389,"name":"Artificial Neural Networks for modeling purposes","url":"https://www.academia.edu/Documents/in/Artificial_Neural_Networks_for_modeling_purposes?f_ri=11040"},{"id":45088,"name":"Data Structures and Algorithms","url":"https://www.academia.edu/Documents/in/Data_Structures_and_Algorithms?f_ri=11040"},{"id":46185,"name":"Algorithmic Trading","url":"https://www.academia.edu/Documents/in/Algorithmic_Trading?f_ri=11040"},{"id":50895,"name":"Software Agents","url":"https://www.academia.edu/Documents/in/Software_Agents?f_ri=11040"},{"id":51264,"name":"Computer Programming","url":"https://www.academia.edu/Documents/in/Computer_Programming?f_ri=11040"},{"id":53293,"name":"Software","url":"https://www.academia.edu/Documents/in/Software?f_ri=11040"},{"id":54123,"name":"Artificial Neural Networks","url":"https://www.academia.edu/Documents/in/Artificial_Neural_Networks?f_ri=11040"},{"id":55826,"name":"Software Requirement Engineering","url":"https://www.academia.edu/Documents/in/Software_Requirement_Engineering?f_ri=11040"},{"id":59249,"name":"Computers","url":"https://www.academia.edu/Documents/in/Computers?f_ri=11040"},{"id":59532,"name":"Moral","url":"https://www.academia.edu/Documents/in/Moral?f_ri=11040"},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=11040"},{"id":66279,"name":"Software Business","url":"https://www.academia.edu/Documents/in/Software_Business?f_ri=11040"},{"id":74262,"name":"Philosophy of Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Philosophy_of_Artificial_Intelligence?f_ri=11040"},{"id":76336,"name":"Medical Ethics \u0026 Law","url":"https://www.academia.edu/Documents/in/Medical_Ethics_and_Law?f_ri=11040"},{"id":81182,"name":"Deep Learning","url":"https://www.academia.edu/Documents/in/Deep_Learning?f_ri=11040"},{"id":83952,"name":"Morality","url":"https://www.academia.edu/Documents/in/Morality?f_ri=11040"},{"id":86588,"name":"Metaheuristic Algorithms","url":"https://www.academia.edu/Documents/in/Metaheuristic_Algorithms?f_ri=11040"},{"id":100552,"name":"Medical Law and Ethics","url":"https://www.academia.edu/Documents/in/Medical_Law_and_Ethics?f_ri=11040"},{"id":141502,"name":"Inteligencia artificial","url":"https://www.academia.edu/Documents/in/Inteligencia_artificial-1?f_ri=11040"},{"id":147142,"name":"Business \u0026 Ethics","url":"https://www.academia.edu/Documents/in/Business_and_Ethics?f_ri=11040"},{"id":190001,"name":"Agile software development","url":"https://www.academia.edu/Documents/in/Agile_software_development?f_ri=11040"},{"id":251903,"name":"Artificial Intelligence And Techniques","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence_And_Techniques?f_ri=11040"},{"id":255160,"name":"(nano \u0026 Micro Electronics) \u0026(software Programing)","url":"https://www.academia.edu/Documents/in/_nano_and_Micro_Electronics_and_software_Programing_?f_ri=11040"},{"id":270736,"name":"Social Work Ethics","url":"https://www.academia.edu/Documents/in/Social_Work_Ethics?f_ri=11040"},{"id":423243,"name":"Bio and Nature Inspired Algorithms","url":"https://www.academia.edu/Documents/in/Bio_and_Nature_Inspired_Algorithms?f_ri=11040"},{"id":464601,"name":"Datastructures and Algorithms","url":"https://www.academia.edu/Documents/in/Datastructures_and_Algorithms?f_ri=11040"},{"id":605675,"name":"News ethics","url":"https://www.academia.edu/Documents/in/News_ethics?f_ri=11040"},{"id":620285,"name":"History of Philosophy","url":"https://www.academia.edu/Documents/in/History_of_Philosophy?f_ri=11040"},{"id":682316,"name":"ALGORITMA DAN FLOWCHART.pdf","url":"https://www.academia.edu/Documents/in/ALGORITMA_DAN_FLOWCHART.pdf?f_ri=11040"},{"id":734097,"name":"Logika Dan Algoritma","url":"https://www.academia.edu/Documents/in/Logika_Dan_Algoritma?f_ri=11040"},{"id":880402,"name":"Encryption Algorithms","url":"https://www.academia.edu/Documents/in/Encryption_Algorithms?f_ri=11040"},{"id":1198057,"name":"Computer","url":"https://www.academia.edu/Documents/in/Computer?f_ri=11040"},{"id":1223686,"name":"Artificial Intelligent and Soft Computing Methodologies","url":"https://www.academia.edu/Documents/in/Artificial_Intelligent_and_Soft_Computing_Methodologies?f_ri=11040"},{"id":1224548,"name":"Electrical and Computer Engineering (ECE)","url":"https://www.academia.edu/Documents/in/Electrical_and_Computer_Engineering_ECE_?f_ri=11040"},{"id":1226904,"name":"Computer Science and Engineering","url":"https://www.academia.edu/Documents/in/Computer_Science_and_Engineering-1?f_ri=11040"},{"id":1473054,"name":"Algorithm and flowchart","url":"https://www.academia.edu/Documents/in/Algorithm_and_flowchart?f_ri=11040"},{"id":1723635,"name":"Public Policy","url":"https://www.academia.edu/Documents/in/Public_Policy?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_338346" data-work_id="338346" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/338346/Mobile_Ad_Hoc_Networks_Issues_Research_Trends_and_Experiments">Mobile Ad Hoc Networks: Issues, Research Trends and Experiments</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dynamically form a network to exchange information. The special features of MANET bring this technology great opportunity together with severe... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_338346" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dynamically form a network to exchange information. The special features of MANET bring this technology great opportunity together with severe challenges. This paper describes the fundamental problems of ad hoc networking by giving its related background including the concept, features, applications, issues of MANETs, investigates and presents recent research trends and identifies Simulators for MANETs[5]. Based on recent research interests of scholars we found that some issues such as routing and power management attracted much attention and issues such as IP addressing and fault tolerance will have wide scope in the future. In the qualitative analysis [5], we found that some factors such as scalability, stability, and reliability attracted much. The essential simulation metrics for various MANET issues are identified and Simulators are listed for experiment. The analysis results demonstrate the utilization trends for various MANET simulators.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/338346" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0d9e8ecc0ab825b33391df7621b2b720" rel="nofollow" data-download="{"attachment_id":8566825,"asset_id":338346,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/8566825/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="253171" href="https://dravidian.academia.edu/LokanathaReddy">Lokanatha Reddy</a><script data-card-contents-for-user="253171" type="text/json">{"id":253171,"first_name":"Lokanatha","last_name":"Reddy","domain_name":"dravidian","page_name":"LokanathaReddy","display_name":"Lokanatha Reddy","profile_url":"https://dravidian.academia.edu/LokanathaReddy?f_ri=11040","photo":"https://0.academia-photos.com/253171/54160/49886/s65_lokanatha.reddy.jpg"}</script></span></span></li><li class="js-paper-rank-work_338346 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="338346"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 338346, container: ".js-paper-rank-work_338346", }); });</script></li><li class="js-percentile-work_338346 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 338346; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_338346"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_338346 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="338346"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 338346; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=338346]").text(description); $(".js-view-count-work_338346").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_338346").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="338346"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11701" rel="nofollow" href="https://www.academia.edu/Documents/in/AdHoc_Networks">AdHoc Networks</a>, <script data-card-contents-for-ri="11701" type="text/json">{"id":11701,"name":"AdHoc Networks","url":"https://www.academia.edu/Documents/in/AdHoc_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="22992" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_networks">Wireless networks</a>, <script data-card-contents-for-ri="22992" type="text/json">{"id":22992,"name":"Wireless networks","url":"https://www.academia.edu/Documents/in/Wireless_networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="63224" rel="nofollow" href="https://www.academia.edu/Documents/in/Mobile_Communications">Mobile Communications</a><script data-card-contents-for-ri="63224" type="text/json">{"id":63224,"name":"Mobile Communications","url":"https://www.academia.edu/Documents/in/Mobile_Communications?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=338346]'), work: {"id":338346,"title":"Mobile Ad Hoc Networks: Issues, Research Trends and Experiments","created_at":"2010-09-24T12:25:13.559-07:00","url":"https://www.academia.edu/338346/Mobile_Ad_Hoc_Networks_Issues_Research_Trends_and_Experiments?f_ri=11040","dom_id":"work_338346","summary":"A novel infrastructureless mobile networks (MANETs) is a collection of wireless nodes that can dynamically form a network to exchange information. The special features of MANET bring this technology great opportunity together with severe challenges. This paper describes the fundamental problems of ad hoc networking by giving its related background including the concept, features, applications, issues of MANETs, investigates and presents recent research trends and identifies Simulators for MANETs[5]. Based on recent research interests of scholars we found that some issues such as routing and power management attracted much attention and issues such as IP addressing and fault tolerance will have wide scope in the future. In the qualitative analysis [5], we found that some factors such as scalability, stability, and reliability attracted much. The essential simulation metrics for various MANET issues are identified and Simulators are listed for experiment. The analysis results demonstrate the utilization trends for various MANET simulators.","downloadable_attachments":[{"id":8566825,"asset_id":338346,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":253171,"first_name":"Lokanatha","last_name":"Reddy","domain_name":"dravidian","page_name":"LokanathaReddy","display_name":"Lokanatha Reddy","profile_url":"https://dravidian.academia.edu/LokanathaReddy?f_ri=11040","photo":"https://0.academia-photos.com/253171/54160/49886/s65_lokanatha.reddy.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":11701,"name":"AdHoc Networks","url":"https://www.academia.edu/Documents/in/AdHoc_Networks?f_ri=11040","nofollow":true},{"id":22992,"name":"Wireless networks","url":"https://www.academia.edu/Documents/in/Wireless_networks?f_ri=11040","nofollow":true},{"id":63224,"name":"Mobile Communications","url":"https://www.academia.edu/Documents/in/Mobile_Communications?f_ri=11040","nofollow":true},{"id":251894,"name":"Qualitative Analysis","url":"https://www.academia.edu/Documents/in/Qualitative_Analysis?f_ri=11040"},{"id":548331,"name":"Network Simulators","url":"https://www.academia.edu/Documents/in/Network_Simulators?f_ri=11040"},{"id":984895,"name":"Research Trend","url":"https://www.academia.edu/Documents/in/Research_Trend?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3760982" data-work_id="3760982" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3760982/Wireless_Sensor_Networks_Platforms_Tools_and_Simulators">Wireless Sensor Networks - Platforms, Tools and Simulators</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">This technical report provides a brief survey on various platforms, tools and simulators which are available for wireless sensor networks.</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3760982" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="38f8155b0346a8bd7d7b269d56fc35d0" rel="nofollow" data-download="{"attachment_id":31430439,"asset_id":3760982,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31430439/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1180344" href="https://praxis.academia.edu/JaydipSen">Jaydip Sen</a><script data-card-contents-for-user="1180344" type="text/json">{"id":1180344,"first_name":"Jaydip","last_name":"Sen","domain_name":"praxis","page_name":"JaydipSen","display_name":"Jaydip Sen","profile_url":"https://praxis.academia.edu/JaydipSen?f_ri=11040","photo":"https://0.academia-photos.com/1180344/1118482/2361285/s65_jaydip.sen.jpg"}</script></span></span></li><li class="js-paper-rank-work_3760982 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3760982"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3760982, container: ".js-paper-rank-work_3760982", }); });</script></li><li class="js-percentile-work_3760982 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3760982; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3760982"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3760982 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3760982"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3760982; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3760982]").text(description); $(".js-view-count-work_3760982").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3760982").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3760982"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="435" rel="nofollow" href="https://www.academia.edu/Documents/in/Operating_Systems">Operating Systems</a>, <script data-card-contents-for-ri="435" type="text/json">{"id":435,"name":"Operating Systems","url":"https://www.academia.edu/Documents/in/Operating_Systems?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="9136" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_Sensor_Networks">Wireless Sensor Networks</a>, <script data-card-contents-for-ri="9136" type="text/json">{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11701" rel="nofollow" href="https://www.academia.edu/Documents/in/AdHoc_Networks">AdHoc Networks</a><script data-card-contents-for-ri="11701" type="text/json">{"id":11701,"name":"AdHoc Networks","url":"https://www.academia.edu/Documents/in/AdHoc_Networks?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3760982]'), work: {"id":3760982,"title":"Wireless Sensor Networks - Platforms, Tools and Simulators","created_at":"2013-06-21T16:41:25.883-07:00","url":"https://www.academia.edu/3760982/Wireless_Sensor_Networks_Platforms_Tools_and_Simulators?f_ri=11040","dom_id":"work_3760982","summary":"This technical report provides a brief survey on various platforms, tools and simulators which are available for wireless sensor networks.","downloadable_attachments":[{"id":31430439,"asset_id":3760982,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":1180344,"first_name":"Jaydip","last_name":"Sen","domain_name":"praxis","page_name":"JaydipSen","display_name":"Jaydip Sen","profile_url":"https://praxis.academia.edu/JaydipSen?f_ri=11040","photo":"https://0.academia-photos.com/1180344/1118482/2361285/s65_jaydip.sen.jpg"}],"research_interests":[{"id":435,"name":"Operating Systems","url":"https://www.academia.edu/Documents/in/Operating_Systems?f_ri=11040","nofollow":true},{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":11701,"name":"AdHoc Networks","url":"https://www.academia.edu/Documents/in/AdHoc_Networks?f_ri=11040","nofollow":true},{"id":22992,"name":"Wireless networks","url":"https://www.academia.edu/Documents/in/Wireless_networks?f_ri=11040"},{"id":63224,"name":"Mobile Communications","url":"https://www.academia.edu/Documents/in/Mobile_Communications?f_ri=11040"},{"id":251894,"name":"Qualitative Analysis","url":"https://www.academia.edu/Documents/in/Qualitative_Analysis?f_ri=11040"},{"id":548331,"name":"Network Simulators","url":"https://www.academia.edu/Documents/in/Network_Simulators?f_ri=11040"},{"id":984895,"name":"Research Trend","url":"https://www.academia.edu/Documents/in/Research_Trend?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_70202221" data-work_id="70202221" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/70202221/Computational_Intelligence_for_Business_Analytics">Computational Intelligence for Business Analytics</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Business Analytics (BA) is reformulating corporate success. Transforming data in knowledge and using it harmoniously in Decision Making is not, anymore, a luxury of the most prestigious companies and organizations, but an obligation to... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_70202221" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Business Analytics (BA) is reformulating corporate success. Transforming data in knowledge and using it harmoniously in Decision Making is not, anymore, a luxury of the most prestigious companies and organizations, but an obligation to deliver competitive products and high-quality services. Approaches coming from different mathematical and computer sciences areas are deeply involved in this field. Nowadays, BA is probably the most important manifestation of the knowledge economy and knowledge society. A growing number of companies are identifying innovative ways to take advantage of the developed solutions based on BA. These applications—when enriched with computational intelligence—are capable of generating information that can be vital for making strategic decisions in a more informed and reliable way even under high uncertainty environments. Consequently, research on computational intelligence for BA exhibits a substantial impact on our world today. <br /><br />Eurekas is a Multinational Multidisciplinary Scientific Community joining professionals of Mathematics, Computer Sciences, Engineering, as well as Administration, Economics, and Social Sciences, towards theoretical and practical developments useful for Data and Business Analytics, in this way contributing to building the Knowledge Society and Knowledge Economy. It was founded in 2008 and it has been contributing by multiple projects to that purpose.<br /><br />Computational Intelligence for Business Analytics is a new Eurekas editorial initiative that aims to collect the latest technological innovations in the field of BA to improve business models related to Group Decision-Making, Forecasting, Risk Management, Knowledge Discovery, Data Breach Detection, Social Well-Being,<br />among other topics related to this field.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/70202221" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="271eb71e2cc488c49ff2d87d0236ca7a" rel="nofollow" data-download="{"attachment_id":80044055,"asset_id":70202221,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80044055/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="213427644" href="https://uacj.academia.edu/GilbertoRivera">Gilberto Rivera</a><script data-card-contents-for-user="213427644" type="text/json">{"id":213427644,"first_name":"Gilberto","last_name":"Rivera","domain_name":"uacj","page_name":"GilbertoRivera","display_name":"Gilberto Rivera","profile_url":"https://uacj.academia.edu/GilbertoRivera?f_ri=11040","photo":"https://0.academia-photos.com/213427644/72316472/60778921/s65_gilberto.rivera.jpg"}</script></span></span></li><li class="js-paper-rank-work_70202221 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="70202221"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 70202221, container: ".js-paper-rank-work_70202221", }); });</script></li><li class="js-percentile-work_70202221 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 70202221; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_70202221"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_70202221 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="70202221"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 70202221; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=70202221]").text(description); $(".js-view-count-work_70202221").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_70202221").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="70202221"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">18</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="465" rel="nofollow" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="1241" rel="nofollow" href="https://www.academia.edu/Documents/in/Knowledge_Management">Knowledge Management</a>, <script data-card-contents-for-ri="1241" type="text/json">{"id":1241,"name":"Knowledge Management","url":"https://www.academia.edu/Documents/in/Knowledge_Management?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="2009" rel="nofollow" href="https://www.academia.edu/Documents/in/Data_Mining">Data Mining</a>, <script data-card-contents-for-ri="2009" type="text/json">{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="3521" rel="nofollow" href="https://www.academia.edu/Documents/in/Computational_Intelligence">Computational Intelligence</a><script data-card-contents-for-ri="3521" type="text/json">{"id":3521,"name":"Computational Intelligence","url":"https://www.academia.edu/Documents/in/Computational_Intelligence?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=70202221]'), work: {"id":70202221,"title":"Computational Intelligence for Business Analytics","created_at":"2022-02-01T01:01:08.633-08:00","url":"https://www.academia.edu/70202221/Computational_Intelligence_for_Business_Analytics?f_ri=11040","dom_id":"work_70202221","summary":"Business Analytics (BA) is reformulating corporate success. Transforming data in knowledge and using it harmoniously in Decision Making is not, anymore, a luxury of the most prestigious companies and organizations, but an obligation to deliver competitive products and high-quality services. Approaches coming from different mathematical and computer sciences areas are deeply involved in this field. Nowadays, BA is probably the most important manifestation of the knowledge economy and knowledge society. A growing number of companies are identifying innovative ways to take advantage of the developed solutions based on BA. These applications—when enriched with computational intelligence—are capable of generating information that can be vital for making strategic decisions in a more informed and reliable way even under high uncertainty environments. Consequently, research on computational intelligence for BA exhibits a substantial impact on our world today. \n\nEurekas is a Multinational Multidisciplinary Scientific Community joining professionals of Mathematics, Computer Sciences, Engineering, as well as Administration, Economics, and Social Sciences, towards theoretical and practical developments useful for Data and Business Analytics, in this way contributing to building the Knowledge Society and Knowledge Economy. It was founded in 2008 and it has been contributing by multiple projects to that purpose.\n\nComputational Intelligence for Business Analytics is a new Eurekas editorial initiative that aims to collect the latest technological innovations in the field of BA to improve business models related to Group Decision-Making, Forecasting, Risk Management, Knowledge Discovery, Data Breach Detection, Social Well-Being,\namong other topics related to this field.","downloadable_attachments":[{"id":80044055,"asset_id":70202221,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":213427644,"first_name":"Gilberto","last_name":"Rivera","domain_name":"uacj","page_name":"GilbertoRivera","display_name":"Gilberto Rivera","profile_url":"https://uacj.academia.edu/GilbertoRivera?f_ri=11040","photo":"https://0.academia-photos.com/213427644/72316472/60778921/s65_gilberto.rivera.jpg"}],"research_interests":[{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=11040","nofollow":true},{"id":1241,"name":"Knowledge Management","url":"https://www.academia.edu/Documents/in/Knowledge_Management?f_ri=11040","nofollow":true},{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=11040","nofollow":true},{"id":3521,"name":"Computational Intelligence","url":"https://www.academia.edu/Documents/in/Computational_Intelligence?f_ri=11040","nofollow":true},{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_?f_ri=11040"},{"id":4165,"name":"Fuzzy Logic","url":"https://www.academia.edu/Documents/in/Fuzzy_Logic?f_ri=11040"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=11040"},{"id":5395,"name":"Swarm Intelligence","url":"https://www.academia.edu/Documents/in/Swarm_Intelligence?f_ri=11040"},{"id":6132,"name":"Soft Computing","url":"https://www.academia.edu/Documents/in/Soft_Computing?f_ri=11040"},{"id":7357,"name":"Business Intelligence","url":"https://www.academia.edu/Documents/in/Business_Intelligence?f_ri=11040"},{"id":10075,"name":"Decision Support Systems","url":"https://www.academia.edu/Documents/in/Decision_Support_Systems?f_ri=11040"},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=11040"},{"id":51359,"name":"Business Analytics","url":"https://www.academia.edu/Documents/in/Business_Analytics?f_ri=11040"},{"id":68800,"name":"Descriptive Analysis","url":"https://www.academia.edu/Documents/in/Descriptive_Analysis?f_ri=11040"},{"id":201440,"name":"Data Breaches","url":"https://www.academia.edu/Documents/in/Data_Breaches?f_ri=11040"},{"id":256115,"name":"Predictive Analysis","url":"https://www.academia.edu/Documents/in/Predictive_Analysis?f_ri=11040"},{"id":1162240,"name":"Prescriptive Analytics","url":"https://www.academia.edu/Documents/in/Prescriptive_Analytics?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_48667315" data-work_id="48667315" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/48667315/A_flexible_and_high_performance_data_center_network_topology">A flexible and high-performance data center network topology</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In order to meet the insatiable demands for cloud-based services, today’s data centers may have hundreds of thousands of servers. During the past decade, many topologies have been proposed to interconnect a large number of servers in a... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_48667315" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In order to meet the insatiable demands for cloud-based services, today’s data centers may have hundreds of thousands of servers. During the past decade, many topologies have been proposed to interconnect a large number of servers in a data center network. However, existing topologies face several challenges including the rigid structure, high network cost, and packet relay overheads on servers. In this paper, we propose a novel switch-centric network topology, called DCCube, which offers many desirable properties for data center networking. DCCube is a flexible structure because, given the switches degree and the network diameter, it is possible to construct different structures with different number of connected servers, bisection bandwidth and network cost. Furthermore, DCCube can accommodate a large number of servers with high bisection bandwidth, low cost, small diameter and desirable path diversity. By comparing with existing data center network topologies, we show that DCCube achieves both high performance and low network cost. We also design both minimal and non-minimal routing algorithms for the proposed topology. Simulation results reveal that non-minimal routing is preferred for unbalanced traffic patterns. Keywords: Data center network, Network topology, Flexibility, High performance, Routing</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/48667315" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="50ba76afb52755402d2816c2a1ec877c" rel="nofollow" data-download="{"attachment_id":67552856,"asset_id":48667315,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/67552856/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4047193" href="https://uok.academia.edu/SadoonAzizi">Sadoon Azizi</a><script data-card-contents-for-user="4047193" type="text/json">{"id":4047193,"first_name":"Sadoon","last_name":"Azizi","domain_name":"uok","page_name":"SadoonAzizi","display_name":"Sadoon Azizi","profile_url":"https://uok.academia.edu/SadoonAzizi?f_ri=11040","photo":"https://0.academia-photos.com/4047193/3275749/3854737/s65_sadoon.azizi.jpg"}</script></span></span></li><li class="js-paper-rank-work_48667315 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="48667315"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 48667315, container: ".js-paper-rank-work_48667315", }); });</script></li><li class="js-percentile-work_48667315 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 48667315; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_48667315"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_48667315 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="48667315"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 48667315; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=48667315]").text(description); $(".js-view-count-work_48667315").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_48667315").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="48667315"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="440" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="4252" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Networks">Computer Networks</a>, <script data-card-contents-for-ri="4252" type="text/json">{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="14338" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Network_architecture">Computer Network architecture</a><script data-card-contents-for-ri="14338" type="text/json">{"id":14338,"name":"Computer Network architecture","url":"https://www.academia.edu/Documents/in/Computer_Network_architecture?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=48667315]'), work: {"id":48667315,"title":"A flexible and high-performance data center network topology","created_at":"2021-05-05T03:05:53.275-07:00","url":"https://www.academia.edu/48667315/A_flexible_and_high_performance_data_center_network_topology?f_ri=11040","dom_id":"work_48667315","summary":"In order to meet the insatiable demands for cloud-based services, today’s data centers may have hundreds of thousands of servers. During the past decade, many topologies have been proposed to interconnect a large number of servers in a data center network. However, existing topologies face several challenges including the rigid structure, high network cost, and packet relay overheads on servers. In this paper, we propose a novel switch-centric network topology, called DCCube, which offers many desirable properties for data center networking. DCCube is a flexible structure because, given the switches degree and the network diameter, it is possible to construct different structures with different number of connected servers, bisection bandwidth and network cost. Furthermore, DCCube can accommodate a large number of servers with high bisection bandwidth, low cost, small diameter and desirable path diversity. By comparing with existing data center network topologies, we show that DCCube achieves both high performance and low network cost. We also design both minimal and non-minimal routing algorithms for the proposed topology. Simulation results reveal that non-minimal routing is preferred for unbalanced traffic patterns. Keywords: Data center network, Network topology, Flexibility, High performance, Routing","downloadable_attachments":[{"id":67552856,"asset_id":48667315,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4047193,"first_name":"Sadoon","last_name":"Azizi","domain_name":"uok","page_name":"SadoonAzizi","display_name":"Sadoon Azizi","profile_url":"https://uok.academia.edu/SadoonAzizi?f_ri=11040","photo":"https://0.academia-photos.com/4047193/3275749/3854737/s65_sadoon.azizi.jpg"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":14338,"name":"Computer Network architecture","url":"https://www.academia.edu/Documents/in/Computer_Network_architecture?f_ri=11040","nofollow":true},{"id":26860,"name":"Cloud Computing","url":"https://www.academia.edu/Documents/in/Cloud_Computing?f_ri=11040"},{"id":340637,"name":"Interconnection Networks","url":"https://www.academia.edu/Documents/in/Interconnection_Networks?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":647969,"name":"Data Center Network","url":"https://www.academia.edu/Documents/in/Data_Center_Network?f_ri=11040"},{"id":696276,"name":"Data Centers","url":"https://www.academia.edu/Documents/in/Data_Centers?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_36983878" data-work_id="36983878" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" rel="nofollow" href="https://www.academia.edu/36983878/TOP_10_ROUTING_PAPERS_RECOMMENDED_READING_NETWORK_RESEARCH">TOP 10 ROUTING PAPERS: RECOMMENDED READING – NETWORK RESEARCH</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_36983878" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing problem in multi-services MANETs, as well as the implementation of an adaptation of the dynamic source routing (DSR) protocol.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/36983878" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1faa6a395f2823b49e34d885f319e624" rel="nofollow" data-download="{"attachment_id":56933168,"asset_id":36983878,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/56933168/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3321842" rel="nofollow" href="https://independent.academia.edu/Networkscommunication">International Journal of Computer Networks & Communications (IJCNC)</a><script data-card-contents-for-user="3321842" type="text/json">{"id":3321842,"first_name":"International Journal of Computer Networks \u0026 Communications","last_name":"(IJCNC)","domain_name":"independent","page_name":"Networkscommunication","display_name":"International Journal of Computer Networks \u0026 Communications (IJCNC)","profile_url":"https://independent.academia.edu/Networkscommunication?f_ri=11040","photo":"https://0.academia-photos.com/3321842/1110465/153487195/s65_international_journal_of_computer_networks_communications._ijcnc_.png"}</script></span></span></li><li class="js-paper-rank-work_36983878 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="36983878"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 36983878, container: ".js-paper-rank-work_36983878", }); });</script></li><li class="js-percentile-work_36983878 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 36983878; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_36983878"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_36983878 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="36983878"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 36983878; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=36983878]").text(description); $(".js-view-count-work_36983878").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_36983878").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="36983878"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">42</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="14335" rel="nofollow" href="https://www.academia.edu/Documents/in/MANET_Routing_protocols">MANET Routing protocols</a>, <script data-card-contents-for-ri="14335" type="text/json">{"id":14335,"name":"MANET Routing protocols","url":"https://www.academia.edu/Documents/in/MANET_Routing_protocols?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="17634" rel="nofollow" href="https://www.academia.edu/Documents/in/Internet_Routing_Protocol">Internet Routing Protocol</a><script data-card-contents-for-ri="17634" type="text/json">{"id":17634,"name":"Internet Routing Protocol","url":"https://www.academia.edu/Documents/in/Internet_Routing_Protocol?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=36983878]'), work: {"id":36983878,"title":"TOP 10 ROUTING PAPERS: RECOMMENDED READING – NETWORK RESEARCH","created_at":"2018-07-05T04:33:58.808-07:00","url":"https://www.academia.edu/36983878/TOP_10_ROUTING_PAPERS_RECOMMENDED_READING_NETWORK_RESEARCH?f_ri=11040","dom_id":"work_36983878","summary":"In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing problem in multi-services MANETs, as well as the implementation of an adaptation of the dynamic source routing (DSR) protocol.","downloadable_attachments":[{"id":56933168,"asset_id":36983878,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3321842,"first_name":"International Journal of Computer Networks \u0026 Communications","last_name":"(IJCNC)","domain_name":"independent","page_name":"Networkscommunication","display_name":"International Journal of Computer Networks \u0026 Communications (IJCNC)","profile_url":"https://independent.academia.edu/Networkscommunication?f_ri=11040","photo":"https://0.academia-photos.com/3321842/1110465/153487195/s65_international_journal_of_computer_networks_communications._ijcnc_.png"}],"research_interests":[{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":14335,"name":"MANET Routing protocols","url":"https://www.academia.edu/Documents/in/MANET_Routing_protocols?f_ri=11040","nofollow":true},{"id":17634,"name":"Internet Routing Protocol","url":"https://www.academia.edu/Documents/in/Internet_Routing_Protocol?f_ri=11040","nofollow":true},{"id":17977,"name":"Security in routing protocols","url":"https://www.academia.edu/Documents/in/Security_in_routing_protocols?f_ri=11040"},{"id":23383,"name":"Routing protocols","url":"https://www.academia.edu/Documents/in/Routing_protocols?f_ri=11040"},{"id":40901,"name":"Network Protocols and Architectures","url":"https://www.academia.edu/Documents/in/Network_Protocols_and_Architectures?f_ri=11040"},{"id":43123,"name":"Multimedia Traffic Management","url":"https://www.academia.edu/Documents/in/Multimedia_Traffic_Management?f_ri=11040"},{"id":60471,"name":"Vehicle Routing Problems","url":"https://www.academia.edu/Documents/in/Vehicle_Routing_Problems?f_ri=11040"},{"id":67545,"name":"Network Protocols","url":"https://www.academia.edu/Documents/in/Network_Protocols?f_ri=11040"},{"id":77389,"name":"Security in Manets","url":"https://www.academia.edu/Documents/in/Security_in_Manets?f_ri=11040"},{"id":82137,"name":"Manet","url":"https://www.academia.edu/Documents/in/Manet?f_ri=11040"},{"id":89771,"name":"MANETs","url":"https://www.academia.edu/Documents/in/MANETs?f_ri=11040"},{"id":98242,"name":"NETWORKING PROTOCOLS SYSTEM","url":"https://www.academia.edu/Documents/in/NETWORKING_PROTOCOLS_SYSTEM?f_ri=11040"},{"id":109210,"name":"Energy Efficient Protocols in Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Energy_Efficient_Protocols_in_Wireless_Sensor_Networks?f_ri=11040"},{"id":111318,"name":"Dedicated Short Range Communications (DSRC)","url":"https://www.academia.edu/Documents/in/Dedicated_Short_Range_Communications_DSRC_?f_ri=11040"},{"id":126800,"name":"4G, New generations networks, QoS, protocolos IPv6 and extensions, Application in new generation networks, routing protocolos, congestion control, Wireless, MANET, sensor networks","url":"https://www.academia.edu/Documents/in/4G_New_generations_networks_QoS_protocolos_IPv6_and_extensions_Application_in_new_generation_net?f_ri=11040"},{"id":128576,"name":"Mobile Ad-hoc Networks (MANETs)","url":"https://www.academia.edu/Documents/in/Mobile_Ad-hoc_Networks_MANETs_?f_ri=11040"},{"id":129105,"name":"DSR","url":"https://www.academia.edu/Documents/in/DSR?f_ri=11040"},{"id":148428,"name":"Routing Algorithms","url":"https://www.academia.edu/Documents/in/Routing_Algorithms?f_ri=11040"},{"id":149893,"name":"Routing Protocols in WSN","url":"https://www.academia.edu/Documents/in/Routing_Protocols_in_WSN?f_ri=11040"},{"id":159739,"name":"MANET and VANET Routing","url":"https://www.academia.edu/Documents/in/MANET_and_VANET_Routing?f_ri=11040"},{"id":178590,"name":"AODV","url":"https://www.academia.edu/Documents/in/AODV?f_ri=11040"},{"id":180934,"name":"Routing in VANET and MANET","url":"https://www.academia.edu/Documents/in/Routing_in_VANET_and_MANET?f_ri=11040"},{"id":186524,"name":"Manet in OPNET","url":"https://www.academia.edu/Documents/in/Manet_in_OPNET?f_ri=11040"},{"id":201435,"name":"Dynamic vehicle routing","url":"https://www.academia.edu/Documents/in/Dynamic_vehicle_routing?f_ri=11040"},{"id":224118,"name":"QoS Routing in MANETs","url":"https://www.academia.edu/Documents/in/QoS_Routing_in_MANETs?f_ri=11040"},{"id":280542,"name":"Routing Protocol in VANET","url":"https://www.academia.edu/Documents/in/Routing_Protocol_in_VANET?f_ri=11040"},{"id":288703,"name":"Routing Protocol","url":"https://www.academia.edu/Documents/in/Routing_Protocol?f_ri=11040"},{"id":496573,"name":"Mobility Models","url":"https://www.academia.edu/Documents/in/Mobility_Models?f_ri=11040"},{"id":551025,"name":"Dynamic Routing Protocol","url":"https://www.academia.edu/Documents/in/Dynamic_Routing_Protocol?f_ri=11040"},{"id":695358,"name":"Simulation of Ad Hoc routing protocol by opnet","url":"https://www.academia.edu/Documents/in/Simulation_of_Ad_Hoc_routing_protocol_by_opnet?f_ri=11040"},{"id":732177,"name":"QoS Routing","url":"https://www.academia.edu/Documents/in/QoS_Routing?f_ri=11040"},{"id":874370,"name":"STATIC \u0026 DYNAMIC ROUTING","url":"https://www.academia.edu/Documents/in/STATIC_and_DYNAMIC_ROUTING?f_ri=11040"},{"id":901415,"name":"Mobility Models in Adhoc network","url":"https://www.academia.edu/Documents/in/Mobility_Models_in_Adhoc_network?f_ri=11040"},{"id":979997,"name":"Routing Vehicle Problem","url":"https://www.academia.edu/Documents/in/Routing_Vehicle_Problem?f_ri=11040"},{"id":1007403,"name":"Network Protocols and Systems","url":"https://www.academia.edu/Documents/in/Network_Protocols_and_Systems?f_ri=11040"},{"id":1094691,"name":"The Impact of Node Speed on Dsr Routing Protocol","url":"https://www.academia.edu/Documents/in/The_Impact_of_Node_Speed_on_Dsr_Routing_Protocol?f_ri=11040"},{"id":1147951,"name":"Dynamic Source Routing","url":"https://www.academia.edu/Documents/in/Dynamic_Source_Routing?f_ri=11040"},{"id":1165767,"name":"Routing Sheet","url":"https://www.academia.edu/Documents/in/Routing_Sheet?f_ri=11040"},{"id":1252229,"name":"Routing Metrics","url":"https://www.academia.edu/Documents/in/Routing_Metrics?f_ri=11040"},{"id":1366529,"name":"Vehicle Routing In Supply Chain Management","url":"https://www.academia.edu/Documents/in/Vehicle_Routing_In_Supply_Chain_Management?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10095387" data-work_id="10095387" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10095387/Mobile_ad_hoc_network_MANET_routing_protocols_comparison_for_wireless_sensor_network">Mobile ad hoc network (MANET) routing protocols comparison for wireless sensor network</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10095387" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a303619535ffc01a39441203bbee7836" rel="nofollow" data-download="{"attachment_id":36216954,"asset_id":10095387,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/36216954/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="24597679" href="https://usu-id.academia.edu/RoihanRoihan">Roihan Roihan</a><script data-card-contents-for-user="24597679" type="text/json">{"id":24597679,"first_name":"Roihan","last_name":"Roihan","domain_name":"usu-id","page_name":"RoihanRoihan","display_name":"Roihan Roihan","profile_url":"https://usu-id.academia.edu/RoihanRoihan?f_ri=11040","photo":"https://0.academia-photos.com/24597679/6700274/7569237/s65_roihan.roihan.jpg_oh_9a3206336099eb7391ee22904c7c123f_oe_5539fa6c___gda___1428828448_ac221351bd3690258008c7deeba8d3f8"}</script></span></span></li><li class="js-paper-rank-work_10095387 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10095387"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10095387, container: ".js-paper-rank-work_10095387", }); });</script></li><li class="js-percentile-work_10095387 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10095387; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10095387"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10095387 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10095387"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10095387; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10095387]").text(description); $(".js-view-count-work_10095387").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10095387").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10095387"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">22</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2339" rel="nofollow" href="https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks">Mobile Ad Hoc Networks</a>, <script data-card-contents-for-ri="2339" type="text/json">{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="9136" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_Sensor_Networks">Wireless Sensor Networks</a>, <script data-card-contents-for-ri="9136" type="text/json">{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a><script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10095387]'), work: {"id":10095387,"title":"Mobile ad hoc network (MANET) routing protocols comparison for wireless sensor network","created_at":"2015-01-09T22:24:04.615-08:00","url":"https://www.academia.edu/10095387/Mobile_ad_hoc_network_MANET_routing_protocols_comparison_for_wireless_sensor_network?f_ri=11040","dom_id":"work_10095387","summary":null,"downloadable_attachments":[{"id":36216954,"asset_id":10095387,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":24597679,"first_name":"Roihan","last_name":"Roihan","domain_name":"usu-id","page_name":"RoihanRoihan","display_name":"Roihan Roihan","profile_url":"https://usu-id.academia.edu/RoihanRoihan?f_ri=11040","photo":"https://0.academia-photos.com/24597679/6700274/7569237/s65_roihan.roihan.jpg_oh_9a3206336099eb7391ee22904c7c123f_oe_5539fa6c___gda___1428828448_ac221351bd3690258008c7deeba8d3f8"}],"research_interests":[{"id":2339,"name":"Mobile Ad Hoc Networks","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Networks?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":23383,"name":"Routing protocols","url":"https://www.academia.edu/Documents/in/Routing_protocols?f_ri=11040"},{"id":26825,"name":"Mobile Computing","url":"https://www.academia.edu/Documents/in/Mobile_Computing?f_ri=11040"},{"id":51212,"name":"Performance Analysis","url":"https://www.academia.edu/Documents/in/Performance_Analysis?f_ri=11040"},{"id":58607,"name":"Mobile Ad Hoc Network","url":"https://www.academia.edu/Documents/in/Mobile_Ad_Hoc_Network?f_ri=11040"},{"id":82137,"name":"Manet","url":"https://www.academia.edu/Documents/in/Manet?f_ri=11040"},{"id":90890,"name":"QoS","url":"https://www.academia.edu/Documents/in/QoS?f_ri=11040"},{"id":91375,"name":"Quality of Service","url":"https://www.academia.edu/Documents/in/Quality_of_Service?f_ri=11040"},{"id":178590,"name":"AODV","url":"https://www.academia.edu/Documents/in/AODV?f_ri=11040"},{"id":181649,"name":"Ad hoc On-Demand Distance Vector","url":"https://www.academia.edu/Documents/in/Ad_hoc_On-Demand_Distance_Vector?f_ri=11040"},{"id":250447,"name":"Energy Storage","url":"https://www.academia.edu/Documents/in/Energy_Storage?f_ri=11040"},{"id":288703,"name":"Routing Protocol","url":"https://www.academia.edu/Documents/in/Routing_Protocol?f_ri=11040"},{"id":524475,"name":"MESH NETWORK","url":"https://www.academia.edu/Documents/in/MESH_NETWORK?f_ri=11040"},{"id":581652,"name":"Data Processing","url":"https://www.academia.edu/Documents/in/Data_Processing?f_ri=11040"},{"id":1211847,"name":"Wireless Sensor Network","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Network?f_ri=11040"},{"id":1276229,"name":"Wireless Ad Hoc Network","url":"https://www.academia.edu/Documents/in/Wireless_Ad_Hoc_Network?f_ri=11040"},{"id":1555652,"name":"Base station","url":"https://www.academia.edu/Documents/in/Base_station?f_ri=11040"},{"id":1605361,"name":"Sensor nodes","url":"https://www.academia.edu/Documents/in/Sensor_nodes?f_ri=11040"},{"id":1708394,"name":"Data Transmission","url":"https://www.academia.edu/Documents/in/Data_Transmission?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9231652" data-work_id="9231652" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9231652/Communication_aware_VFI_partitioning_for_GALS_based_networks_on_chip">Communication-aware VFI partitioning for GALS-based networks-on-chip</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The voltage/frequency island (VFI) design paradigm is a practical architecture for energy-efficient networks-on-chip (NoC) systems. In VFI-based NoC systems, each island can be operated with different voltage and clock frequency and thus... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9231652" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The voltage/frequency island (VFI) design paradigm is a practical architecture for energy-efficient networks-on-chip (NoC) systems. In VFI-based NoC systems, each island can be operated with different voltage and clock frequency and thus it is important to carefully partition processing elements (PEs) into islands based on their workloads and communications. In this paper, we propose an energy-efficient design scheme that optimizes energy consumption and hardware costs in VFI-based NoC systems. Since on-chip networks take up a substantial portion of system power budget in NoC-based systems, the proposed scheme uses communication-aware VFI partitioning and tile mapping/routing algorithms to minimize the inter-VFI communications. Experimental results show that the proposed design technique can reduce communication energy consumption by 32–51% over existing techniques and total energy consumption by 3–14%.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9231652" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d3984fce59fec011f2801759dd23c193" rel="nofollow" data-download="{"attachment_id":47845938,"asset_id":9231652,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47845938/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21171015" href="https://independent.academia.edu/WooJoongKim">WooJoong Kim</a><script data-card-contents-for-user="21171015" type="text/json">{"id":21171015,"first_name":"WooJoong","last_name":"Kim","domain_name":"independent","page_name":"WooJoongKim","display_name":"WooJoong Kim","profile_url":"https://independent.academia.edu/WooJoongKim?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_9231652 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9231652"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9231652, container: ".js-paper-rank-work_9231652", }); });</script></li><li class="js-percentile-work_9231652 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9231652; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9231652"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9231652 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9231652"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9231652; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9231652]").text(description); $(".js-view-count-work_9231652").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9231652").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9231652"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11397" rel="nofollow" href="https://www.academia.edu/Documents/in/Energy_Consumption">Energy Consumption</a>, <script data-card-contents-for-ri="11397" type="text/json">{"id":11397,"name":"Energy Consumption","url":"https://www.academia.edu/Documents/in/Energy_Consumption?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="15759" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Hardware">Computer Hardware</a>, <script data-card-contents-for-ri="15759" type="text/json">{"id":15759,"name":"Computer Hardware","url":"https://www.academia.edu/Documents/in/Computer_Hardware?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="44912" rel="nofollow" href="https://www.academia.edu/Documents/in/Low_Power_Design">Low Power Design</a><script data-card-contents-for-ri="44912" type="text/json">{"id":44912,"name":"Low Power Design","url":"https://www.academia.edu/Documents/in/Low_Power_Design?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9231652]'), work: {"id":9231652,"title":"Communication-aware VFI partitioning for GALS-based networks-on-chip","created_at":"2014-11-10T13:00:40.859-08:00","url":"https://www.academia.edu/9231652/Communication_aware_VFI_partitioning_for_GALS_based_networks_on_chip?f_ri=11040","dom_id":"work_9231652","summary":"The voltage/frequency island (VFI) design paradigm is a practical architecture for energy-efficient networks-on-chip (NoC) systems. In VFI-based NoC systems, each island can be operated with different voltage and clock frequency and thus it is important to carefully partition processing elements (PEs) into islands based on their workloads and communications. In this paper, we propose an energy-efficient design scheme that optimizes energy consumption and hardware costs in VFI-based NoC systems. Since on-chip networks take up a substantial portion of system power budget in NoC-based systems, the proposed scheme uses communication-aware VFI partitioning and tile mapping/routing algorithms to minimize the inter-VFI communications. Experimental results show that the proposed design technique can reduce communication energy consumption by 32–51% over existing techniques and total energy consumption by 3–14%.","downloadable_attachments":[{"id":47845938,"asset_id":9231652,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21171015,"first_name":"WooJoong","last_name":"Kim","domain_name":"independent","page_name":"WooJoongKim","display_name":"WooJoong Kim","profile_url":"https://independent.academia.edu/WooJoongKim?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":11397,"name":"Energy Consumption","url":"https://www.academia.edu/Documents/in/Energy_Consumption?f_ri=11040","nofollow":true},{"id":15759,"name":"Computer Hardware","url":"https://www.academia.edu/Documents/in/Computer_Hardware?f_ri=11040","nofollow":true},{"id":44912,"name":"Low Power Design","url":"https://www.academia.edu/Documents/in/Low_Power_Design?f_ri=11040","nofollow":true},{"id":322954,"name":"Chip","url":"https://www.academia.edu/Documents/in/Chip?f_ri=11040"},{"id":456909,"name":"Network on chip","url":"https://www.academia.edu/Documents/in/Network_on_chip?f_ri=11040"},{"id":459384,"name":"Energy efficient","url":"https://www.academia.edu/Documents/in/Energy_efficient?f_ri=11040"},{"id":566851,"name":"Energy Efficient Design","url":"https://www.academia.edu/Documents/in/Energy_Efficient_Design?f_ri=11040"},{"id":2150506,"name":"Processing Element","url":"https://www.academia.edu/Documents/in/Processing_Element?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7588891" data-work_id="7588891" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7588891/Agro_sense_Precision_agriculture_using_sensor_based_wireless_mesh_networks">Agro-sense: Precision agriculture using sensor-based wireless mesh networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Advances in wireless personal area networks have made the practical deployment of various services possible, which until a few years ago was considered extremely costly or labor intensive. We build such a wireless sensor network for... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_7588891" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Advances in wireless personal area networks have made the practical deployment of various services possible, which until a few years ago was considered extremely costly or labor intensive. We build such a wireless sensor network for precision agriculture where real time data of the climatological and other environmental properties are sensed and relayed to a central repository. The architecture comprises of three distinct sections -(a) the sensor-nodes (b) the wireless mesh network and (c) the actuation components. The sensors are selected based on the properties suited for the most common crops and we identify four such attributes. The sensor network is based on the IEEE-802.15.4 standard and we develop a new static routing algorithm suited for the sensing application. The algorithm overrides the deficiency of the Hierarchical Routing scheme inherent in the ZigBee specification where the C skip addressing algorithm limits the possible depth of the network topology due to address wastage. The new algorithm maintains the hierarchical network topology and thus ensures routing at its optimal best. The algorithms for both addressing and routing are provided. The actuation components are also a part of mesh network and are activated wirelessly for controlling irrigation and fertigation.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7588891" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f973f7baef4737f2a2b6501c8152c95c" rel="nofollow" data-download="{"attachment_id":48410292,"asset_id":7588891,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48410292/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="13677797" href="https://heritageit.academia.edu/SiuliRoy">Siuli Roy</a><script data-card-contents-for-user="13677797" type="text/json">{"id":13677797,"first_name":"Siuli","last_name":"Roy","domain_name":"heritageit","page_name":"SiuliRoy","display_name":"Siuli Roy","profile_url":"https://heritageit.academia.edu/SiuliRoy?f_ri=11040","photo":"https://0.academia-photos.com/13677797/5571797/6343741/s65_siuli.roy.jpg_oh_186717a0cee9a42bb07591b92f568a6f_oe_54f8298f___gda___1425282150_9eb97755dda13e2d0d2fef199c408a21"}</script></span></span></li><li class="js-paper-rank-work_7588891 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7588891"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7588891, container: ".js-paper-rank-work_7588891", }); });</script></li><li class="js-percentile-work_7588891 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7588891; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7588891"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7588891 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7588891"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7588891; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7588891]").text(description); $(".js-view-count-work_7588891").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7588891").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7588891"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">15</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="4731" rel="nofollow" href="https://www.academia.edu/Documents/in/Precision_Agriculture">Precision Agriculture</a>, <script data-card-contents-for-ri="4731" type="text/json">{"id":4731,"name":"Precision Agriculture","url":"https://www.academia.edu/Documents/in/Precision_Agriculture?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="7789" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing">Routing</a>, <script data-card-contents-for-ri="7789" type="text/json">{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="9136" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_Sensor_Networks">Wireless Sensor Networks</a>, <script data-card-contents-for-ri="9136" type="text/json">{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="10225" rel="nofollow" href="https://www.academia.edu/Documents/in/Agriculture">Agriculture</a><script data-card-contents-for-ri="10225" type="text/json">{"id":10225,"name":"Agriculture","url":"https://www.academia.edu/Documents/in/Agriculture?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7588891]'), work: {"id":7588891,"title":"Agro-sense: Precision agriculture using sensor-based wireless mesh networks","created_at":"2014-07-07T16:19:03.217-07:00","url":"https://www.academia.edu/7588891/Agro_sense_Precision_agriculture_using_sensor_based_wireless_mesh_networks?f_ri=11040","dom_id":"work_7588891","summary":"Advances in wireless personal area networks have made the practical deployment of various services possible, which until a few years ago was considered extremely costly or labor intensive. We build such a wireless sensor network for precision agriculture where real time data of the climatological and other environmental properties are sensed and relayed to a central repository. The architecture comprises of three distinct sections -(a) the sensor-nodes (b) the wireless mesh network and (c) the actuation components. The sensors are selected based on the properties suited for the most common crops and we identify four such attributes. The sensor network is based on the IEEE-802.15.4 standard and we develop a new static routing algorithm suited for the sensing application. The algorithm overrides the deficiency of the Hierarchical Routing scheme inherent in the ZigBee specification where the C skip addressing algorithm limits the possible depth of the network topology due to address wastage. The new algorithm maintains the hierarchical network topology and thus ensures routing at its optimal best. The algorithms for both addressing and routing are provided. The actuation components are also a part of mesh network and are activated wirelessly for controlling irrigation and fertigation.","downloadable_attachments":[{"id":48410292,"asset_id":7588891,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":13677797,"first_name":"Siuli","last_name":"Roy","domain_name":"heritageit","page_name":"SiuliRoy","display_name":"Siuli Roy","profile_url":"https://heritageit.academia.edu/SiuliRoy?f_ri=11040","photo":"https://0.academia-photos.com/13677797/5571797/6343741/s65_siuli.roy.jpg_oh_186717a0cee9a42bb07591b92f568a6f_oe_54f8298f___gda___1425282150_9eb97755dda13e2d0d2fef199c408a21"}],"research_interests":[{"id":4731,"name":"Precision Agriculture","url":"https://www.academia.edu/Documents/in/Precision_Agriculture?f_ri=11040","nofollow":true},{"id":7789,"name":"Routing","url":"https://www.academia.edu/Documents/in/Routing?f_ri=11040","nofollow":true},{"id":9136,"name":"Wireless Sensor Networks","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Networks?f_ri=11040","nofollow":true},{"id":10225,"name":"Agriculture","url":"https://www.academia.edu/Documents/in/Agriculture?f_ri=11040","nofollow":true},{"id":10297,"name":"Wireless Mesh Networks","url":"https://www.academia.edu/Documents/in/Wireless_Mesh_Networks?f_ri=11040"},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040"},{"id":142536,"name":"Crops","url":"https://www.academia.edu/Documents/in/Crops?f_ri=11040"},{"id":158569,"name":"Sensor Network","url":"https://www.academia.edu/Documents/in/Sensor_Network?f_ri=11040"},{"id":309737,"name":"Wireless Mesh Network","url":"https://www.academia.edu/Documents/in/Wireless_Mesh_Network?f_ri=11040"},{"id":435720,"name":"Real-Time Data Processing","url":"https://www.academia.edu/Documents/in/Real-Time_Data_Processing?f_ri=11040"},{"id":524475,"name":"MESH NETWORK","url":"https://www.academia.edu/Documents/in/MESH_NETWORK?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":1211847,"name":"Wireless Sensor Network","url":"https://www.academia.edu/Documents/in/Wireless_Sensor_Network?f_ri=11040"},{"id":1605361,"name":"Sensor nodes","url":"https://www.academia.edu/Documents/in/Sensor_nodes?f_ri=11040"},{"id":1662955,"name":"Hierarchical Routing","url":"https://www.academia.edu/Documents/in/Hierarchical_Routing?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_2204941" data-work_id="2204941" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/2204941/Network_on_chip_routing_algorithms">Network on chip routing algorithms</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Network on Chip (NoC) is a new paradigm to make the interconnections inside a System on Chip (SoC) system. In traditional solutions interconnections are realized using a bus structure. While integration increases the bus structure does... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_2204941" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Network on Chip (NoC) is a new paradigm to make the interconnections inside a System on Chip (SoC) system. In traditional solutions interconnections are realized using a bus structure. While integration increases the bus structure does not meet the needs of the new technology. Bus starts to be narrow and in the worst case it begins to block traffic. In NoC technology the bus structure is replaced with a network which is a lot similar to the Internet. Segments communicate with each other by sending packetized data over this network.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/2204941" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="52ae51bc6a65edef6785bc13ca03d068" rel="nofollow" data-download="{"attachment_id":30255338,"asset_id":2204941,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/30255338/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="308894" href="https://utu.academia.edu/JuhaPlosila">Juha Plosila</a><script data-card-contents-for-user="308894" type="text/json">{"id":308894,"first_name":"Juha","last_name":"Plosila","domain_name":"utu","page_name":"JuhaPlosila","display_name":"Juha Plosila","profile_url":"https://utu.academia.edu/JuhaPlosila?f_ri=11040","photo":"https://0.academia-photos.com/308894/96603/26232171/s65_juha.plosila.jpg"}</script></span></span></li><li class="js-paper-rank-work_2204941 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="2204941"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 2204941, container: ".js-paper-rank-work_2204941", }); });</script></li><li class="js-percentile-work_2204941 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 2204941; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_2204941"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_2204941 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="2204941"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 2204941; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=2204941]").text(description); $(".js-view-count-work_2204941").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_2204941").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="2204941"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="59546" rel="nofollow" href="https://www.academia.edu/Documents/in/New_Technology">New Technology</a>, <script data-card-contents-for-ri="59546" type="text/json">{"id":59546,"name":"New Technology","url":"https://www.academia.edu/Documents/in/New_Technology?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="62540" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Network">Computer Network</a>, <script data-card-contents-for-ri="62540" type="text/json">{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="99572" rel="nofollow" href="https://www.academia.edu/Documents/in/System_on_Chip">System on Chip</a><script data-card-contents-for-ri="99572" type="text/json">{"id":99572,"name":"System on Chip","url":"https://www.academia.edu/Documents/in/System_on_Chip?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=2204941]'), work: {"id":2204941,"title":"Network on chip routing algorithms","created_at":"2012-11-27T06:21:13.383-08:00","url":"https://www.academia.edu/2204941/Network_on_chip_routing_algorithms?f_ri=11040","dom_id":"work_2204941","summary":"Network on Chip (NoC) is a new paradigm to make the interconnections inside a System on Chip (SoC) system. In traditional solutions interconnections are realized using a bus structure. While integration increases the bus structure does not meet the needs of the new technology. Bus starts to be narrow and in the worst case it begins to block traffic. In NoC technology the bus structure is replaced with a network which is a lot similar to the Internet. Segments communicate with each other by sending packetized data over this network.","downloadable_attachments":[{"id":30255338,"asset_id":2204941,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":308894,"first_name":"Juha","last_name":"Plosila","domain_name":"utu","page_name":"JuhaPlosila","display_name":"Juha Plosila","profile_url":"https://utu.academia.edu/JuhaPlosila?f_ri=11040","photo":"https://0.academia-photos.com/308894/96603/26232171/s65_juha.plosila.jpg"}],"research_interests":[{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":59546,"name":"New Technology","url":"https://www.academia.edu/Documents/in/New_Technology?f_ri=11040","nofollow":true},{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040","nofollow":true},{"id":99572,"name":"System on Chip","url":"https://www.academia.edu/Documents/in/System_on_Chip?f_ri=11040","nofollow":true},{"id":456909,"name":"Network on chip","url":"https://www.academia.edu/Documents/in/Network_on_chip?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_12690613" data-work_id="12690613" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/12690613/Routing_in_computer_networks_using_artificial_neural_networks">Routing in computer networks using artificial neural networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper proposes a heuristic approach based on Hopfield model of neural networks to solve the problem of routing which constitutes one of the key aspects of the topological design of computer networks. Adaptive to changes in link costs... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_12690613" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper proposes a heuristic approach based on Hopfield model of neural networks to solve the problem of routing which constitutes one of the key aspects of the topological design of computer networks. Adaptive to changes in link costs and network topology, the proposed approach relies on the utilization of an energy function which simulates the objective function used in network optimization while respecting the constraints imposed by the network designers. This function must converge toward a solution which, if not the best is at least as close as possible to the optimum. The simulation results reveal that the end-to-end delay computed according to this neural network approach is usually better than those determined by the conventional routing heuristics, in the sense that our routing algorithm realizes a better trade-off between end-to-end delay and running time, and consequently gives a better performance than many other well-known optimal algorithms. ᭧</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/12690613" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="049cec60c617405aa9198420924471d7" rel="nofollow" data-download="{"attachment_id":46005235,"asset_id":12690613,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46005235/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="31703006" href="https://independent.academia.edu/SamuelPierre1">Samuel Pierre</a><script data-card-contents-for-user="31703006" type="text/json">{"id":31703006,"first_name":"Samuel","last_name":"Pierre","domain_name":"independent","page_name":"SamuelPierre1","display_name":"Samuel Pierre","profile_url":"https://independent.academia.edu/SamuelPierre1?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_12690613 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="12690613"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 12690613, container: ".js-paper-rank-work_12690613", }); });</script></li><li class="js-percentile-work_12690613 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 12690613; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_12690613"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_12690613 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="12690613"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 12690613; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=12690613]").text(description); $(".js-view-count-work_12690613").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_12690613").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="12690613"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" rel="nofollow" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="4252" rel="nofollow" href="https://www.academia.edu/Documents/in/Computer_Networks">Computer Networks</a>, <script data-card-contents-for-ri="4252" type="text/json">{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="26066" rel="nofollow" href="https://www.academia.edu/Documents/in/Neural_Network">Neural Network</a><script data-card-contents-for-ri="26066" type="text/json">{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=12690613]'), work: {"id":12690613,"title":"Routing in computer networks using artificial neural networks","created_at":"2015-05-30T12:56:50.534-07:00","url":"https://www.academia.edu/12690613/Routing_in_computer_networks_using_artificial_neural_networks?f_ri=11040","dom_id":"work_12690613","summary":"This paper proposes a heuristic approach based on Hopfield model of neural networks to solve the problem of routing which constitutes one of the key aspects of the topological design of computer networks. Adaptive to changes in link costs and network topology, the proposed approach relies on the utilization of an energy function which simulates the objective function used in network optimization while respecting the constraints imposed by the network designers. This function must converge toward a solution which, if not the best is at least as close as possible to the optimum. The simulation results reveal that the end-to-end delay computed according to this neural network approach is usually better than those determined by the conventional routing heuristics, in the sense that our routing algorithm realizes a better trade-off between end-to-end delay and running time, and consequently gives a better performance than many other well-known optimal algorithms. ᭧","downloadable_attachments":[{"id":46005235,"asset_id":12690613,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":31703006,"first_name":"Samuel","last_name":"Pierre","domain_name":"independent","page_name":"SamuelPierre1","display_name":"Samuel Pierre","profile_url":"https://independent.academia.edu/SamuelPierre1?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=11040","nofollow":true},{"id":4252,"name":"Computer Networks","url":"https://www.academia.edu/Documents/in/Computer_Networks?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=11040","nofollow":true},{"id":29073,"name":"Network optimization","url":"https://www.academia.edu/Documents/in/Network_optimization?f_ri=11040"},{"id":62540,"name":"Computer Network","url":"https://www.academia.edu/Documents/in/Computer_Network?f_ri=11040"},{"id":89305,"name":"Network Design","url":"https://www.academia.edu/Documents/in/Network_Design?f_ri=11040"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=11040"},{"id":1211304,"name":"Artificial Neural Network","url":"https://www.academia.edu/Documents/in/Artificial_Neural_Network?f_ri=11040"},{"id":2216064,"name":"Energy function","url":"https://www.academia.edu/Documents/in/Energy_function?f_ri=11040"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9199498" data-work_id="9199498" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9199498/Distributed_Energy_Efficient_Cooperative_Routing_in_Wireless_Networks">Distributed Energy-Efficient Cooperative Routing in Wireless Networks</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power-efficient routing algorithms. Most of the existing cooperation-based... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9199498" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power-efficient routing algorithms. Most of the existing cooperation-based routing algorithms are implemented by finding a shortest-path route first. As such, these routing algorithms do not fully exploit the merits of cooperative communications at the physical layer. In this paper, we propose a cooperation-based routing algorithm, namely, minimum power cooperative routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route as a cascade of the minimum-power single-relay building blocks from the source to the destination. Hence, any distributed shortest-path algorithm can be utilized to find the optimal route with polynomial complexity, while guaranteeing certain throughput. We show that the MPCR algorithm can achieve power saving of 57.36% compared to the conventional shortest-path routing algorithms. Furthermore, the MPCR algorithm can achieve power saving of 37.64% compared to the existing cooperative routing algorithms, in which the selected routes are constructed based on the noncooperative routes.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9199498" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c824f102d187f28b9636015ca534f03e" rel="nofollow" data-download="{"attachment_id":47854045,"asset_id":9199498,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47854045/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21066522" href="https://independent.academia.edu/ahmedibrahim103">ahmed ibrahim</a><script data-card-contents-for-user="21066522" type="text/json">{"id":21066522,"first_name":"ahmed","last_name":"ibrahim","domain_name":"independent","page_name":"ahmedibrahim103","display_name":"ahmed ibrahim","profile_url":"https://independent.academia.edu/ahmedibrahim103?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_9199498 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9199498"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9199498, container: ".js-paper-rank-work_9199498", }); });</script></li><li class="js-percentile-work_9199498 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9199498; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9199498"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9199498 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9199498"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9199498; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9199498]").text(description); $(".js-view-count-work_9199498").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9199498").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9199498"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="440" rel="nofollow" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="65429" rel="nofollow" href="https://www.academia.edu/Documents/in/Wireless_Network">Wireless Network</a>, <script data-card-contents-for-ri="65429" type="text/json">{"id":65429,"name":"Wireless Network","url":"https://www.academia.edu/Documents/in/Wireless_Network?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="164633" rel="nofollow" href="https://www.academia.edu/Documents/in/Cooperative_Communication">Cooperative Communication</a><script data-card-contents-for-ri="164633" type="text/json">{"id":164633,"name":"Cooperative Communication","url":"https://www.academia.edu/Documents/in/Cooperative_Communication?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9199498]'), work: {"id":9199498,"title":"Distributed Energy-Efficient Cooperative Routing in Wireless Networks","created_at":"2014-11-08T23:10:11.372-08:00","url":"https://www.academia.edu/9199498/Distributed_Energy_Efficient_Cooperative_Routing_in_Wireless_Networks?f_ri=11040","dom_id":"work_9199498","summary":"Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power-efficient routing algorithms. Most of the existing cooperation-based routing algorithms are implemented by finding a shortest-path route first. As such, these routing algorithms do not fully exploit the merits of cooperative communications at the physical layer. In this paper, we propose a cooperation-based routing algorithm, namely, minimum power cooperative routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route as a cascade of the minimum-power single-relay building blocks from the source to the destination. Hence, any distributed shortest-path algorithm can be utilized to find the optimal route with polynomial complexity, while guaranteeing certain throughput. We show that the MPCR algorithm can achieve power saving of 57.36% compared to the conventional shortest-path routing algorithms. Furthermore, the MPCR algorithm can achieve power saving of 37.64% compared to the existing cooperative routing algorithms, in which the selected routes are constructed based on the noncooperative routes.","downloadable_attachments":[{"id":47854045,"asset_id":9199498,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21066522,"first_name":"ahmed","last_name":"ibrahim","domain_name":"independent","page_name":"ahmedibrahim103","display_name":"ahmed ibrahim","profile_url":"https://independent.academia.edu/ahmedibrahim103?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":65429,"name":"Wireless Network","url":"https://www.academia.edu/Documents/in/Wireless_Network?f_ri=11040","nofollow":true},{"id":164633,"name":"Cooperative Communication","url":"https://www.academia.edu/Documents/in/Cooperative_Communication?f_ri=11040","nofollow":true},{"id":164701,"name":"Physical Layer","url":"https://www.academia.edu/Documents/in/Physical_Layer?f_ri=11040"},{"id":236814,"name":"Ad hoc network","url":"https://www.academia.edu/Documents/in/Ad_hoc_network?f_ri=11040"},{"id":459384,"name":"Energy efficient","url":"https://www.academia.edu/Documents/in/Energy_efficient?f_ri=11040"},{"id":726991,"name":"Power Saving","url":"https://www.academia.edu/Documents/in/Power_Saving?f_ri=11040"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=11040"},{"id":1457308,"name":"Cooperative Diversity","url":"https://www.academia.edu/Documents/in/Cooperative_Diversity?f_ri=11040"},{"id":1991649,"name":"Shortest Path algorithm","url":"https://www.academia.edu/Documents/in/Shortest_Path_algorithm?f_ri=11040"},{"id":2122148,"name":"Shortest Path Routing","url":"https://www.academia.edu/Documents/in/Shortest_Path_Routing?f_ri=11040"},{"id":2327284,"name":"Power Added Efficiency","url":"https://www.academia.edu/Documents/in/Power_Added_Efficiency?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_803670" data-work_id="803670" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/803670/Design_of_a_map_based_transit_itinerary_planner">Design of a map-based transit itinerary planner</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The Federal Transit Administration (FTA) New Starts process involves multiple criteria to assess funding eligibility for local public transit investments. In this article a multicriteria method-Analytic Hierarchy Process (AHP)-is used to... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_803670" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The Federal Transit Administration (FTA) New Starts process involves multiple criteria to assess funding eligibility for local public transit investments. In this article a multicriteria method-Analytic Hierarchy Process (AHP)-is used to assess light rail transit (LRT) corridor and route alternatives. Although the focus is on the current LRT corridor and route selection process in Memphis, Tennessee, the AHP-aided procedure is intended to facilitate the public transportation decision-making process generically, reflective of federal New Starts guidelines as well as local priorities and preferences. Each alternative corridor and route is assessed functionally with respect to site-specific ratings of the criteria and subcriteria in a unified framework. This framework contains the goal, participant groups, criteria, subcriteria, and alternatives as various elements of a public transportation decision process with relative influence on the outcome. The best corridor and route alignment alternative is identified by a composite score on the AHP ratio scale. Finally, with sensitivity analysis, it is</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/803670" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bfcb25f1dad24d031ae6de34ca926eb4" rel="nofollow" data-download="{"attachment_id":4810086,"asset_id":803670,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/4810086/download_file?st=MTc0MDU5Mjk2OCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="141601" href="https://utk.academia.edu/ChristopherCherry">Christopher Cherry</a><script data-card-contents-for-user="141601" type="text/json">{"id":141601,"first_name":"Christopher","last_name":"Cherry","domain_name":"utk","page_name":"ChristopherCherry","display_name":"Christopher Cherry","profile_url":"https://utk.academia.edu/ChristopherCherry?f_ri=11040","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_803670 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="803670"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 803670, container: ".js-paper-rank-work_803670", }); });</script></li><li class="js-percentile-work_803670 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 803670; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_803670"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_803670 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="803670"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 803670; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=803670]").text(description); $(".js-view-count-work_803670").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_803670").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="803670"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="3254" rel="nofollow" href="https://www.academia.edu/Documents/in/Public_Transport">Public Transport</a>, <script data-card-contents-for-ri="3254" type="text/json">{"id":3254,"name":"Public Transport","url":"https://www.academia.edu/Documents/in/Public_Transport?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="11040" rel="nofollow" href="https://www.academia.edu/Documents/in/Routing_algorithm">Routing algorithm</a>, <script data-card-contents-for-ri="11040" type="text/json">{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="19816" rel="nofollow" href="https://www.academia.edu/Documents/in/Intelligent_Transport_System">Intelligent Transport System</a>, <script data-card-contents-for-ri="19816" type="text/json">{"id":19816,"name":"Intelligent Transport System","url":"https://www.academia.edu/Documents/in/Intelligent_Transport_System?f_ri=11040","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="20436" rel="nofollow" href="https://www.academia.edu/Documents/in/Urban_And_Regional_Planning">Urban And Regional Planning</a><script data-card-contents-for-ri="20436" type="text/json">{"id":20436,"name":"Urban And Regional Planning","url":"https://www.academia.edu/Documents/in/Urban_And_Regional_Planning?f_ri=11040","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=803670]'), work: {"id":803670,"title":"Design of a map-based transit itinerary planner","created_at":"2011-08-04T13:27:22.233-07:00","url":"https://www.academia.edu/803670/Design_of_a_map_based_transit_itinerary_planner?f_ri=11040","dom_id":"work_803670","summary":"The Federal Transit Administration (FTA) New Starts process involves multiple criteria to assess funding eligibility for local public transit investments. In this article a multicriteria method-Analytic Hierarchy Process (AHP)-is used to assess light rail transit (LRT) corridor and route alternatives. Although the focus is on the current LRT corridor and route selection process in Memphis, Tennessee, the AHP-aided procedure is intended to facilitate the public transportation decision-making process generically, reflective of federal New Starts guidelines as well as local priorities and preferences. Each alternative corridor and route is assessed functionally with respect to site-specific ratings of the criteria and subcriteria in a unified framework. This framework contains the goal, participant groups, criteria, subcriteria, and alternatives as various elements of a public transportation decision process with relative influence on the outcome. The best corridor and route alignment alternative is identified by a composite score on the AHP ratio scale. Finally, with sensitivity analysis, it is","downloadable_attachments":[{"id":4810086,"asset_id":803670,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":141601,"first_name":"Christopher","last_name":"Cherry","domain_name":"utk","page_name":"ChristopherCherry","display_name":"Christopher Cherry","profile_url":"https://utk.academia.edu/ChristopherCherry?f_ri=11040","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":3254,"name":"Public Transport","url":"https://www.academia.edu/Documents/in/Public_Transport?f_ri=11040","nofollow":true},{"id":11040,"name":"Routing algorithm","url":"https://www.academia.edu/Documents/in/Routing_algorithm?f_ri=11040","nofollow":true},{"id":19816,"name":"Intelligent Transport System","url":"https://www.academia.edu/Documents/in/Intelligent_Transport_System?f_ri=11040","nofollow":true},{"id":20436,"name":"Urban And Regional Planning","url":"https://www.academia.edu/Documents/in/Urban_And_Regional_Planning?f_ri=11040","nofollow":true},{"id":182375,"name":"Public transportation","url":"https://www.academia.edu/Documents/in/Public_transportation?f_ri=11040"},{"id":469749,"name":"Human Computer Interface","url":"https://www.academia.edu/Documents/in/Human_Computer_Interface?f_ri=11040"},{"id":560815,"name":"Geographic Information","url":"https://www.academia.edu/Documents/in/Geographic_Information?f_ri=11040"},{"id":1211138,"name":"Geographic Information System","url":"https://www.academia.edu/Documents/in/Geographic_Information_System?f_ri=11040"}]}, }) } })();</script></ul></li></ul></div></div></div><div class="u-taCenter Pagination"><ul class="pagination"><li class="next_page"><a href="/Documents/in/Routing_algorithm?after=50%2C803670" rel="next">Next</a></li><li class="last next"><a href="/Documents/in/Routing_algorithm?page=last">Last »</a></li></ul></div></div><div class="hidden-xs hidden-sm"><div class="u-pl6x"><div style="width: 300px;"><div class="panel panel-flat u-mt7x"><div class="panel-heading u-p5x"><div class="u-tcGrayDark u-taCenter u-fw700 u-textUppercase">Related Topics</div></div><ul class="list-group"><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Quantum_Cryptography">Quantum Cryptography</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="16585">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="16585">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Data_Privacy">Data Privacy</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="97108">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="97108">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Machine_Learning_Big_Data">Machine Learning Big Data</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="559503">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="559503">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Homomorphic_Encryption">Homomorphic Encryption</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="642373">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="642373">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/R_programming_language">R programming language</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="27324">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="27324">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Qualitative_Analysis">Qualitative Analysis</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="251894">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="251894">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Identity_management">Identity management</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="88247">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="88247">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/AdHoc_Networks">AdHoc Networks</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="11701">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="11701">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Anonymity">Anonymity</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="17743">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="17743">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" rel="nofollow" href="https://www.academia.edu/Documents/in/Network_Simulators">Network Simulators</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="548331">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="548331">Following</a></div></li></ul></div></div></div></div></div></div><script>// MIT License // Copyright © 2011 Sebastian Tschan, https://blueimp.net // Permission is hereby granted, free of charge, to any person obtaining a copy of // this software and associated documentation files (the "Software"), to deal in // the Software without restriction, including without limitation the rights to // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of // the Software, and to permit persons to whom the Software is furnished to do so, // subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. !function(n){"use strict";function d(n,t){var r=(65535&n)+(65535&t);return(n>>16)+(t>>16)+(r>>16)<<16|65535&r}function f(n,t,r,e,o,u){return d((c=d(d(t,n),d(e,u)))<<(f=o)|c>>>32-f,r);var c,f}function l(n,t,r,e,o,u,c){return f(t&r|~t&e,n,t,o,u,c)}function v(n,t,r,e,o,u,c){return f(t&e|r&~e,n,t,o,u,c)}function g(n,t,r,e,o,u,c){return f(t^r^e,n,t,o,u,c)}function m(n,t,r,e,o,u,c){return f(r^(t|~e),n,t,o,u,c)}function i(n,t){var r,e,o,u;n[t>>5]|=128<<t%32,n[14+(t+64>>>9<<4)]=t;for(var c=1732584193,f=-271733879,i=-1732584194,a=271733878,h=0;h<n.length;h+=16)c=l(r=c,e=f,o=i,u=a,n[h],7,-680876936),a=l(a,c,f,i,n[h+1],12,-389564586),i=l(i,a,c,f,n[h+2],17,606105819),f=l(f,i,a,c,n[h+3],22,-1044525330),c=l(c,f,i,a,n[h+4],7,-176418897),a=l(a,c,f,i,n[h+5],12,1200080426),i=l(i,a,c,f,n[h+6],17,-1473231341),f=l(f,i,a,c,n[h+7],22,-45705983),c=l(c,f,i,a,n[h+8],7,1770035416),a=l(a,c,f,i,n[h+9],12,-1958414417),i=l(i,a,c,f,n[h+10],17,-42063),f=l(f,i,a,c,n[h+11],22,-1990404162),c=l(c,f,i,a,n[h+12],7,1804603682),a=l(a,c,f,i,n[h+13],12,-40341101),i=l(i,a,c,f,n[h+14],17,-1502002290),c=v(c,f=l(f,i,a,c,n[h+15],22,1236535329),i,a,n[h+1],5,-165796510),a=v(a,c,f,i,n[h+6],9,-1069501632),i=v(i,a,c,f,n[h+11],14,643717713),f=v(f,i,a,c,n[h],20,-373897302),c=v(c,f,i,a,n[h+5],5,-701558691),a=v(a,c,f,i,n[h+10],9,38016083),i=v(i,a,c,f,n[h+15],14,-660478335),f=v(f,i,a,c,n[h+4],20,-405537848),c=v(c,f,i,a,n[h+9],5,568446438),a=v(a,c,f,i,n[h+14],9,-1019803690),i=v(i,a,c,f,n[h+3],14,-187363961),f=v(f,i,a,c,n[h+8],20,1163531501),c=v(c,f,i,a,n[h+13],5,-1444681467),a=v(a,c,f,i,n[h+2],9,-51403784),i=v(i,a,c,f,n[h+7],14,1735328473),c=g(c,f=v(f,i,a,c,n[h+12],20,-1926607734),i,a,n[h+5],4,-378558),a=g(a,c,f,i,n[h+8],11,-2022574463),i=g(i,a,c,f,n[h+11],16,1839030562),f=g(f,i,a,c,n[h+14],23,-35309556),c=g(c,f,i,a,n[h+1],4,-1530992060),a=g(a,c,f,i,n[h+4],11,1272893353),i=g(i,a,c,f,n[h+7],16,-155497632),f=g(f,i,a,c,n[h+10],23,-1094730640),c=g(c,f,i,a,n[h+13],4,681279174),a=g(a,c,f,i,n[h],11,-358537222),i=g(i,a,c,f,n[h+3],16,-722521979),f=g(f,i,a,c,n[h+6],23,76029189),c=g(c,f,i,a,n[h+9],4,-640364487),a=g(a,c,f,i,n[h+12],11,-421815835),i=g(i,a,c,f,n[h+15],16,530742520),c=m(c,f=g(f,i,a,c,n[h+2],23,-995338651),i,a,n[h],6,-198630844),a=m(a,c,f,i,n[h+7],10,1126891415),i=m(i,a,c,f,n[h+14],15,-1416354905),f=m(f,i,a,c,n[h+5],21,-57434055),c=m(c,f,i,a,n[h+12],6,1700485571),a=m(a,c,f,i,n[h+3],10,-1894986606),i=m(i,a,c,f,n[h+10],15,-1051523),f=m(f,i,a,c,n[h+1],21,-2054922799),c=m(c,f,i,a,n[h+8],6,1873313359),a=m(a,c,f,i,n[h+15],10,-30611744),i=m(i,a,c,f,n[h+6],15,-1560198380),f=m(f,i,a,c,n[h+13],21,1309151649),c=m(c,f,i,a,n[h+4],6,-145523070),a=m(a,c,f,i,n[h+11],10,-1120210379),i=m(i,a,c,f,n[h+2],15,718787259),f=m(f,i,a,c,n[h+9],21,-343485551),c=d(c,r),f=d(f,e),i=d(i,o),a=d(a,u);return[c,f,i,a]}function a(n){for(var t="",r=32*n.length,e=0;e<r;e+=8)t+=String.fromCharCode(n[e>>5]>>>e%32&255);return t}function h(n){var t=[];for(t[(n.length>>2)-1]=void 0,e=0;e<t.length;e+=1)t[e]=0;for(var r=8*n.length,e=0;e<r;e+=8)t[e>>5]|=(255&n.charCodeAt(e/8))<<e%32;return t}function e(n){for(var t,r="0123456789abcdef",e="",o=0;o<n.length;o+=1)t=n.charCodeAt(o),e+=r.charAt(t>>>4&15)+r.charAt(15&t);return e}function r(n){return unescape(encodeURIComponent(n))}function o(n){return a(i(h(t=r(n)),8*t.length));var t}function u(n,t){return function(n,t){var r,e,o=h(n),u=[],c=[];for(u[15]=c[15]=void 0,16<o.length&&(o=i(o,8*n.length)),r=0;r<16;r+=1)u[r]=909522486^o[r],c[r]=1549556828^o[r];return e=i(u.concat(h(t)),512+8*t.length),a(i(c.concat(e),640))}(r(n),r(t))}function t(n,t,r){return t?r?u(t,n):e(u(t,n)):r?o(n):e(o(n))}"function"==typeof define&&define.amd?define(function(){return t}):"object"==typeof module&&module.exports?module.exports=t:n.md5=t}(this);</script><script>window.AbTest = (function() { return { 'ab_test': (uniqueId, test_name, buckets) => { let override = new URLSearchParams(window.location.search).get(`ab_test[${test_name}]`); if ( override ) { return override; } const bucketNames = buckets.map((bucket) => { return typeof bucket === 'string' ? bucket : Object.keys(bucket)[0]; }); const weights = buckets.map((bucket) => { return typeof bucket === 'string' ? 1 : Object.values(bucket)[0]; }); const total = weights.reduce((sum, weight) => sum + weight); const hash = md5(`${uniqueId}${test_name}`); const hashNum = parseInt(hash.slice(-12), 16); let bucketPoint = total * (hashNum % 100000) / 100000; const bucket = bucketNames.find((_, i) => { if (weights[i] > bucketPoint) { return true; } bucketPoint -= weights[i]; return false; }); return bucket; } }; })();</script><div data-auto_select="false" data-client_id="331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b" data-landing_url="https://www.academia.edu/Documents/in/Routing_algorithm" data-login_uri="https://www.academia.edu/registrations/google_one_tap" data-moment_callback="onGoogleOneTapEvent" id="g_id_onload"></div><script>function onGoogleOneTapEvent(event) { var momentType = event.getMomentType(); var momentReason = null; if (event.isNotDisplayed()) { momentReason = event.getNotDisplayedReason(); } else if (event.isSkippedMoment()) { momentReason = event.getSkippedReason(); } else if (event.isDismissedMoment()) { momentReason = event.getDismissedReason(); } Aedu.arbitraryEvents.write('GoogleOneTapEvent', { moment_type: momentType, moment_reason: momentReason, }); }</script><script>(function() { var auvid = unescape( document.cookie .split(/; ?/) .find((s) => s.startsWith('auvid')) .substring(6)); var bucket = AbTest.ab_test(auvid, 'lo_ri_one_tap_google_sign_on', ['control', 'one_tap_google_sign_on']); if (bucket === 'control') return; var oneTapTag = document.createElement('script') oneTapTag.async = true oneTapTag.defer = true oneTapTag.src = 'https://accounts.google.com/gsi/client' document.body.appendChild(oneTapTag) })();</script></div></div></div> </div> <div class="bootstrap login"><div class="modal fade login-modal" id="login-modal"><div class="login-modal-dialog modal-dialog"><div class="modal-content"><div class="modal-header"><button class="close close" data-dismiss="modal" type="button"><span aria-hidden="true">×</span><span class="sr-only">Close</span></button><h4 class="modal-title text-center"><strong>Log In</strong></h4></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><button class="btn btn-fb btn-lg btn-block btn-v-center-content" id="login-facebook-oauth-button"><svg style="float: left; width: 19px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="facebook-square" class="svg-inline--fa fa-facebook-square fa-w-14" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><path fill="currentColor" d="M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.25V327.69h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0-48-48z"></path></svg><small><strong>Log in</strong> with <strong>Facebook</strong></small></button><br /><button class="btn btn-google btn-lg btn-block btn-v-center-content" id="login-google-oauth-button"><svg style="float: left; width: 22px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="google-plus" class="svg-inline--fa fa-google-plus fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M256,8C119.1,8,8,119.1,8,256S119.1,504,256,504,504,392.9,504,256,392.9,8,256,8ZM185.3,380a124,124,0,0,1,0-248c31.3,0,60.1,11,83,32.3l-33.6,32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9,0-77.2,35.5-77.2,78.1S142.3,334,185.3,334c32.6,0,64.9-19.1,70.1-53.3H185.3V238.1H302.2a109.2,109.2,0,0,1,1.9,20.7c0,70.8-47.5,121.2-118.8,121.2ZM415.5,273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5Z"></path></svg><small><strong>Log in</strong> with <strong>Google</strong></small></button><br /><style type="text/css">.sign-in-with-apple-button { width: 100%; height: 52px; border-radius: 3px; border: 1px solid black; cursor: pointer; } .sign-in-with-apple-button > div { margin: 0 auto; / This centers the Apple-rendered button horizontally }</style><script src="https://appleid.cdn-apple.com/appleauth/static/jsapi/appleid/1/en_US/appleid.auth.js" type="text/javascript"></script><div class="sign-in-with-apple-button" data-border="false" data-color="white" id="appleid-signin"><span   ="Sign Up with Apple" class="u-fs11"></span></div><script>AppleID.auth.init({ clientId: 'edu.academia.applesignon', scope: 'name email', redirectURI: 'https://www.academia.edu/sessions', state: "56143ec10ac71981b9061dc487925d1c2e6c9827abd620417ecfb401302cb70d", });</script><script>// Hacky way of checking if on fast loswp if (window.loswp == null) { (function() { const Google = window?.Aedu?.Auth?.OauthButton?.Login?.Google; const Facebook = window?.Aedu?.Auth?.OauthButton?.Login?.Facebook; if (Google) { new Google({ el: '#login-google-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } if (Facebook) { new Facebook({ el: '#login-facebook-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } })(); }</script></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><div class="hr-heading login-hr-heading"><span class="hr-heading-text">or</span></div></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><form class="js-login-form" action="https://www.academia.edu/sessions" accept-charset="UTF-8" method="post"><input type="hidden" name="authenticity_token" value="Rf1NVOrYt50_96UkOAhLY-xzQ_uiiZO67ffI9H72ZJEppK9zBvJ-YGgsqzONMUhON5mqtyreR0p0nSz1kSHB1Q" autocomplete="off" /><div class="form-group"><label class="control-label" for="login-modal-email-input" style="font-size: 14px;">Email</label><input class="form-control" id="login-modal-email-input" name="login" type="email" /></div><div class="form-group"><label class="control-label" for="login-modal-password-input" style="font-size: 14px;">Password</label><input class="form-control" id="login-modal-password-input" name="password" type="password" /></div><input type="hidden" name="post_login_redirect_url" id="post_login_redirect_url" value="https://www.academia.edu/Documents/in/Routing_algorithm" autocomplete="off" /><div class="checkbox"><label><input type="checkbox" name="remember_me" id="remember_me" value="1" checked="checked" /><small style="font-size: 12px; margin-top: 2px; display: inline-block;">Remember me on this computer</small></label></div><br><input type="submit" name="commit" value="Log In" class="btn btn-primary btn-block btn-lg js-login-submit" data-disable-with="Log In" /></br></form><script>typeof window?.Aedu?.recaptchaManagedForm === 'function' && window.Aedu.recaptchaManagedForm( document.querySelector('.js-login-form'), document.querySelector('.js-login-submit') );</script><small style="font-size: 12px;"><br />or <a data-target="#login-modal-reset-password-container" data-toggle="collapse" href="javascript:void(0)">reset password</a></small><div class="collapse" id="login-modal-reset-password-container"><br /><div class="well margin-0x"><form class="js-password-reset-form" action="https://www.academia.edu/reset_password" accept-charset="UTF-8" method="post"><input type="hidden" name="authenticity_token" value="3pwY0m7A6ZDXVeQdwmnVUpIt0TS5Qw8zIY1mDYfZTDOyxfr1guogbYCO6gp3UNZ_Scc4eDEU28O454IMaA7pdw" autocomplete="off" /><p>Enter the email address you signed up with and we'll email you a reset link.</p><div class="form-group"><input class="form-control" name="email" type="email" /></div><script src="https://recaptcha.net/recaptcha/api.js" async defer></script> <script> var invisibleRecaptchaSubmit = function () { var closestForm = function (ele) { var curEle = ele.parentNode; while (curEle.nodeName !== 'FORM' && curEle.nodeName !== 'BODY'){ curEle = curEle.parentNode; } return curEle.nodeName === 'FORM' ? curEle : null }; var eles = document.getElementsByClassName('g-recaptcha'); if (eles.length > 0) { var form = closestForm(eles[0]); if (form) { form.submit(); } } }; </script> <input type="submit" data-sitekey="6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj" data-callback="invisibleRecaptchaSubmit" class="g-recaptcha btn btn-primary btn-block" value="Email me a link" value=""/> </form></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/collapse-45805421cf446ca5adf7aaa1935b08a3a8d1d9a6cc5d91a62a2a3a00b20b3e6a.js"], function() { // from javascript_helper.rb $("#login-modal-reset-password-container").on("shown.bs.collapse", function() { $(this).find("input[type=email]").focus(); }); }); </script> </div></div></div><div class="modal-footer"><div class="text-center"><small style="font-size: 12px;">Need an account? <a rel="nofollow" href="https://www.academia.edu/signup">Click here to sign up</a></small></div></div></div></div></div></div><script>// If we are on subdomain or non-bootstrapped page, redirect to login page instead of showing modal (function(){ if (typeof $ === 'undefined') return; var host = window.location.hostname; if ((host === $domain || host === "www."+$domain) && (typeof $().modal === 'function')) { $("#nav_log_in").click(function(e) { // Don't follow the link and open the modal e.preventDefault(); $("#login-modal").on('shown.bs.modal', function() { $(this).find("#login-modal-email-input").focus() }).modal('show'); }); } })()</script> <div class="bootstrap" id="footer"><div class="footer-content clearfix text-center padding-top-7x" style="width:100%;"><ul class="footer-links-secondary footer-links-wide list-inline margin-bottom-1x"><li><a href="https://www.academia.edu/about">About</a></li><li><a href="https://www.academia.edu/press">Press</a></li><li><a href="https://www.academia.edu/documents">Papers</a></li><li><a href="https://www.academia.edu/topics">Topics</a></li><li><a href="https://www.academia.edu/journals">Academia.edu Journals</a></li><li><a rel="nofollow" href="https://www.academia.edu/hiring"><svg style="width: 13px; height: 13px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="briefcase" class="svg-inline--fa fa-briefcase fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M320 336c0 8.84-7.16 16-16 16h-96c-8.84 0-16-7.16-16-16v-48H0v144c0 25.6 22.4 48 48 48h416c25.6 0 48-22.4 48-48V288H320v48zm144-208h-80V80c0-25.6-22.4-48-48-48H176c-25.6 0-48 22.4-48 48v48H48c-25.6 0-48 22.4-48 48v80h512v-80c0-25.6-22.4-48-48-48zm-144 0H192V96h128v32z"></path></svg> <strong>We're Hiring!</strong></a></li><li><a rel="nofollow" href="https://support.academia.edu/hc/en-us"><svg style="width: 12px; height: 12px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="question-circle" class="svg-inline--fa fa-question-circle fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M504 256c0 136.997-111.043 248-248 248S8 392.997 8 256C8 119.083 119.043 8 256 8s248 111.083 248 248zM262.655 90c-54.497 0-89.255 22.957-116.549 63.758-3.536 5.286-2.353 12.415 2.715 16.258l34.699 26.31c5.205 3.947 12.621 3.008 16.665-2.122 17.864-22.658 30.113-35.797 57.303-35.797 20.429 0 45.698 13.148 45.698 32.958 0 14.976-12.363 22.667-32.534 33.976C247.128 238.528 216 254.941 216 296v4c0 6.627 5.373 12 12 12h56c6.627 0 12-5.373 12-12v-1.333c0-28.462 83.186-29.647 83.186-106.667 0-58.002-60.165-102-116.531-102zM256 338c-25.365 0-46 20.635-46 46 0 25.364 20.635 46 46 46s46-20.636 46-46c0-25.365-20.635-46-46-46z"></path></svg> <strong>Help Center</strong></a></li></ul><ul class="footer-links-tertiary list-inline margin-bottom-1x"><li class="small">Find new research papers in:</li><li class="small"><a href="https://www.academia.edu/Documents/in/Physics">Physics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Chemistry">Chemistry</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Biology">Biology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Health_Sciences">Health Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Ecology">Ecology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></li></ul></div></div><div class="DesignSystem" id="credit" style="width:100%;"><ul class="u-pl0x footer-links-legal list-inline"><li><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li>Academia ©2025</li></ul></div><script> //<![CDATA[ window.detect_gmtoffset = true; window.Academia && window.Academia.set_gmtoffset && Academia.set_gmtoffset('/gmtoffset'); //]]> </script> <div id='overlay_background'></div> <div id='bootstrap-modal-container' class='bootstrap'></div> <div id='ds-modal-container' class='bootstrap DesignSystem'></div> <div id='full-screen-modal'></div> </div> </body> </html>