Content deleted Content added
m Undid revision 163672780 by 66.82.9.85 (talk) |
Copyright notice |
||
Line 9:
While the statement that the Min Cut Max Flow Theorem produces the maximum theoretical capacity of a network [from the point of view of a single designated user node pair]is strictly speaking correct, it is a poor bound. This is so since its use assumes that no other nodes are inputing/outputing any data other than a specific designated pair. That is the same pair that defines the appropraite cut referred to by the Min Cut Max flow method. Consequently the use of the resultant to establish an upper bound for the capacity/utility in any useful sense is way too optimistic. Any meaningful estimate would have to assume some spatial/temporal distribution of concurrent users. Since the selection of a parametric distribution brings into play many additional degrees of modeling freedom, a prefered standard seems a long shot to say the least. Of course many more practical limitatins on the connectivity of the network [eg the reachability of a specific node from another without some necesary indirectivity] bring into play many more such model dependent conditions and parameters. Therefore it would seem that a meaningful capacity calculation based on "network topology" alone is not possible for any but the simplist "toy problems"
[[User:Charmonimu5|Charmonimu5]] 21:58, 29 August 2007 (UTC) Richard Schmidt
== Copyright problem removed ==
Prior content in this article duplicated one or more previously published sources. The material was copied from: http://arena.cse.sc.edu/lib/exe/fetch.php/wiki/arena/public/publications/rocx.secon06.pdf. Infringing material has been rewritten or removed and must not be restored, ''unless'' it is duly released under a compatible license. (For more information, please see [[Wikipedia:COPYRIGHT#Using_copyrighted_work_from_others|"using copyrighted works from others"]] if you are not the copyright holder of this material, or [[Wikipedia:Donating copyrighted materials|"donating copyrighted materials"]] if you are.) For [[Wikipedia:Copyrights|legal reasons]], we cannot accept [[Wikipedia:Copyrights|copyrighted]] text or images borrowed from other web sites or published material; such additions will be deleted. Contributors may use copyrighted publications as a source of ''information'', but not as a source of ''sentences'' or ''phrases''. Accordingly, the material ''may'' be rewritten, but only if it does not infringe on the copyright of the original ''or'' [[Wikipedia:Plagiarism|plagiarize]] from that source. Please see our [[Wikipedia:NFC#Text|guideline on non-free text]] for how to properly implement limited quotations of copyrighted text. Wikipedia takes copyright violations very seriously, and persistent violators '''will''' be [[Wikipedia:Blocking policy|blocked]] from editing. While we appreciate contributions, we must require all contributors to understand and comply with these policies. Thank you. <!-- Template:Cclean --> [[User:Dpmuk|Dpmuk]] ([[User talk:Dpmuk|talk]]) 22:12, 2 March 2012 (UTC)
| |||