#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (20)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mahmoud El Chamie, Ji Liu, Tamer Basar
- CDC
- 2014

Consider a network whose nodes have some initial values, and it is desired to design an algorithm that builds on neighbor to neighbor interactions with the ultimate goal of convergence to the average of all initial node values or to some value close to that average. Such an algorithm is called generically “distributed averaging”, and our goal in this paper… (More)

- Mahmoud El Chamie, Giovanni Neglia, Konstantin Avrachenkov
- IEEE Trans. Automat. Contr.
- 2015

This paper studies the weight optimization problem for average consensus protocols by reformulating it as a Schatten norm minimization with parameter p. We show that as p approaches infinity, the optimal solution of the Schatten norm induced problem recovers the optimal solution of the original problem. Moreover, by tuning the parameter p in our proposed… (More)

- Mahmoud El Chamie, Chadi Barakat, Giovanni Neglia
- 2015 IFIP Networking Conference (IFIP Networking)
- 2015

Data offloading from the cellular network to low-cost WiFi has been the subject of several research works in the last years. In-network caching has also been studied as an efficient means to further reduce cellular network traffic. In this paper we consider a scenario where mobile users can download popular contents (e.g., maps of a city, shopping… (More)

- Konstantin Avrachenkov, Mahmoud El Chamie, Giovanni Neglia
- 2011 International Conference on Distributed…
- 2011

In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In this case each sensor maintains a local estimate of the global average, and keeps improving it by performing a weighted sum of the estimates of all its neighbors. The number of… (More)

- Sahar Hoteit, Mahmoud El Chamie, Damien Saucez, Stefano Secci
- Computer Networks
- 2016

In-network caching is an important solution for content offloading from content service providers. However despite a rather high maturation in the definition of caching techniques, minor attention has been given to the strategic interaction among the multiple content providers. Situations involving multiple content providers (CPs) and one Internet Service… (More)

Clustering of a graph is the task of grouping its nodes in such a way that the nodes within the same cluster are well connected, but they are less connected to nodes in different clusters. In this paper we propose a clustering metric based on the random walks’ properties to evaluate the quality of a graph clustering. We also propose a randomized algorithm… (More)

- Mahmoud El Chamie, Tamer Basar
- CDC
- 2014

In this paper, we consider optimal design strategies in consensus protocols for networks vulnerable to adversarial attacks. First we study dynamic (multi-stage) weight selection optimal control for consensus protocols. For the general (multi-stage) case, the solution exists but can rarely be expressed in closed-form. In view of this, we apply optimization… (More)

- Mahmoud El Chamie, Giovanni Neglia
- ACC
- 2014

Due to increasing computer processing power, Newton’s method is receiving again increasing interest for solving optimization problems. In this paper, we provide a methodology for solving smooth norm optimization problems under some linear constraints using the Newton’s method. This problem arises in many machine learning and graph optimization applications.… (More)

- Ji Liu, Mahmoud El Chamie, Tamer Basar, Behçet Açikmese
- CDC
- 2016

- Mahmoud El Chamie, Giovanni Neglia, Konstantin Avrachenkov
- 2013 IFIP Networking Conference
- 2013

An average consensus protocol is an iterative distributed algorithm to calculate the average of local values stored at the nodes of a network. Each node maintains a local estimate of the average and, at every iteration, it sends its estimate to all its neighbors and then updates the estimate by performing a weighted average of the estimates received. The… (More)