Диссертация (1150610), страница 14
Текст из файла (страница 14)
et al. The scenario approach to robustcontrol design // IEEE Transactions on Automatic Control. 2006. Vol. 51. 5. P. 742-753.[55] Cascetta E. Transportation Systems Engineering: Theory and Methods. Springer Science & Business Media. 2013. 709 p.[56] Cherkassky B. V., Goldberg A. V. On implementing the pushrelabelmethod for the maximum ow problem // Algorithmica. 1997. Vol. 19. 4.
P. 390-410.[57] Chonggun K., Kameda H. Optimal static load balancing of multi-classjobs in a distributed computer system // IEICE TRANSACTIONS(1976-1990). 1990. Vol. 73. 7. P. 1207-1214.[58] Doddini Probhuling L. Load balancing algorithms in cloud computing// International Journal of Advanced Computer and MathematicalSciences. 2013. Vol.
2. P. 2230-9624.[59] Fax J. A., Murray R. M. Information ow and cooperative control ofvehicle formations // IEEE Transactions on Automatic Control. 2004. Vol. 49. 9, P. 1465-1476.[60] Fiedler M. Algebraic connectivity of graphs // Czechoslovakmathematical journal. 1973. Vol. 23. 2, P. 298-305.[61] Fiedler M. Bounds for eigenvalues of doubly stochastic matrices //Linear Algebra and Its Applications.
1972. Vol. 5, 3. P. 299-310.[62] Ford L. R., Fulkerson D. R. Constructing maximal dynamic ows fromstatic ows // Operations research. 1958. Vol. 6. 3. P. 419-433.[63] Ford L. R., Fulkerson D. R. Maximal ow through a network //Canadian journal of Mathematics. 1956. Vol. 8. 3. P.
399-404.97[64] Ford L. R., Fulkerson D. R. Flows in Networks. Princeton PrincetonUniversity Press. 1962. 195 p.[65] Gallo G., Grigoriadis M. D., Tarjan R. E. A fast parametric maximumow algorithm and applications // SIAM Journal on Computing. 1989. Vol. 18. 1. P. 30-55.[66] Garg N., Koenemann J. Faster and simpler algorithms formulticommodity ow and other fractional packing problems // SIAMJournal on Computing. 2007.
Vol. 37. 2. P. 630-652.[67] Glockner G. D., Nemhauser G. L. A dynamic network ow problemwith uncertain arc capacities: formulation and problem structure //Operations Research. 2000. Vol. 48. 2. P. 233-242.[68] Goldberg A. V., Tarjan R. E. A new approach to the maximum-owproblem // Journal of the ACM (JACM). 1988. Vol.
35. 4. P. 921-940.[69] Goldberg A. V., Tarjan R. E. Ecient maximum ow algorithms //Communications of the ACM. 2014. Vol. 57. 8. P. 82-89.[70] Grosu D., Chronopoulos A. T. noncooperative load balancing indistributed systems // Journal of Parallel and Distributed Computing. 2005. Vol. 65. 9. P. 1022-1034.[71] Granichin O., Volkovich V., Toledano-Kitai D. Randomized Algorithmsin Automatic Control and Data Mining. Springer. 2014. 251 p.[72] Han S., Peng Z., Wang S. The maximum ow problem of uncertainnetwork // Information Sciences. 2014. Vol. 265. P. 167-175.[73] He J., Cheng P., Shi L., Chen J., Sun Y.
Time synchronization in wsns:a maximum-value-based consensus approach // IEEE Transactions onAutomatic Control. 2014. Vol. 59. 3. P. 660-675.[74] Herty M., Kirchner C., Moutari S., Rascle M. et al. Multicommodityows on road networks // Communications in Mathematical Sciences. 2008. Vol. 6. 1. P. 171-187.[75] Kalman R. E. A new approach to linear ltering and prediction problems// Journal of basic Engineering.
1960. Vol. 82. 1. P. 35-45.98[76] Kameda H., Li J., Kim C., Zhang Y. Optimal Load Balancingin Distributed Computer Systems. Springer Publishing CompanyIncorporated. 2011. 250 p.[77] Karmarkar N. A new polynomial-time algorithm for linear programming// In: Proc. of the 16th Annual ACM symposium on Theory ofcomputing. 1984. P. 302-311.[78] Kempe D., Dobra A., Gehrke J. Gossip-based computation of aggregateinformation // In: Proc. of the 44th IEEE Annual Symposium onFoundations of Computer Science. 2003. P.
482-491.[79] Kiefer J., Wolfowitz J. et al. Stochastic estimation of the maximum ofa regression function // The Annals of Mathematical Statistics. 1952. Vol. 23. 3. P. 462-466.[80] Kim C., Kameda H. An algorithm for optimal static load balancing indistributed computer systems // IEEE Transactions on Computers. 1992. Vol. 41. 3. P. 381-384.[81] Kohler E., Mohring R. H., Skutella M.
Trac networks and ows overtime // In: Algorithmics of Large and Complex Networks. 2009. Springer. P. 166-196.[82] Kopetz H. Real-Time Systems: Design Principles for DistributedEmbedded Applications. Springer Science & Business Media. 2011. 376 p.[83] Letchford A. N., Salazar-Gonzalez, J.
J. Stronger multi-commodity owformulations of the Capacitated Vehicle Routing Problem // EuropeanJournal of Operational Research. 2015. Vol. 244. 3. P. 730-738.[84] Madry A. Navigating central path with electrical ows: From ows tomatchings, and back // In: Proc of the 54th IEEE Annual Symposiumon Foundations of Computer Science (FOCS). 2013. P.
253-262.[85] Maggs M. K., O'Keefe S. G., Thiel D. V. Consensus clocksynchronization for wireless sensor networks // IEEE sensors Journal. 2012. Vol. 12. 6. P. 2269-2277.[86] Malkovskii N. Asymptotically Optimal Solution forTransportationProblem with Almost ArbitraryCapacities // IFAC-PapersOnLine. 2016. Vol.
48. 11. P. 936-941.99[87] Malkovskii N. Optimal static network load balancing using parametricow approach // IFAC-PapersOnLine. 2015. Vol. 48. 11. P. 668-673.[88] Manfredi S. Design of a multi-hop dynamic consensus algorithm overwireless sensor networks // Control Engineering Practice. 2013. Vol. 21. 4.
P. 381-394.[89] Metropolis N., Rosenbluth A. W., Rosenbluth M. N., Teller A. H.,Teller E. Equation of state calculations by fast computing machines //The Journal of Chemical Physics. 1953. Vol. 21. 6. P. 1087-1092.[90] Nesterov Y., Nemirovskii A., Ye Y. Interior-Point PolynomialAlgorithms in Convex Programming // Society for Industrial andApplied Mathematics (SIAM). 1994. T.
13. 405 p.[91] Olfati-Saber R., Murray R. M. Consensus problems in networks ofagents with switching topology and time-delays // IEEE Transactionson Automatic Control. 2004. Vol. 49. 9. P. 1520-1533.[92] Orlin J. B. Max ows in O(nm) time, or better // In: Proc. of the 45thannual ACM symposium on Theory of computing. 2013. P. 765-774.[93] Parsegov S., Polyakov A., Shcherbakov P. Nonlinear xed-time controlprotocol for uniform allocation of agents on a segment // In: Proc. ofthe 51st IEEE Annual Conference on Decision and Control (CDC). 2012. P. 7732-7737.[94] Ren W., Beard R. W., Atkins E.
M. Information consensus inmultivehicle cooperative control // Control Systems. 2007. Vol. 27. 2. P. 71-82.[95] Rikos A. I., Charalambous T., Hadjicostis C. N. Distributed weightbalancing over digraphs // IEEE Transactions on Control of NetworkSystems. 2014. Vol. 1. 2. P. 190-201.[96] Robbins H., Monro S. A stochastic approximation method // TheAnnals of Mathematical Statistics. 1951. P. 400-407.[97] Shah D.
Gossip Algorithms. Now Publishers Inc. 2008. 125 p.[98] Sheng Y., Gao J. Chance distribution of the maximum ow of uncertainrandom network // Journal of Uncertainty Analysis and Applications. 2014. Vol. 2. 1. P. 1-14.100[99] Skutella M. An introduction to network ows over time // In: ResearchTrends in Combinatorial Optimization. 1958. Springer. P. 451-482.[100] Spall J. C.
Multivariate stochastic approximation using a simultaneousperturbation gradient approximation // IEEE Transactions onAutomatic Control. 1992. Vol. 37. 3. P. 332-341.[101] Tantawi A. N., Towsley D. Optimal static load balancing in distributedcomputer systems // Journal of the ACM (JACM). 1985. Vol. 32. 2. P. 445-465.[102] Tarjan R., Ward J., Zhang B., Zhou Y., and Mao J. Balancingapplied to maximum network ow problems // European Symposiumon Algorithms. 2006. P. 612623.[103] Teodorovic D., Vukadinovic K.
Trac Control and Transport Planning:A Fuzzy Sets and Neural Networks Approach. Springer Science &Business Media. 2012. 385 p.[104] Wiener N. Extrapolation, Interpolation, and Smoothing of StationaryTime Series. MIT press Cambridge. 1949. Vol. 2. 159 p.[105] Zhu S., Chen C., Li W., Yang B., Guan X.
Distributed optimalconsensus lter for target tracking in heterogeneous sensor networks //IEEE transactions on cybernetics. 2013. Vol. 43. 6. P. 19631976.101Ñïèñîê èëëþñòðàöèé1.11.21.31.41.51.61.71.81.93.13.23.3Ïàðàìåòðû äóãè â òðàíñïîðòíîé ñåòè. . . . . . . . . . .
. . . . .Ðàñøèðåííûé ãðàô (ôîðìóëèðîâêà ÷åðåç τ ). Äëÿ íàãëÿäíîñòè äóãèïðîèíäåêñèðîâàíû äâóìÿ áóêâàìè íà÷àëîì è êîíöîì äóãè. . . . .Ðàñøèðåííûé ãðàô (ôîðìóëèðîâêà ÷åðåç λ). Äëÿ íàãëÿäíîñòè äóãèïðîèíäåêñèðîâàíû äâóìÿ áóêâàìè íà÷àëîì è êîíöîì äóãè. . .
. .Ïîòîêîâûå çàäà÷è â èíôîðìàòèêå. . . . . . . . . . . . . . . . . .Èçìåíåíèå λ â àëãîðèòìàõ Minimum breakpoint simple è Minimumbreakpoint GGT. . . . . . . . . . . . . . . . . . . . . . . . . . .Ãðàô äëÿ çàäà÷è áàëàíñèðîâàíèÿ íàãðóçêè . . . . . . . . .
. . .Ïðèìåð áàëàíñèðîâàíèÿ íàãðóçêè . . . . . . . . . . . . . . . . .Ïðèìåð òðàåêòîðèé ÁÏËÀ è çîí âçàèìîäåéñòâèÿ. . . . . . . . . .Îáùèé âèä ôóíêöèè ïðîïóñêíûõ ñïîñîáíîñòåé. Îñíîâíóþ ÷àñòü âðåìåíè ïðîïóñêíàÿ ñïîñîáíîñòü ðàâíà íóëþ. Åñëè òðàåêòîðèè ïîëåòàïåðèîäè÷íû, òî è ïðîïóñêíàÿ ñïîñîáíîñòü ïåðèîäè÷íà. . .
. . . . .Òîïîëîãèè ñåòè, èñïîëüçóåìûå äëÿ òåñòèðîâàíèÿ . . . . . .Ðåçóëüòàòû ñèìóëÿöèè äëÿ çâåçäû . . . . . . . . . . . . . .Ðåçóëüòàòû ñèìóëÿöèè äëÿ êîëüöà ñî ñëó÷àéíûìè äóãàìè102142122253740414343868889Ñïèñîê òàáëèö3.1Ñðåäíåå âðåìÿ ðàáîòû àëãîðèòìîâ íà ñòàíäàðòíûõ òîïîëîãèÿõ ñåòè. . . . . .
. . . . . . . . . . . . . . . . . . . . . .10387.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
