This article presents a multicommodity, discrete-time, distributed, and noncooperative routing algorithm, which is proved to converge an equilibrium in the presence of heterogeneous, unknown, time-varying but bounded delays. Under mild assumptions on latency functions, describe cost associated with network paths, two algorithms are proposed: The former assumes that each commodity relies only me...