Time-sensitive applications have become increasingly prevalent in modern networks, necessitating the development of Delay-Guaranteed Routing (DGR) solutions. Finding an optimal DGR solution remains a challenging task due to the NP-hard nature of the problem and the dynamic nature of network traffic. In this paper, we propose Deadline-Driven Routing (DDR), a distributed traffic-aware adaptive routing protocol that addresses the DGR problem. Inspired by online navigation techniques, DDR leverages real-time traffic conditions to optimize routing decisions and ensure on-time packet delivery. By combining network topology-based path generation with real-time traffic knowledge, each router can adjust packet forwarding directions to meet its heterogeneous latency requirements. Comprehensive simulations on real-world network topologies demonstrate that DDR can consistently provide delay-guaranteed service in different network topologies with varying traffic conditions. In addition, DDR ensures backward compatibility with legacy devices and existing routing protocols, making it a viable solution for supporting delay-guaranteed service.

The evolution of network applications poses significant challenges to network service provisioning. Multipath routing and packet spraying techniques have become crucial in networks. TCP performance declines sharply on multipath setups where significant packet reordering occurs, as unordered transmissions are misinterpreted as packet loss and congestion signals. We propose the Multipath Routing Compatible (MPRC) congestion control, which utilizes the delay-sensitive Fast Retransmission Timeout (FastRTO) to decouple reordering from loss signals and enhance loss detection. This modification optimizes congestion window adjustments in multipath environments and handles packet reordering effectively, ensuring stable TCP throughput across multipath settings. Our algorithm was implemented on the NS-3 simulator platform and compared with other congestion control algorithms across various network topologies, in both single-path and multipath routing scenarios. The results demonstrate that MPRC can handle both sporadic and persistent packet reordering, ensuring steady throughput in multipath routing environments while maintaining compatibility and fairness in bandwidth competition, which paves the way for efficient congestion control adopting multi-path routing networks.