View in EDS

A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks.

Saved in:
Bibliographic Details
Title: A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks.
Authors: Wang J; The Department of Automation, The Xiamen University, China.; The Shenzhen Research Institute of Xiamen University, China., Ashour M; The Department of Electrical Engineering and Computer Science, The Pennsylvania State University, United States of America., Lagoa CM; The Department of Electrical Engineering and Computer Science, The Pennsylvania State University, United States of America., Aybat NS; The Department of Industrial Engineering, The Pennsylvania State University, United States of America., Che H; The Department of Computer Science and Engineering, The University of Texas at Arlington, United States of America.
Source: Automatica : the journal of IFAC, the International Federation of Automatic Control [Automatica (Oxf)] 2019 Nov; Vol. 109. Date of Electronic Publication: 2019 Aug 01.
Publication Type: Journal Article
Language: English
Journal Info: Publisher: Elsevier Country of Publication: England NLM ID: 101493124 Publication Model: Print-Electronic Cited Medium: Print ISSN: 0005-1098 (Print) Linking ISSN: 00051098 NLM ISO Abbreviation: Automatica (Oxf) Subsets: PubMed not MEDLINE
Imprint Name(s): Publication: <2005->: Amsterdam : Elsevier
Original Publication: Oxford ; Elmsford, N.Y. : Pergamon Press, 1963-
Abstract: As IP video services have emerged to be the predominant Internet application, how to optimize the Internet resource allocation, while satisfying the quality of experience (QoE) for users of video services and other Internet applications becomes a challenge. This is because the QoE perceived by a user of video services can be characterized by a staircase function of the data rate, which is nonconcave and hence it is "hard" to find the optimal operating point. The work in this paper aims at tackling this challenge. It considers the packet routing problem among multiple end points in packet switching networks based on a connectionless, hop-by-hop forwarding paradigm. We model this traffic allocation problem using a fluid flow model and let the link bandwidth be the only resource to be shared. To maximize the utilization of resources and avoid congestion, we formulate the problem as a network utility maximization problem. More precisely, the objective of this paper is to design a Fully Distributed Traffic Allocation Algorithm (FDTAA) that is applicable to a large class of nonconcave utility functions. Moreover, FDTAA runs in a fully distributed way: it enables each router to independently address and route each data unit using immediate local information in parallel, without referring to any global information of the communication network. FDTAA requires minimum computation workload, since the routing decision made at each router is solely based on the destination information carried in each unit. In addition, the network utility values corresponding to the FDTAA iterate sequence converge to the optimal network utility value at the rate of (1/ K ), where K is the iteration counter. These theoretical results are exemplified by the simulation performed on an example communication network.
Grant Information: R01 HL142732 United States HL NHLBI NIH HHS
Contributed Indexing: Keywords: Connectionless communication networks; Fully distributed traffic allocation algorithm; Network utility maximization problem; Nonconcave utility function; Traffic engineering
Entry Date(s): Date Created: 20210528 Latest Revision: 20210531
Update Code: 20250114
PubMed Central ID: PMC8153178
DOI: 10.1016/j.automatica.2019.108506
PMID: 34045767
Database: MEDLINE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:cmedm&genre=article&issn=00051098&ISBN=&volume=109&issue=&date=20191101&spage=&pages=&title=Automatica : the journal of IFAC, the International Federation of Automatic Control&atitle=A%20fully%20distributed%20traffic%20allocation%20algorithm%20for%20nonconcave%20utility%20maximization%20in%20connectionless%20communication%20networks.&aulast=Wang%20J&id=DOI:10.1016/j.automatica.2019.108506
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=J%20W
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: cmedm
DbLabel: MEDLINE
An: 34045767
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks.
– Name: Author
  Label: Authors
  Group: Au
  Data: &lt;searchLink fieldCode=&quot;AU&quot; term=&quot;%22Wang+J%22&quot;&gt;Wang J&lt;/searchLink&gt;; The Department of Automation, The Xiamen University, China.; The Shenzhen Research Institute of Xiamen University, China.&lt;br /&gt;&lt;searchLink fieldCode=&quot;AU&quot; term=&quot;%22Ashour+M%22&quot;&gt;Ashour M&lt;/searchLink&gt;; The Department of Electrical Engineering and Computer Science, The Pennsylvania State University, United States of America.&lt;br /&gt;&lt;searchLink fieldCode=&quot;AU&quot; term=&quot;%22Lagoa+CM%22&quot;&gt;Lagoa CM&lt;/searchLink&gt;; The Department of Electrical Engineering and Computer Science, The Pennsylvania State University, United States of America.&lt;br /&gt;&lt;searchLink fieldCode=&quot;AU&quot; term=&quot;%22Aybat+NS%22&quot;&gt;Aybat NS&lt;/searchLink&gt;; The Department of Industrial Engineering, The Pennsylvania State University, United States of America.&lt;br /&gt;&lt;searchLink fieldCode=&quot;AU&quot; term=&quot;%22Che+H%22&quot;&gt;Che H&lt;/searchLink&gt;; The Department of Computer Science and Engineering, The University of Texas at Arlington, United States of America.
– Name: TitleSource
  Label: Source
  Group: Src
  Data: &lt;searchLink fieldCode=&quot;JN&quot; term=&quot;%22101493124%22&quot;&gt;Automatica : the journal of IFAC, the International Federation of Automatic Control&lt;/searchLink&gt; [Automatica (Oxf)] 2019 Nov; Vol. 109. &lt;i&gt;Date of Electronic Publication: &lt;/i&gt;2019 Aug 01.
– Name: TypePub
  Label: Publication Type
  Group: TypPub
  Data: Journal Article
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: TitleSource
  Label: Journal Info
  Group: Src
  Data: &lt;i&gt;Publisher: &lt;/i&gt;&lt;searchLink fieldCode=&quot;PB&quot; term=&quot;%22Elsevier%22&quot;&gt;Elsevier &lt;/searchLink&gt;&lt;i&gt;Country of Publication: &lt;/i&gt;England &lt;i&gt;NLM ID: &lt;/i&gt;101493124 &lt;i&gt;Publication Model: &lt;/i&gt;Print-Electronic &lt;i&gt;Cited Medium: &lt;/i&gt;Print &lt;i&gt;ISSN: &lt;/i&gt;0005-1098 (Print) &lt;i&gt;Linking ISSN: &lt;/i&gt;&lt;searchLink fieldCode=&quot;IS&quot; term=&quot;%2200051098%22&quot;&gt;00051098 &lt;/searchLink&gt;&lt;i&gt;NLM ISO Abbreviation: &lt;/i&gt;Automatica (Oxf) &lt;i&gt;Subsets: &lt;/i&gt;PubMed not MEDLINE
– Name: PublisherInfo
  Label: Imprint Name(s)
  Group: PubInfo
  Data: &lt;i&gt;Publication&lt;/i&gt;: &lt;2005-&gt;: Amsterdam : Elsevier&lt;br /&gt;&lt;i&gt;Original Publication&lt;/i&gt;: Oxford ; Elmsford, N.Y. : Pergamon Press, 1963-
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: As IP video services have emerged to be the predominant Internet application, how to optimize the Internet resource allocation, while satisfying the quality of experience (QoE) for users of video services and other Internet applications becomes a challenge. This is because the QoE perceived by a user of video services can be characterized by a staircase function of the data rate, which is nonconcave and hence it is &quot;hard&quot; to find the optimal operating point. The work in this paper aims at tackling this challenge. It considers the packet routing problem among multiple end points in packet switching networks based on a connectionless, hop-by-hop forwarding paradigm. We model this traffic allocation problem using a fluid flow model and let the link bandwidth be the only resource to be shared. To maximize the utilization of resources and avoid congestion, we formulate the problem as a network utility maximization problem. More precisely, the objective of this paper is to design a Fully Distributed Traffic Allocation Algorithm (FDTAA) that is applicable to a large class of nonconcave utility functions. Moreover, FDTAA runs in a fully distributed way: it enables each router to independently address and route each data unit using immediate local information in parallel, without referring to any global information of the communication network. FDTAA requires minimum computation workload, since the routing decision made at each router is solely based on the destination information carried in each unit. In addition, the network utility values corresponding to the FDTAA iterate sequence converge to the optimal network utility value at the rate of (1/ K ), where K is the iteration counter. These theoretical results are exemplified by the simulation performed on an example communication network.
– Name: GrantInfo
  Label: Grant Information
  Group: Grant
  Data: R01 HL142732 United States HL NHLBI NIH HHS
– Name: SubjectMinor
  Label: Contributed Indexing
  Group:
  Data: &lt;i&gt;Keywords: &lt;/i&gt;Connectionless communication networks; Fully distributed traffic allocation algorithm; Network utility maximization problem; Nonconcave utility function; Traffic engineering
– Name: DateEntry
  Label: Entry Date(s)
  Group: Date
  Data: &lt;i&gt;Date Created: &lt;/i&gt;20210528 &lt;i&gt;Latest Revision: &lt;/i&gt;20210531
– Name: DateUpdate
  Label: Update Code
  Group: Date
  Data: 20250114
– Name: PubmedCentralID
  Label: PubMed Central ID
  Group: ID
  Data: PMC8153178
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1016/j.automatica.2019.108506
– Name: AN
  Label: PMID
  Group: ID
  Data: 34045767
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=cmedm&AN=34045767
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.automatica.2019.108506
    Languages:
      – Code: eng
        Text: English
    Titles:
      – TitleFull: A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Wang J
      – PersonEntity:
          Name:
            NameFull: Ashour M
      – PersonEntity:
          Name:
            NameFull: Lagoa CM
      – PersonEntity:
          Name:
            NameFull: Aybat NS
      – PersonEntity:
          Name:
            NameFull: Che H
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: 2019 Nov
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-print
              Value: 0005-1098
          Numbering:
            – Type: volume
              Value: 109
          Titles:
            – TitleFull: Automatica : the journal of IFAC, the International Federation of Automatic Control
              Type: main
ResultId 1