Network Optimization and ControlNow Publishers Inc, 2008 - 113 lappuses The Internet is a very large network with a complex array of control algorithms designed to facilitate data transfer by the users who use it everyday. Network Optimization and Control is aimed at understanding how such control algorithms can be designed for both wired and wireless networks. The approach is primarily based on optimization and control theory, and studies the problem in terms of designing controllers that would make optimal use of network resources. These controllers can be translated into protocols for computers that allow the Internet with many millions of flows to harmoniously adapt to changing traffic loads while maintaining good performance. Network Optimization and Control is the ideal starting point for a mature reader with little background on the subject of congestion control to understand the basic concepts underlying network resource allocation. Though self-contained in itself, there is also an extensive reference list that the interested reader could consult to obtain a deeper understanding of the topics covered. By providing a foundation for understanding the analytical approach to congestion control, the authors hope to encourage both analysts and systems designers to work in synergy while developing protocols for the future Internet. |
No grāmatas satura
1.–5. rezultāts no 9.
. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
15. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
40. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
49. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
51. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Bieži izmantoti vārdi un frāzes
acknowledgment arrival rate assume asymptotically stable aTpr back-pressure algorithm called compute concave function congestion control algorithm consider constraints convergence decentralized decrease denote destination differential equation dual algorithm dynamics equilibrium point feedback delay flow arrivals framework gradient Infocom Kelly mechanism Kunniyur Lagrange multipliers linear link capacity Lyapunov function matrix max-min fairness multi-path Nash equilibrium network planner network resource network stability network utility maximization node Nyquist stability criterion optimal solution optimization problem payoff previous section price function primal algorithm Proceedings of IEEE propagation delay proportionally fair protocols qr(t queue length queueing delay r:ler resource allocation algorithms Rin(i Rout(i route router s:lEs S. H. Low slow-start solve Srikant strategy profile strictly concave TCP-Vegas theorem throughput tion Tqr(t transmission rate Ur(xr utility function utility maximization problem VCG mechanism vector wireless networks Wr(t xr(t zeroes
Populāri fragmenti
108. lappuse - TCP and Explicit Congestion Notification," ACM Computer Communication Review, Vol. 24 No. 5, Pages 10-23, Oct.