CFP last date
20 December 2024
Reseach Article

Performance Evaluation of Single path and Multipath regarding Bandwidth and Delay

by Maryada, Shalini Aggarwal, Pardeep Mittal
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 145 - Number 9
Year of Publication: 2016
Authors: Maryada, Shalini Aggarwal, Pardeep Mittal
10.5120/ijca2016910650

Maryada, Shalini Aggarwal, Pardeep Mittal . Performance Evaluation of Single path and Multipath regarding Bandwidth and Delay. International Journal of Computer Applications. 145, 9 ( Jul 2016), 1-3. DOI=10.5120/ijca2016910650

@article{ 10.5120/ijca2016910650,
author = { Maryada, Shalini Aggarwal, Pardeep Mittal },
title = { Performance Evaluation of Single path and Multipath regarding Bandwidth and Delay },
journal = { International Journal of Computer Applications },
issue_date = { Jul 2016 },
volume = { 145 },
number = { 9 },
month = { Jul },
year = { 2016 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume145/number9/25303-2016910650/ },
doi = { 10.5120/ijca2016910650 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:48:18.407349+05:30
%A Maryada
%A Shalini Aggarwal
%A Pardeep Mittal
%T Performance Evaluation of Single path and Multipath regarding Bandwidth and Delay
%J International Journal of Computer Applications
%@ 0975-8887
%V 145
%N 9
%P 1-3
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper is all about finding multipaths available in the network using disjoint edges and disjoint nodes strategy. In single path routing congestion is a big issue, multipath routing is helpful to find less-congested or congestion free route from source to destination. Disjoint nodes means having no repetition of node that are followed earlier by the data packets to avoid packet congestion or load over the network. Disjoint edge means having no repetition of edges while following the path. The paths have been choosen on the basis of available bandwidth, time required, sequential order of node or hop-count. The sequence of every available single path from the given source to destination have been found using minimum hop dijkstra algorithm so that it is shortest among all available remaining paths. Results are shown on the basis of bandwidth and delay for single path and multipath routing (using disjoint node and disjoint edges).

References
  1. E. W. Dijkstra, "“A note on two problems in connexion with graphs"," Numerische Mathematik, vol. vol. 1, pp. 269-271, 1959.
  2. R. Bellman, "“On a routing problem”," Quarterly of Applied Mathematics, vol. vol. 16, pp. 87–90, 1958.
  3. S. Nelakuditi and Z.-L. Zhang, "“On selection of paths for multipath," Proc. IWQoS, pp. 176-186, 2001.
  4. C. Hopps, "“Analysis of an Equal-Cost Multi-Path algorithm"," vol. RFC2992, no. November 2000.
  5. Dariusz Bursztynowski, Mateusz Dzida Tomasz Janaszka, "On Popularity-Based Load Balancing in Content," 2012.
  6. Siemens AG, Franz-Josef Götz, Siemens AG Michael Bahr, Multi-path Link-state Routing, January January 16-2012, IEEE 802.1 AVB TG Meeting, Munich, Germany.
  7. Srihari Nelakuditi and Zhi-Li Zhang, "On Selection of Paths for Multipath Routing," pp. 170-184, 2001.
  8. A. L. Narasimha Reddy Yong Oh Lee, "Disjoint Multi-Path Routing and Failure Recovery," pp. 1-12, 2010.
  9. Dariusz Bursztynowski ,Mateusz Dzida Tomasz Janaszka, "On Popularity-Based Load Balancing in Content," pp. 1-8, 2011.
  10. S.Varadarajan2 N.Krishna Chaitanya1, "Load Distribution using Multipath-Routing In Data Networks:A Comparative Study," pp. 1-5, 2015.
  11. Farabi Iqbal and Fernando A. Kuipers, "DISJOINT PATHS IN NETWORKS," pp. 1-14, 2015.
Index Terms

Computer Science
Information Sciences

Keywords

Disjoint edges Disjoint nodes Multipath Routing Recovery Path Failure and Single Path Routing.