Internet applications that route data over default Internet paths can often increase performance by sending their traffic over alternative “detour” paths. Previous work has sho...
Thom Haddow, Sing Wang Ho, Jonathan Ledlie, Cristi...
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...
Thomas L. Rodeheffer, Chandramohan A. Thekkath, Da...
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
— In this paper, we introduce a search engine, Dgoogle, designed for large scale P2P systems. Dgoogle is purely text-based, does not organize documents based on pre-defined keyw...