FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2470297717> ?p ?o ?g. }

• W2470297717 endingPage "184" @default.
• W2470297717 startingPage "184" @default.
• W2470297717 abstract "Rate-based feedback flow control at the network layer has the potential to dramatically alleviate the Internet's artificial bottleneck problems created by bursty, uncoordinated and uncontrolled traffic flows. A good feedback flow control scheme will control traffic rates entering the network such as to keep network queue sizes stably close to a targeted ideal value while maximizing bandwidth utilizations and allocating the bandwidths fairly among different users. Moreover, it will be robust in achieving these objectives in the face of dynamic and unpredictable available link bandwidth and flow routes. This thesis contributes news results towards a fundamental understanding of how to achieve these objectives jointly. Specifically it formulates queue and link bandwidth utilization control as a time-optimal control problem: starting from any initial condition, control the traffic rates entering the network so as to converge the network queue sizes to a desired level in the minimum possible time while still keeping at least one link fully utilized in the path of every flow at all times. The robustness goal is automatically satisfied by the time-optimal control law; we formally prove this for case of a single-queue. Traditional control-theoretic approaches have been based on simplified linear models of the network invalid under severe bandwidth and route disturbances and yet have been intractable for general network topologies, delays and congestion conditions. Typically they lead to local stability or robustness results. In contrast, the time-optimal approach leads to exact global solutions valid even under nonlinear queue dynamics. Formal proofs are given for all results. Moreover, these solutions are computationally simple and lend themselves nicely to designing distributed asynchronous protocols. With a gradual approach, we first solve for time-optimal control of a single queue shared by multiple flows and of a single flow crossing multiple queues. From these, the solution for a general network of queues, with a target queue size of zero, is intuited. The heart of this solution is a spatio-temporal link capacity allocation among the flows: to guarantee time-optimality, it is sufficient for the allocation to be both feasible and maximally-utilizing with respect to “queue-reduced” link capacities. To these two conditions, different fairness criteria can be added thereby resulting in different specific control laws. Thus fairness is neatly separated out from queue control. Specifically, we focus on the max-min fairness criterion. We formally analyze convergence speeds of max-min fair link capacity allocation algorithms and show that previous estimates of their worst-case convergence speeds have been very pessimistic. We also develop a theory of spatio-temporal bandwidth allocation. For networks with consistent link delay differences as seen at different flows, we show how to construct spatio-temporal bandwidth allocation protocols from any available distributed algorithm for a spatially defined allocation such as max-min fair allocation." @default.
• W2470297717 created "2016-07-22" @default.
• W2470297717 creator A5055758454 @default.
• W2470297717 creator A5091228764 @default.
• W2470297717 date "2004-01-01" @default.
• W2470297717 modified "2023-09-27" @default.
• W2470297717 title "Optimal network flow control: time-optimal queue control and max-min fair bandwidth allocation" @default.
• W2470297717 hasPublicationYear "2004" @default.
• W2470297717 type Work @default.
• W2470297717 sameAs 2470297717 @default.
• W2470297717 citedByCount "0" @default.
• W2470297717 crossrefType "journal-article" @default.
• W2470297717 hasAuthorship W2470297717A5055758454 @default.
• W2470297717 hasAuthorship W2470297717A5091228764 @default.
• W2470297717 hasConcept C104317684 @default.
• W2470297717 hasConcept C120314980 @default.
• W2470297717 hasConcept C126255220 @default.
• W2470297717 hasConcept C149635348 @default.
• W2470297717 hasConcept C158379750 @default.
• W2470297717 hasConcept C160403385 @default.
• W2470297717 hasConcept C185592680 @default.
• W2470297717 hasConcept C186766456 @default.
• W2470297717 hasConcept C195563490 @default.
• W2470297717 hasConcept C200157131 @default.
• W2470297717 hasConcept C201100257 @default.
• W2470297717 hasConcept C22684755 @default.
• W2470297717 hasConcept C2776257435 @default.
• W2470297717 hasConcept C2780513914 @default.
• W2470297717 hasConcept C31258907 @default.
• W2470297717 hasConcept C33923547 @default.
• W2470297717 hasConcept C34793927 @default.
• W2470297717 hasConcept C41008148 @default.
• W2470297717 hasConcept C55493867 @default.
• W2470297717 hasConcept C63479239 @default.
• W2470297717 hasConceptScore W2470297717C104317684 @default.
• W2470297717 hasConceptScore W2470297717C120314980 @default.
• W2470297717 hasConceptScore W2470297717C126255220 @default.
• W2470297717 hasConceptScore W2470297717C149635348 @default.
• W2470297717 hasConceptScore W2470297717C158379750 @default.
• W2470297717 hasConceptScore W2470297717C160403385 @default.
• W2470297717 hasConceptScore W2470297717C185592680 @default.
• W2470297717 hasConceptScore W2470297717C186766456 @default.
• W2470297717 hasConceptScore W2470297717C195563490 @default.
• W2470297717 hasConceptScore W2470297717C200157131 @default.
• W2470297717 hasConceptScore W2470297717C201100257 @default.
• W2470297717 hasConceptScore W2470297717C22684755 @default.
• W2470297717 hasConceptScore W2470297717C2776257435 @default.
• W2470297717 hasConceptScore W2470297717C2780513914 @default.
• W2470297717 hasConceptScore W2470297717C31258907 @default.
• W2470297717 hasConceptScore W2470297717C33923547 @default.
• W2470297717 hasConceptScore W2470297717C34793927 @default.
• W2470297717 hasConceptScore W2470297717C41008148 @default.
• W2470297717 hasConceptScore W2470297717C55493867 @default.
• W2470297717 hasConceptScore W2470297717C63479239 @default.
• W2470297717 hasLocation W24702977171 @default.
• W2470297717 hasOpenAccess W2470297717 @default.
• W2470297717 hasPrimaryLocation W24702977171 @default.
• W2470297717 hasRelatedWork W1510969218 @default.
• W2470297717 hasRelatedWork W1550197265 @default.
• W2470297717 hasRelatedWork W1592506959 @default.
• W2470297717 hasRelatedWork W166349142 @default.
• W2470297717 hasRelatedWork W195979844 @default.
• W2470297717 hasRelatedWork W2002403722 @default.
• W2470297717 hasRelatedWork W2024777309 @default.
• W2470297717 hasRelatedWork W2117797188 @default.
• W2470297717 hasRelatedWork W2156219490 @default.
• W2470297717 hasRelatedWork W2158482718 @default.
• W2470297717 hasRelatedWork W2758737187 @default.
• W2470297717 hasRelatedWork W2789557201 @default.
• W2470297717 hasRelatedWork W2796233053 @default.
• W2470297717 hasRelatedWork W2949711473 @default.
• W2470297717 hasRelatedWork W2951088018 @default.
• W2470297717 hasRelatedWork W2951593110 @default.
• W2470297717 hasRelatedWork W2952571765 @default.
• W2470297717 hasRelatedWork W2953271590 @default.
• W2470297717 hasRelatedWork W2953329264 @default.
• W2470297717 hasRelatedWork W2187063915 @default.
• W2470297717 isParatext "false" @default.
• W2470297717 isRetracted "false" @default.
• W2470297717 magId "2470297717" @default.
• W2470297717 workType "article" @default.