Flow-Aware Multi-Topology Adaptive Routing (FAMTAR) is a new approach to multipath and adaptive routing in IP networks which enables automatic use of alternative paths when the primary one becomes congested. It provides more efficient network resource utilization and higher quality of transmission compared to standard IP routing. However, thus far it has only been evaluated through simulations. In this paper we share our experiences from building a real-time FAMTAR router and present results of its tests in a physical network. The results are in line with those obtained previously through simulations and they open the way to implementation of a production grade FAMTAR router.
A relatively new proposal for flow management was presented in @cite_3 . In this solution, flows are classified and transmitted using multiple paths. A central manager decides which paths should be used for each flow. This proposal looks promising, however, it is complex and difficult to implement. Moreover, the existence of the central manager may result in scalability and security problems in large networks.
@cite_3
2034581981 1481933765 2105831729 2064941967
A regional central manager is employed to set aside, for the regional (or back-bone) network that it manages, for each flow class, communications capacity resources for a specific future time horizon. In the context of such a traffic management operation, a longer temporal scale is involved in controlling the admission and distribution of flows across the network. For management scal-ability purposes, flows are aggregated into flow classes. Furthermore, we consider a network operation under which multiple simultaneously activated routes are employed, across possibly distinct segments, to distribute traffic between identified source-destination pairs. We aim to ensure that the utility assigned to each class is as high as feasibly possible while striving to raise the utility gained by all classes in a maxmin fair manner. In doing so, we incorporate the communications capacity constraints that are imposed by the underlying hybrid of directional and or multiple-access wireline and wireless communications media employed across the network system. We develop and present in this paper an optimal algorithm for solving such a traffic management problem. It yields multi-utility-based max-min fair distributions of flow rates, per each class, across the specified multitude of simultaneously activated multi-segment routes. To guarantee that admitted flows are granted their desired capacity resources (and targeted corresponding utility levels), the selection of optimal flow distributions across the network routes is combined with the use of a flow admission control scheme that serves to optimally limit the aggregate rate of flows admitted for each flow class. As illustrative examples, we demonstrate the effectiveness of our solution in comparing its performance with that obtained under the use of a traffic regulation scheme that is not overlaid with a traffic management mechanism that serves to set aside resources for the support of flow classes. We also illustrate the use of our optimal algorithm for determining the optimal placement of unmanned aerial vehicle platforms that serve to supplement a terrestrial transport segment with a space-based one. Internet service provider faces a daunting challenge in provisioning network efficiently. We introduce a proactive multipath routing scheme that tries to route traffic according to its built-in properties. Based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. Long-lived flows are detected and migrated to the shortest path if their QoS could be guaranteed there. Suggesting nondisjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated. Simulation experiments show that our approach outperforms traditional single path routing significantly. We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems. In this paper, we survey different existing schemes for the transmission of flows in Data Center Networks (DCNs). The transport of flows in DCNs must cope with the bandwidth demands of the traffic that a large number of data center applications generates and achieve high utilization of the data center infrastructure to make the data center financially viable. Traffic in DCNs roughly comprises short flows, which are generated by the Partition Aggregate model adopted by several applications and have sizes of a few kilobytes, and long flows, which are data for the operation and maintenance of the data center and have sizes on the order of megabytes. Short flows must be transmitted (or completed) as soon as possible or within a deadline, and long flows must be serviced with a minimum acceptable throughput. The coexistence of short and long flows may jeopardize achieving both performance objectives simultaneously. This challenge has motivated growing research on schemes for managing the transmission of flows in DCNs. We describe several recent schemes aimed at reducing the flow completion time in DCNs. We also present a summary of existing solutions for the incast traffic phenomenon. We provide a comparison and classification of the surveyed schemes, describe their advantages and disadvantages, and show the different trends for scheme design. For completeness, we describe some DCN architectures, discuss the traffic patterns of DCNs, and discuss why some existing versions of transport protocols may not be usable in DCNs. At the end, we discuss some of the identified research challenges.