rdviii
commented
3 years ago I think this is the origin: @article{evans1973relationship, title={A relationship between the gravity model for trip distribution and the transportation problem in linear programming}, author={Evans, Suzanne P}, journal={Transportation Research}, volume={7}, number={1}, pages={39--61}, year={1973}, publisher={Elsevier} }
And here are a couple with respect to IP networks: @inproceedings{Roughan:2002:EMB:637201.637213, author = {Roughan, Matthew and Greenberg, Albert and Kalmanek, Charles and Rumsewicz, Michael and Yates, Jennifer and Zhang, Yin}, title = {Experience in measuring backbone traffic variability: models, metrics, measurements and meaning}, booktitle = {Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurement}, series = {IMW ’02}, year = {2002}, isbn = {1-58113-603-X}, location = {Marseille, France}, pages = {91--92}, numpages = {2}, url = {http://doi.acm.org/10.1145/637201.637213}, doi = {10.1145/637201.637213}, acmid = {637213}, publisher = {ACM}, address = {New York, NY, USA}, comment = {Introduction of gravity model into IP networks?} } @article{roughan2003tee, title={{Traffic engineering with estimated traffic matrices}}, author={Roughan, M. and Thorup, M. and Zhang, Y.}, journal={Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement}, pages={248--258}, year={2003}, publisher={ACM New York, NY, USA} }
Similar to today's Internet, with fairly central hubs and an "incast" traffic pattern, with a hub-and-spoke for client-server. (Is that enough buzzwords?) Simplest implementation is to raise the probability that a node gets a new connection based on the number of connections it currently has. need to find the right research paper reference Needs to be under control of a .ned or .ini parameter.