Zobrazeno 1 - 1
of 1
pro vyhledávání: '"M.Sampaio Alencar"'
Publikováno v:
Journal of Communications Software and Systems, Vol 7, Iss 4, Pp 121-127 (2011)
The minimization of blocking probability is an important problem for the design of next generation high speednetworks. This problem is usually approached with an adaptive routing algorithm with traffic grooming, that is costly regarding improvements
Externí odkaz:
https://doaj.org/article/c60cbbda032e4dea82de119d6901c9ff
