This paper reports on a probabilistic method for traffic engineering (specifically routing and resource allocation) in backbone networks, where the transport is the main service and robustness to the unexpected changes in network parameters is required. We analyze the network using the probabilistic betweenness of the network nodes (or links). The theoretical results lead to the definition of "criticality" for nodes and links. Link criticality is used as the main metric to model the risk of taking a specific path from a source to a destination node. Different paths will be ranked based on their criticality measure, and the best path will be selected to route the flow along the core network. The choice of the path is in the direction of preserving the robustness of the network to the unforeseen changes in topology and traffic demands. The proposed method is useful in situations like MPLS and Ethernet networks where path assignment is required.
Recent studies have demonstrated that machine learning can be useful for application-oriented network traffic classification. However, a network operator may not be able to infer the application of a traffic flow due to the frequent appearance of new applications or due to privacy and other constraints set by regulatory bodies. In this work, we consider traffic flow classification based on the class of service (CoS), using delay sensitivity as an example in this preliminary study. Our focus is on direct CoS classification without first inferring the application. Our experiments with real-world encrypted TCP flows show that this direct approach can be substantially more accurate than a two-step approach that first classifies the flows based on their applications. However, without invoking application labels, the direct approach is more opaque than the two-step approach. Therefore, to provide human understandable interpretation of the trained learning model, we further propose an explanation framework that utilizes groups of superfeatures defined using domain knowledge and their Shapley values in a cooperative game that mimics the learning model. Our experimental results further demonstrate that this explanation framework is consistent and provides important insights into the classification results.
As the Internet evolves into a global all-service communication infrastructure, a key consideration is providing quality of service guarantees over IP with efficient resource utilization in a scalable, flexible, and automatic way. In this article we present a virtual network (VN) based architecture for scalable IP service deployment and efficient network resource management. Particularly considering a DiffServ/MPLS III transport network supporting multiple VNs, we propose a dynamic approach for efficient bandwidth sharing among VNs. The bandwidth sharing is service-level-agreement-based; the spare capacity in underloaded VNs is adaptively and efficiently utilized, and SLA compliance for all the VNs involved is always guaranteed.