While strict latency restrictions are imposed on network applications, current best-effort Internet architecture entirely lacks this support. In this paper, we propose a “Latency AWare InterNet” (LAWIN) architecture that supports various latency requirements while retaining the best-effort service model. In the LAWIN architecture, applications specify their desired network latency limits, or deadlines, into all packets, and routers schedule these packets according to their deadlines. To this end, we propose two earliest-deadline-first (EDF)-based packet schedulers. The first imposes the same packet loss rate on all applications regardless of the latency specified by each, and provides rough flow-rate fairness. The second scheduler imposes a biased packet loss probability. The biased scheduler also provides an efficient latency and bandwidth trading mechanism for application settings, which motivates applications to set optimal latencies in order to improve efficiency.

In this study, we present the flexible arrays of inexpensive network (FAIN) architecture: it can be used to maximize parallelism in network systems in order to satisfy future Internet traffic growth. Although the "parallel-in-global" approach used in FAIN overcomes a constraints of serial interfaces, the performance of applications with s small stream can be preserved. FAIN provides thousand of isolated virtualized slices, and enables incremental extensions in the capacity of router systems. FAIN also provides multiple level subscriber differentiation, and power consumption optimization according to the traffic.

Using explicit notification that indicates internal network conditions is a promising way to address the performance issues of congestion control in high-speed networks. In this paper, we propose SIRENS, a scalable, robust, and flexible fine-grained explicit notification framework. SIRENS is a per-hop and in-band notification scheme in which each router captures a snapshot of the various kinds of downstream link status along the IP-level path from a sender to a receiver and notifies the receiver of the status. The receiver can find out the overall path status by assembling all the cumulative notifications that indicate the status in each of the single hops and by feedback can share this information with the sender. Such per-hop information is needed by end-hosts if we are to flexibly design novel congestion control mechanisms or to significantly improve the performance of conventional forms of congestion control. We show that SIRENS can be used to configure TCP Limited Slow-Start and to improve the performance of multi-rate multicast congestion control.