View in EDS PDF Full Text

Tranquility Domination as a Framework for Stability in Service Networks.

Saved in:
Bibliographic Details
Title: Tranquility Domination as a Framework for Stability in Service Networks.
Authors: M., Viji A.1 vijiam.am@gmail.com, Kishore, Anjaly1 anjalykishor@gmail.com, Kuriakose, Reeja2 reejaiykulambil@gmail.com
Source: IAENG International Journal of Computer Science. May2026, Vol. 53 Issue 5, p2021-2031. 11p.
Subjects: Load balancing (Computer networks), Equilibrium, Graph theory
Abstract: The conventional notion of domination provides coverage of all vertices in a graph, it ignores how evenly the burden is distributed among the dominating vertices. In many real world situations, it is preferred that no single dominator is overburdened in comparison to others. Uneven distribution of workload can induce system instability, degrade efficiency and increase the risk of failure. Motivated by the need for balanced service distribution, the concept of tranquility domination is introduced. Two dual parameters - Perturbation coefficient and Tranquility coefficient are defined and a conceptual extension of domination termed as Tranquility Domination is proposed. These two parameters measure, respectively, the extent of imbalance and the degree of equilibrium within a dominating configuration. Dominating vertices are interpreted as donors, representing service providers, while dominated vertices are viewed as acceptors, representing service recipients. The donor tranquility and the acceptor tranquility collectively contribute to the overall tranquility of the system. The behaviour of tranquility based domination under various standard graph operations, giving comparisons with traditional domination parameters and many theoretical bounds are also established in the paper. In addition, a distance-k version of tranquility domination is introduced, permitting domination influence to reach vertices within distance k. [ABSTRACT FROM AUTHOR]
Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193482052
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Tranquility Domination as a Framework for Stability in Service Networks.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22M%2E%2C+Viji+A%2E%22">M., Viji A.</searchLink><relatesTo>1</relatesTo><i> vijiam.am@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Kishore%2C+Anjaly%22">Kishore, Anjaly</searchLink><relatesTo>1</relatesTo><i> anjalykishor@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Kuriakose%2C+Reeja%22">Kuriakose, Reeja</searchLink><relatesTo>2</relatesTo><i> reejaiykulambil@gmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Computer+Science%22">IAENG International Journal of Computer Science</searchLink>. May2026, Vol. 53 Issue 5, p2021-2031. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Load+balancing+%28Computer+networks%29%22">Load balancing (Computer networks)</searchLink><br /><searchLink fieldCode="DE" term="%22Equilibrium%22">Equilibrium</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The conventional notion of domination provides coverage of all vertices in a graph, it ignores how evenly the burden is distributed among the dominating vertices. In many real world situations, it is preferred that no single dominator is overburdened in comparison to others. Uneven distribution of workload can induce system instability, degrade efficiency and increase the risk of failure. Motivated by the need for balanced service distribution, the concept of tranquility domination is introduced. Two dual parameters - Perturbation coefficient and Tranquility coefficient are defined and a conceptual extension of domination termed as Tranquility Domination is proposed. These two parameters measure, respectively, the extent of imbalance and the degree of equilibrium within a dominating configuration. Dominating vertices are interpreted as donors, representing service providers, while dominated vertices are viewed as acceptors, representing service recipients. The donor tranquility and the acceptor tranquility collectively contribute to the overall tranquility of the system. The behaviour of tranquility based domination under various standard graph operations, giving comparisons with traditional domination parameters and many theoretical bounds are also established in the paper. In addition, a distance-k version of tranquility domination is introduced, permitting domination influence to reach vertices within distance k. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193482052
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 2021
    Subjects:
      – SubjectFull: Load balancing (Computer networks)
        Type: general
      – SubjectFull: Equilibrium
        Type: general
      – SubjectFull: Graph theory
        Type: general
    Titles:
      – TitleFull: Tranquility Domination as a Framework for Stability in Service Networks.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: M., Viji A.
      – PersonEntity:
          Name:
            NameFull: Kishore, Anjaly
      – PersonEntity:
          Name:
            NameFull: Kuriakose, Reeja
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 1819656X
          Numbering:
            – Type: volume
              Value: 53
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: IAENG International Journal of Computer Science
              Type: main
ResultId 1