The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time. To address this issue, bandwidth sharing techniques that quickly react to the traffic fluctuations are of interest, especially in large scale settings with hundreds of nodes and thousands of flows. In this context,...
Optimal power flow (OPF) problems are non-convex and large-scale optimization problems. Finding an optimal solution for the OPF problem in real time is challenging and important in various applications. Recent studies show that a wide class of OPF problems have an exact semidefinite programming (SDP) convex relaxation. However, only few works have considered distributed algorithms to solve these....
A distributed algorithm is described for finding a common fixed point of a family of m > 1 nonlinear maps Mi : Rn → Rn assuming that each map is a paracontraction. The common fixed point is asynchronously computed in real time by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its...
Communities can be observed in many real-world graphs. In general, a community can be thought of as a portion of a graph in which intra-community links are dense while inter-community links are sparse. Automatic community structure detection has been well studied in static graphs. However, many practical applications of community structure involve networks in which communities change dynamically over...
As distributed real-time applications gain in popularity, a key challenge is to allocate resources so that diverse real-time requirements (including non-real-time applications), distributed application components and varying workloads can all be accommodated without violating timeliness constraints. We examine the problem of resource allocation in distributed soft real-time systems, where both network...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.