File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Internet congestion control subject to node and link constraints

TitleInternet congestion control subject to node and link constraints
Authors
KeywordsThe Internet
Traffic Control
Issue Date2008
Citation
Ifac Proceedings Volumes (Ifac-Papersonline), 2008, v. 17 n. 1 PART 1 How to Cite?
AbstractThis paper studies the mathematical modelling of Internet congestion control. Differently to previous models, which consider either the link capacity or the node processing capability as the constraints, here we take both of them into account, i.e., the aggregate flow rate on a link cannot exceed the link capacity and the aggregate flow rate at a node is limited by the node processing capability. A decentralized primal-dual algorithm is proposed to solve the congestion control problem and its convergence is proven. Using this algorithm we show the bottleneck of the network performance when these two constraints are unbalanced. Copyright © 2007 International Federation of Automatic Control All Rights Reserved.
Persistent Identifierhttp://hdl.handle.net/10722/169827
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorXia, Yen_US
dc.contributor.authorHill, DJen_US
dc.date.accessioned2012-10-25T04:55:55Z-
dc.date.available2012-10-25T04:55:55Z-
dc.date.issued2008en_US
dc.identifier.citationIfac Proceedings Volumes (Ifac-Papersonline), 2008, v. 17 n. 1 PART 1en_US
dc.identifier.issn1474-6670en_US
dc.identifier.urihttp://hdl.handle.net/10722/169827-
dc.description.abstractThis paper studies the mathematical modelling of Internet congestion control. Differently to previous models, which consider either the link capacity or the node processing capability as the constraints, here we take both of them into account, i.e., the aggregate flow rate on a link cannot exceed the link capacity and the aggregate flow rate at a node is limited by the node processing capability. A decentralized primal-dual algorithm is proposed to solve the congestion control problem and its convergence is proven. Using this algorithm we show the bottleneck of the network performance when these two constraints are unbalanced. Copyright © 2007 International Federation of Automatic Control All Rights Reserved.en_US
dc.languageengen_US
dc.relation.ispartofIFAC Proceedings Volumes (IFAC-PapersOnline)en_US
dc.subjectThe Interneten_US
dc.subjectTraffic Controlen_US
dc.titleInternet congestion control subject to node and link constraintsen_US
dc.typeConference_Paperen_US
dc.identifier.emailHill, DJ:en_US
dc.identifier.authorityHill, DJ=rp01669en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.3182/20080706-5-KR-1001.0506en_US
dc.identifier.scopuseid_2-s2.0-79961019543en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79961019543&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume17en_US
dc.identifier.issue1 PART 1en_US
dc.identifier.scopusauthoridXia, Y=35235305600en_US
dc.identifier.scopusauthoridHill, DJ=35398599500en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats