Fully Distributed Algorithms for Minimum Delay Routing Under Heavy Traffic
IEEE Trans. Mob. Comput., pp. 1048-1060, 2014.
RoutingDelaysLoad modelingLoad managementMobile computingMore(2+)
We study a minimum delay routing problem in the context of distributed networks with and without partial load information. Even though a general minimum delay routing problem is NP hard, assuming uniformly distributed \\(K\\) source-destination (SD) pairs at random, we provide a lower bound on the average delay and demonstrate by simulati...More
Full Text (Upload PDF)
PPT (Upload PPT)