This paper presents a simple, generic source-based end-to-end multicast congestion control (GSC) algorithm for reliable multicast transport (RMT) protocols. The algorithm is completely implemented at the source and leverages the reverse control information ow in RMT protocols like PGM or RMTP [13,44]. Speci cally, it does not introduce any new control tra c or new elds in RMT protocol headers. ...

This paper presents a simple, generic source-based end-to-end multicast congestion control (SBMCC) algorithm for reliable multicast transport (RMT) protocols. The algorithm is completely implemented at the source and leverages the reverse control information ow in RMT protocols like PGM or RMTP [13, 43]. Speci cally, it does not introduce any new control tra c or new elds in RMT protocol header...

In this work, we investigate the congestion control problem for layered video multicast in IP networks of active queue management (AQM) using a simple random early detection (RED) queue model. AQM support from networks improves the visual quality of video streaming but makes network adaptation more difficult for existing layered video multicast proticols that use the event-driven timer-based ap...

Traffic Management and Information Systems, which rely on a system of sensors, aim to describe in real-time traffic in urban areas using a set of parameters and estimating them. Though the state of the art focuses on data analysis, little is done in the sense of prediction. In this paper, we describe a machine learning system for traffic flow management and control for a prediction of traffic f...

We are given a graph G = (V;E) to represent a communication network where jV j = n and jEj = m and a set of multicast requests S1, : : : , Sk V . A solution is a set of k trees T1, : : : , Tk where Ti connects the vertices of Si. The goal of the multicast congestion problem is to find a solution of k trees minimizing the maximum number of times an edge is used. In this paper we present an appro...

In many wireless sensor network applications, the data collection sink (base station) needs to find the aggregated statistics of the network. Readings from sensor nodes are aggregated at intermediate nodes to reduce the communication cost. However, the previous optimally secure in-network aggregation protocols against multiple corrupted nodes require two round-trip communications between each n...

<p style='text-indent:20px;'>This manuscript discusses planning problems for first- and second-order one-dimensional mean-field games (MFGs). These are comprised of a Hamilton–Jacobi equation coupled with Fokker–Planck equation. Applying Poincaré's Lemma to the equation, we deduce existence potential. Rewriting in terms potential, obtain system Euler–Lagrange equations certain variational...

the new competitive environment changes the paradigm of power system operation. in the transmission area, open access process provides fair accessibility for all market participants. congestion management is one of the most important side effects of this new process. this paper proposes a new approach for congestion management which is based on both active and reactive re-dispatch of the networ...

This thesis deals with approximation algorithms for problems in mathematical programming, combinatorial optimization, and their applications. We first study the Convex Min-Max Resource-Sharing problem (the Packing problem as the linear case) with M nonnegative convex constraints on a convex set B, which is a class of convex programming. In general block solvers are required for solving the prob...

In this paper, we study a generalization of z-ideals in the ring C(X) of continuous real valued functions on a completely regular Hausdorff space X. The notion of a weak ideal and naturally a weak z-ideal and a prime weak ideal are introduced and it turns out that they behave such as z-ideals in C(X).