File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.3182/20080706-5-KR-1001.0506
- Scopus: eid_2-s2.0-79961019543
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Internet congestion control subject to node and link constraints
| Title | Internet congestion control subject to node and link constraints |
|---|---|
| Authors | |
| Keywords | The Internet Traffic Control |
| Issue Date | 2008 |
| Citation | Ifac Proceedings Volumes (Ifac-Papersonline), 2008, v. 17 n. 1 PART 1 How to Cite? |
| Abstract | This 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 Identifier | http://hdl.handle.net/10722/169827 |
| ISSN | |
| References |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Xia, Y | en_US |
| dc.contributor.author | Hill, DJ | en_US |
| dc.date.accessioned | 2012-10-25T04:55:55Z | - |
| dc.date.available | 2012-10-25T04:55:55Z | - |
| dc.date.issued | 2008 | en_US |
| dc.identifier.citation | Ifac Proceedings Volumes (Ifac-Papersonline), 2008, v. 17 n. 1 PART 1 | en_US |
| dc.identifier.issn | 1474-6670 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/169827 | - |
| dc.description.abstract | This 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.language | eng | en_US |
| dc.relation.ispartof | IFAC Proceedings Volumes (IFAC-PapersOnline) | en_US |
| dc.subject | The Internet | en_US |
| dc.subject | Traffic Control | en_US |
| dc.title | Internet congestion control subject to node and link constraints | en_US |
| dc.type | Conference_Paper | en_US |
| dc.identifier.email | Hill, DJ: | en_US |
| dc.identifier.authority | Hill, DJ=rp01669 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.doi | 10.3182/20080706-5-KR-1001.0506 | en_US |
| dc.identifier.scopus | eid_2-s2.0-79961019543 | en_US |
| dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-79961019543&selection=ref&src=s&origin=recordpage | en_US |
| dc.identifier.volume | 17 | en_US |
| dc.identifier.issue | 1 PART 1 | en_US |
| dc.identifier.scopusauthorid | Xia, Y=35235305600 | en_US |
| dc.identifier.scopusauthorid | Hill, DJ=35398599500 | en_US |
| dc.identifier.issnl | 1474-6670 | - |