Dynamic Multi Constraint Multi Path QOS Routing Algorithm (DMCMPRA)

Novel routing paradigms, based on policies and quality of service (QoS) requirements, have been proposed for the Internet over the last decade. Constraint-based path selection algorithm is of utmost importance in the field of QoS routing. An Internet service provider wants to find paths for QoS flow...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computers & applications Vol. 32; no. 3; pp. 347 - 354
Main Authors: Leela, R., Selvakumar, S.
Format: Journal Article
Language:English
Published: Taylor & Francis 01.01.2010
Subjects:
DIMCRA
MCP
QoS
SAMCRA
ISSN:1206-212X, 1925-7074, 1925-7074
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Novel routing paradigms, based on policies and quality of service (QoS) requirements, have been proposed for the Internet over the last decade. Constraint-based path selection algorithm is of utmost importance in the field of QoS routing. An Internet service provider wants to find paths for QoS flows that optimize the network resources and satisfy the user requirements. But, unfortunately the problem of finding a path with multiple constraints such as delay, jitter, bandwidth, and packet loss is a Nondeterministic polynomial (NP)-complete problem. Hence, various heuristics have been proposed to find a path that satisfies more than one constraint. All these heuristics find feasible path using link-state information, which are considered to be static throughout. These heuristics do not consider the dynamic parameter such as the queuing situation at a given node. Hence, in this paper, a heuristic called dynamic multi constraint multi path routing algorithm (DMCMPRA), which incorporates a better cost model using dynamic variables (viz., buffer occupancy at a node to estimate the link cost) to compute the best path for the QoS flow and to balance the load among alternate feasible paths to the destination, is proposed. DMCMPRA uses the self-adaptive multi-constrained routing algorithm (SAMCRA) to find the k QoS aware paths. Then the link-disjoint multiple constraints routing algorithm (DIMCRA) is used to find all the n link disjoint paths among these k paths. The proposed new cost model is used to select the best path from the n link disjoint paths. On congestion notification, load balancing is achieved by selecting an alternate feasible path from the n-1 link disjoint path using the same cost model. Computer simulations show that the performance of DMCMPRA is better than SAMCRA in terms of the metrics such as percentage of successfully received packets, average delay, etc.
AbstractList Novel routing paradigms, based on policies and quality of service (QoS) requirements, have been proposed for the Internet over the last decade. Constraint-based path selection algorithm is of utmost importance in the field of QoS routing. An Internet service provider wants to find paths for QoS flows that optimize the network resources and satisfy the user requirements. But, unfortunately the problem of finding a path with multiple constraints such as delay, jitter, bandwidth, and packet loss is a Nondeterministic polynomial (NP)-complete problem. Hence, various heuristics have been proposed to find a path that satisfies more than one constraint. All these heuristics find feasible path using link-state information, which are considered to be static throughout. These heuristics do not consider the dynamic parameter such as the queuing situation at a given node. Hence, in this paper, a heuristic called dynamic multi constraint multi path routing algorithm (DMCMPRA), which incorporates a better cost model using dynamic variables (viz., buffer occupancy at a node to estimate the link cost) to compute the best path for the QoS flow and to balance the load among alternate feasible paths to the destination, is proposed. DMCMPRA uses the self-adaptive multi-constrained routing algorithm (SAMCRA) to find the k QoS aware paths. Then the link-disjoint multiple constraints routing algorithm (DIMCRA) is used to find all the n link disjoint paths among these k paths. The proposed new cost model is used to select the best path from the n link disjoint paths. On congestion notification, load balancing is achieved by selecting an alternate feasible path from the n-1 link disjoint path using the same cost model. Computer simulations show that the performance of DMCMPRA is better than SAMCRA in terms of the metrics such as percentage of successfully received packets, average delay, etc.
Author Selvakumar, S.
Leela, R.
Author_xml – sequence: 1
  givenname: R.
  surname: Leela
  fullname: Leela, R.
  organization: Department of Computer Science and Engineering, National Institute of Technology
– sequence: 2
  givenname: S.
  surname: Selvakumar
  fullname: Selvakumar, S.
  organization: Department of Computer Science and Engineering, National Institute of Technology
BookMark eNqNkF1LwzAYhYNMcE7_Q8EbvejMR5O2eDU65wcbm1PBu5CmyRZpE0kyZP_eju0HePFyDgfOeeG5BAPrrALgBsExJojdv7qdt6IdY4j761NysCkuCnYGhqjENM1hng16jyFLMcJfF-AyhG8IsxyzYgiq6d6KzshksWujSSpnQ_TC2HgKViJuk7fle7J2u2jsJpm0G-dN3HbJ7XRRLVbryd0VONeiDer6pCPwOXv8qJ7T-fLppZrMU4kKGlONsSgUoQT2rzWtJSs1lqVWFIlMy6bJckjrEhYkU7qhgjGGdI3LMkdU4awmI_Bw3JXeheCV5j_edMLvOYL8wIOfePAeAj_w4ORoex59e3ZsG6ud78Sv823Do9i3zmsvrDSBk_8M_QH8LW4z
ContentType Journal Article
Copyright Copyright 2010 Taylor and Francis Group LLC 2010
Copyright_xml – notice: Copyright 2010 Taylor and Francis Group LLC 2010
DBID AAYXX
CITATION
DOI 10.2316/Journal.202.2010.3.202-2886
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1925-7074
EndPage 354
ExternalDocumentID 10_2316_Journal_202_2010_3_202_2886
11441998
Genre Article
GroupedDBID .4S
.DC
0BK
0R~
29J
30N
5GY
7WY
8FL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGFS
ACTIO
ADCVX
ADGTB
ADUMR
AEISY
AEYOC
AFRVT
AGBKS
AGDLA
AHDZW
AIJEM
AIYEW
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
ARCSS
AWYRJ
BLEHA
CCCUG
CS3
DGEBU
DKSSO
EBS
EDO
EJD
H13
I-F
K60
K6~
KYCEM
M4Z
MK~
ML~
P0W
QAV
RNANH
ROSJB
RTWRZ
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
TUS
ZGOLN
8FE
8FG
8R4
8R5
AAYXX
ABUWG
ACTTO
AFBWG
AFFHD
AFION
AFKRA
AGVKY
AGWUF
AI.
ALRRR
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
BPHCQ
BWMZZ
CCPQU
CITATION
CYRSC
DAOYK
DWQXO
FRNLG
GNUQQ
HCIFZ
IPNFZ
K6V
K7-
LJTGL
M0C
OPCYK
P62
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
Q2X
RIG
VH1
ID FETCH-LOGICAL-c185t-f22a8e3530726f5bc69f2c9fe51a4fcdd4705b90834efd5a6661fb299715e24b3
IEDL.DBID TFW
ISSN 1206-212X
1925-7074
IngestDate Sat Nov 29 05:31:28 EST 2025
Mon Oct 20 23:42:11 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c185t-f22a8e3530726f5bc69f2c9fe51a4fcdd4705b90834efd5a6661fb299715e24b3
PageCount 8
ParticipantIDs informaworld_taylorfrancis_310_2316_Journal_202_2010_3_202_2886
crossref_primary_10_2316_Journal_202_2010_3_202_2886
PublicationCentury 2000
PublicationDate 1/1/2010
PublicationDateYYYYMMDD 2010-01-01
PublicationDate_xml – month: 01
  year: 2010
  text: 1/1/2010
  day: 01
PublicationDecade 2010
PublicationTitle International journal of computers & applications
PublicationYear 2010
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
SSID ssj0047268
Score 1.7465305
Snippet Novel routing paradigms, based on policies and quality of service (QoS) requirements, have been proposed for the Internet over the last decade....
SourceID crossref
informaworld
SourceType Index Database
Publisher
StartPage 347
SubjectTerms DIMCRA
MCP
QoS
SAMCRA
Title Dynamic Multi Constraint Multi Path QOS Routing Algorithm (DMCMPRA)
URI https://www.tandfonline.com/doi/abs/10.2316/Journal.202.2010.3.202-2886
Volume 32
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1925-7074
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0047268
  issn: 1206-212X
  databaseCode: TFW
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEB5KEfFifWJ9EdCDHoJuHvs4SWmtHmytWrW3sI9EC9pKu_r7nWy20N4Kegu7MCwzycx82W9mAE4z6WWCpRGVOjUU47VPY9zHlGtfB5alkBaFtC93QbcbDgZRrwI3s1oYS6u0GNq4RhGFr7aHO06mjrbs-RdlqobgjjluFrdLysLQtt7G_N5S-_rt15lHFgFzJXEM0TO66sEqnCwhayFSLfQxnYtA7dq_ffsGrJdvScPtmk2o6NEW1GYDHkh53reh2XLz6klRpkvscM9ipERePuhh-kge7p-I5RVhDCSNj7fxZJi_f5KzVqfZ6T02znfguX3db97ScuoCTTF259QwFoeaSzz8zDcySf3IoDGNll4sTJplIriUSYSpm9AmkzHiH88kGNUCT2omEr4L1dF4pPeAILxBh5ghyo44WoWHsf2JGcnYZEaIlNdBzDSsvlxzDYWgxCpKlapQqB1lFaW4W6Ki6nA1bw2VF3cbxg0iUXwJCft_lnAAa45HYC9jDqGaT771EaykP_lwOjkutt8vXR7bJA
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDLbGQMCF8RTjGQkOcKigadLHCU0b0xDbGDBgt6iPBCbBhkbh9-M0rbTdJsEtaqWochzbn2v7AzhNuJ0wGgcWl7Gy0F-7Voh6bDnSlZ6uUoizRtrnttft-oNB0CtBq-iF0WWVGkMrMygis9X6cutktKlbtt2LPFZDdEdNcZajlxb1fXcBFjVHnYZh_eZLYZOZR01THEX8jMZ6sAwnc2w246tmJplO-aBm5f--fh3W8rekZhRnA0pytAmVguOB5Fd-C-oNQ1lPsk5dovk9M1aJNH_QwwiS3N89El1ahG6Q1N5fx5Nh-vZBzhqdeqf3UDvfhqfmdb_esnLiBStG951aitLQlw7H-09dxaPYDRSep5LcDpmKk4R5lzwKMHpjUiU8RAhkqwgdm2dzSVnk7EB5NB7JXSCIcNAmJgi0A4dhaOCH-j9mwEOVKMZipwqsELH4NPM1BOISLSiRi0KgdIQWlHDMEgVVhavp4xBplt5QhotEOHPssPfnHY5hpdXvtEX7pnu7D6umrEDnZg6gnE6-5SEsxT_p8GtylOniLzgA30c
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEB5qleLFt1ifAT3oYdHNJvs4SWmtim1dtWpvYR-JFrQtdfX3O9lsob0V9BZ2YVgm8_qyM_kATlJup4wmgcVloizM164VoR1bjnSlp7sUknyQ9qXldTp-rxeEJbiezMLotkqNoZW5KCKP1dq5R6kybcu2e16UagjuqOnNcvTSor7vLsAiFtBcm3e3-ToJycyjZiaOInzGWN2rwPEcwmZS1cxFplMpqLn6bx-_BivFW1IzZrMOJTnYgNUJwwMpHH4T6g1DWE_yOV2i2T1zTomseBBi_Uge7p-IbizCJEhqH2_DcT97_ySnjXa9HT7WzrbguXnVrd9YBe2ClWDyzixFaeRLh6P3U1fxOHEDhbupJLcjppI0Zd4FjwOs3ZhUKY8QANkqxrTm2VxSFjvbUB4MB3IHCOIbjIgpwuzAYVgY-JH-ixnwSKWKscSpAptoWIzM7RoCUYlWlChUIVA7QitKOGaJiqrC5fRuiCw_3FCGiUQ4c0jY_bOEI6iEjaZo3Xbu9mDZ9BTog5l9KGfjb3kAS8lP1v8aH-aW-AuyBt35
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Dynamic+Multi+Constraint+Multi+Path+QOS+Routing+Algorithm+%28DMCMPRA%29&rft.jtitle=International+journal+of+computers+%26+applications&rft.au=Leela%2C+R.&rft.au=Selvakumar%2C+S.&rft.date=2010-01-01&rft.pub=Taylor+%26+Francis&rft.issn=1206-212X&rft.eissn=1925-7074&rft.volume=32&rft.issue=3&rft.spage=347&rft.epage=354&rft_id=info:doi/10.2316%2FJournal.202.2010.3.202-2886&rft.externalDocID=11441998
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1206-212X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1206-212X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1206-212X&client=summon