Flexible arrays of inexpensive network (FAIN): toward global parallelism in the internet to satisfy future traffic growth

Authors:
Katsushi Kobayashi
Affiliations:
National Institute of Advanced Science and Technology (AIST), Akihabara, Tokyo, JP
Venue:
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Year:
2008

Citing 3
Cited 1

Packet reordering is not pathological network behavior

IEEE/ACM Transactions on Networking (TON)
Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices (The Morgan Kaufmann Series in Networking)

Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices (The Morgan Kaufmann Series in Networking)
Measurement and classification of out-of-sequence packets in a tier-1 IP backbone

IEEE/ACM Transactions on Networking (TON)

Forty data communications research questions

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.