A congestion control method to support coordinated bandwidth allocation

M. Chamara Ranasingha, Manohar Murthi, Kamal Premaratne

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In networked data fusion or control applications, a data sink node may require participating source nodes to transmit data according to certain bit-rate allocations, or bitrate ratios that are determined by the fusion or control task. In a shared network, the coordinated flows of a fusion or control application will need to coexist with the flows of other applications. In this paper, we examine the problem of congestion control of coordinated flows of a fusion or control application along with flows of ordinary data transfer applications. Through a simple modification of a utility function to accommodate the rate coordination, we employ network utility maximization methods to derive window flow control algorithms for both ordinary and coordinated flows. While the congestion control method for the ordinary flows remains unchanged, the coordinated flows require scalar feedback from a sink node to maintain rate coordination. We examine the equilibria, and the impact of the rate coordination algorithm on the ordinary flows, and provide simulation results that demonstrate the efflcacy of the new congestion control method.

Original languageEnglish
Title of host publication2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
Pages597-602
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 - Princeton, NJ, United States
Duration: Mar 22 2006Mar 24 2006

Other

Other2006 40th Annual Conference on Information Sciences and Systems, CISS 2006
CountryUnited States
CityPrinceton, NJ
Period3/22/063/24/06

Fingerprint

Frequency allocation
Data fusion
Data transfer
Flow control
Feedback

Keywords

  • Congestion control
  • Data fusion
  • Networked control
  • Optimization
  • TCP-Vegas
  • Utility function

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Ranasingha, M. C., Murthi, M., & Premaratne, K. (2007). A congestion control method to support coordinated bandwidth allocation. In 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings (pp. 597-602). [4067880] https://doi.org/10.1109/CISS.2006.286539

A congestion control method to support coordinated bandwidth allocation. / Ranasingha, M. Chamara; Murthi, Manohar; Premaratne, Kamal.

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings. 2007. p. 597-602 4067880.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ranasingha, MC, Murthi, M & Premaratne, K 2007, A congestion control method to support coordinated bandwidth allocation. in 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings., 4067880, pp. 597-602, 2006 40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, United States, 3/22/06. https://doi.org/10.1109/CISS.2006.286539
Ranasingha MC, Murthi M, Premaratne K. A congestion control method to support coordinated bandwidth allocation. In 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings. 2007. p. 597-602. 4067880 https://doi.org/10.1109/CISS.2006.286539
Ranasingha, M. Chamara ; Murthi, Manohar ; Premaratne, Kamal. / A congestion control method to support coordinated bandwidth allocation. 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings. 2007. pp. 597-602
@inproceedings{97e037e032e54f6db8c314ec10aa9418,
title = "A congestion control method to support coordinated bandwidth allocation",
abstract = "In networked data fusion or control applications, a data sink node may require participating source nodes to transmit data according to certain bit-rate allocations, or bitrate ratios that are determined by the fusion or control task. In a shared network, the coordinated flows of a fusion or control application will need to coexist with the flows of other applications. In this paper, we examine the problem of congestion control of coordinated flows of a fusion or control application along with flows of ordinary data transfer applications. Through a simple modification of a utility function to accommodate the rate coordination, we employ network utility maximization methods to derive window flow control algorithms for both ordinary and coordinated flows. While the congestion control method for the ordinary flows remains unchanged, the coordinated flows require scalar feedback from a sink node to maintain rate coordination. We examine the equilibria, and the impact of the rate coordination algorithm on the ordinary flows, and provide simulation results that demonstrate the efflcacy of the new congestion control method.",
keywords = "Congestion control, Data fusion, Networked control, Optimization, TCP-Vegas, Utility function",
author = "Ranasingha, {M. Chamara} and Manohar Murthi and Kamal Premaratne",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/CISS.2006.286539",
language = "English",
isbn = "1424403502",
pages = "597--602",
booktitle = "2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings",

}

TY - GEN

T1 - A congestion control method to support coordinated bandwidth allocation

AU - Ranasingha, M. Chamara

AU - Murthi, Manohar

AU - Premaratne, Kamal

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In networked data fusion or control applications, a data sink node may require participating source nodes to transmit data according to certain bit-rate allocations, or bitrate ratios that are determined by the fusion or control task. In a shared network, the coordinated flows of a fusion or control application will need to coexist with the flows of other applications. In this paper, we examine the problem of congestion control of coordinated flows of a fusion or control application along with flows of ordinary data transfer applications. Through a simple modification of a utility function to accommodate the rate coordination, we employ network utility maximization methods to derive window flow control algorithms for both ordinary and coordinated flows. While the congestion control method for the ordinary flows remains unchanged, the coordinated flows require scalar feedback from a sink node to maintain rate coordination. We examine the equilibria, and the impact of the rate coordination algorithm on the ordinary flows, and provide simulation results that demonstrate the efflcacy of the new congestion control method.

AB - In networked data fusion or control applications, a data sink node may require participating source nodes to transmit data according to certain bit-rate allocations, or bitrate ratios that are determined by the fusion or control task. In a shared network, the coordinated flows of a fusion or control application will need to coexist with the flows of other applications. In this paper, we examine the problem of congestion control of coordinated flows of a fusion or control application along with flows of ordinary data transfer applications. Through a simple modification of a utility function to accommodate the rate coordination, we employ network utility maximization methods to derive window flow control algorithms for both ordinary and coordinated flows. While the congestion control method for the ordinary flows remains unchanged, the coordinated flows require scalar feedback from a sink node to maintain rate coordination. We examine the equilibria, and the impact of the rate coordination algorithm on the ordinary flows, and provide simulation results that demonstrate the efflcacy of the new congestion control method.

KW - Congestion control

KW - Data fusion

KW - Networked control

KW - Optimization

KW - TCP-Vegas

KW - Utility function

UR - http://www.scopus.com/inward/record.url?scp=44049091991&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44049091991&partnerID=8YFLogxK

U2 - 10.1109/CISS.2006.286539

DO - 10.1109/CISS.2006.286539

M3 - Conference contribution

SN - 1424403502

SN - 9781424403509

SP - 597

EP - 602

BT - 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

ER -