Design and Development of Optimal Routing Algorithm in Overlay Network.

An optimal routing in overlay networks. An overlay network is built by including new overlay nodes top of an inheritance network. The overlay nodes are fit for actualizing any powerful routing Algorithm, be that as it may, the inheritance underlay has a fixed, single path routing plan and uses a str...

Full description

Bibliographic Details
Published in:Turkish Journal of Physiotherapy Rehabilitation Vol. 32; no. 2; pp. 510 - 517
Main Authors: M., Omkarsharma, Kar, Pankaj Kawad
Format: tables/charts Journal Article
Published: Turkish Journal of Physiotherapy & Rehabilitation 2021
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=151005996&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 151005996
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        13008757
        YU1
      jtl: Turkish Journal of Physiotherapy Rehabilitation
      issn: 13008757
      maglogo: N
    pubinfo:
      dt: 2021
      vid: 32
      iid: 2
      pid: 20392
      pub: Turkish Journal of Physiotherapy & Rehabilitation
      place: Kizilay/ Ankara, <Blank>
    artinfo:
      ui:
        151005996
        151005996
        151005996
        151005996
      ppf: 510
      ppct: 7
      formats:
        fmt:
          @attributes:
            type: P
      tig:
        atl: Design and Development of Optimal Routing Algorithm in Overlay Network.
      aug:
        au:
          M., Omkarsharma
          Kar, Pankaj Kawad
        affil: Research Scholar, Dept. of Computer Science & Engineering, Sri Satya Sai University of Technology & Medical Sciences, Sehore, Bhopal-Indore Road, MadhyaPradesh, India
      sug:
        subj:
          Algorithms
          Internet
          Computer Communication Networks Methods
          Computer Simulation
          User-Computer Interface
      ab: An optimal routing in overlay networks. An overlay network is built by including new overlay nodes top of an inheritance network. The overlay nodes are fit for actualizing any powerful routing Algorithm, be that as it may, the inheritance underlay has a fixed, single path routing plan and uses a straightforward work-saving sending Algorithm. Additionally, the underlay routes are pre-decided and obscure to the overlay network. The overlay network can expand the attainable throughput of the underlay by utilizing various routes, which comprise of direct routes and backhanded routes through other overlay nodes. OORA can be executed in a dispersed way. We show that the underlay lengths can be utilized as a substitute for the double factors. Likewise propose different plans to accumulate the data about the underlay that is needed by OORA and look at their exhibition in simulations.
      pubtype: Academic Journal
      doctype:
        tables/charts
        Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N