This paper introduces the Encrypted Network Traffic Analysis (ENTA) platform, a scalable AI-driven system de-signed for traffic analysis with support for identifying encrypted VoIP traffic generated by instant messaging applications (IMAs). User behaviors, such as exchanging audio messages through different IMAs, are emulated, and the resulting network traffic is captured for analysis. The ENTA platform's capabilities are demonstrated in feature extraction, data pre-processing, AI model training and testing, and generating key performance indi-cators (KPIs) to assist network operations teams. This demonstration showcases the ENTA system's end-to-end functionality with a particular emphasis on accurately classifying and identifying IMA VoIP traffic.

This paper presents new constructions of multistage wave-mixing networks with arbitrary b/spl times/b space-switching elements, where b /spl ges/ 2. In these networks, for a size of F fiber links and W wavelengths per link, converter requirements are O(Flog/sub b/W) or O(FW/b) for rearrangeable nodes, and O(Flog/sub b/Wlog/sub b/(FW)) or O(FWlog/sub b/(FW)/b) for different types of strictly nonblocking nodes inspired from the Cantor topology. In all cases, the worst case number of cascaded conversion is O(log/sub b/W). When b=W /spl les/ F, the required number of converters, and the worst case number of cascaded conversions are respectively O(F) and O(1), and are both optimal up to a constant. The new networks generalize and improve upon previous wave-mixing networks based on 2/spl times/2 space switches.

Feedback delays arise in the control of a computer network-from the information transfer process itself and from the processing of control signals at the network nodes. Flow control of data sources in a computer network often results in a time-delayed control problem. Feedback delay reduces the stability of a system. In this paper we discuss how to use the Routh-Hurwitz stability criterion to design and analyze the stability of a flow control algorithm with feedback delay.

When the control and data planes are physically separate, it is important to maintain the established connections in the data plane even if the protocol plane fails. Channel status is maintained by a signalling protocol. Channel status information will be permanently lost as a result of a failure in the control plane having no recovery capability of the constrained-based routing label distribution protocol (CR-LDP). A recovery mechanism for channel status information is proposed in this paper. A downstream node stores a label information database (LID) of assignable (free) labels for each incoming link. A copy of the LID redundantly stored in the upstream node as a label information mirror (LIM). Each LIM and the corresponding LID are synchronised. The recovery of channel status information is guaranteed.

The setting of the queue thresholds in RED (random early detection) schemes is problematic because the required buffer size for good sharing among TCP connections is dependent on the number of active TCP connections using the buffer. This paper describes a technique for enhancing the effectiveness of RED schemes by dynamically changing the threshold settings as the number of connections (and system load) changes. Using this mechanism, routers and switches can effectively control packet losses and TCP timeouts while maintaining high link utilization. This mechanism is attractive for the deployment of large IP networks supporting a wide range of connections and large aggregations of traffic.

The LDP (label distribution protocol) is used in the control plane to control an optical network. The data plane and the control plane of an optical network could be physically separate. So a failure in the control plane does not necessarily imply a data plane failure and that user communications have to be interrupted. The standard LDP, however, does not provide any mechanism to recover the knowledge stored in LDP entities about the status of the data plane after the faults are fixed. This is a reliability problem of LDP and results in the unnecessary degradation of user communications. On the other hand, in MPLS-enabled IP networks, being able to recover LDP sessions would be potentially faster and more scalable than to re-establish all affected LSPs. The proposed recovery method of LDP for the control plane failures uses label information mirrors (LIMs) in upstream downstream label switching routers (LSRs). Each LIM is a copy of the label information database (LID) in the LSR of an LDP session. We propose a systematic approach to synchronize the contents of a LIM and the corresponding LID, and show how a LIM is used to handle a control plane failure. Detailed descriptions of the recovery procedure for both control channel failures and control node failures are presented. Some significant features of the proposal are outlined.

In TCP (transmission control protocol), congestion control as well as error recovery are implemented by a sliding window. The dynamics of TCP (specifically, a mismatch between the TCP window and the bandwidth-delay product of the network) can sometimes cause the network switches or routers to accumulate large queues, resulting in buffer overflows, reduced throughput, unfairness and underutilization. It is generally accepted that there is a limit as to how much control can be accomplished from the congestion control mechanisms in the end systems. Some mechanisms are thus needed in the intermediate network elements to complement the endpoint congestion avoidance mechanisms. Network layer enhancements such as scheduling mechanisms and packet drop policies have been proposed which are aimed at improving fairness and throughput of the competing endpoint applications. We describe a new TCP rate control scheme based on a simple recursive algorithm. The idea behind the algorithm is to match the network load to the available resources by modifying at an intermediate network element, the receiver's advertised window in TCP acknowledgments returning to the sources. The scheme can be implemented in a router or switch for bandwidth management and does not require knowledge of network delays or maintenance of the per-flow state.

This paper presents a binary feedback flow control scheme which uses the gradient of the system performance function to generate feedback from the network to the data sources. The setting of the single bit congestion indication communicated back to the users is based upon the sign of the gradient of the system performance function. The proposed scheme uses a simple gradient optimization method and a neural model of the system dynamics to determine the gradient of the performance function. Simulation results are presented to compare the performance of the proposed scheme to the conventional queue thresholding approach.

It' has long been known that the complexity of triangulation of simple polygons having an upper bound of 0 (n log n) but a lower bound higher than ~(n) has not been proved yet.We propose here an easily implemented route to the triangulation of simple polygons through the trapezoidization of simple polygons, which is currently done in O(n log n).Then the trapezoidized polygons are triangulated in O(n) time.Both of those steps can be performed on polygons with holes with the same complexity.We also show in this paper that a number of problems, such as the decomposition of simple polygons into convex, star, monotone, spiral, and trapezoidal polygons and the determination of edgevertex visibility, are linearly equivalent to the triangulation problem and therefore share the same lower bound.It is hoped that this will simplify the task of reducing the gap between the lower and upper bound for these problems.