Final Report : Architectures for Secure and Robust Distributed Infrastructures *

The major barrier constraining the successful management and design of large-scale distributed infrastructures is the conspicuous lack of knowledge about their dynamical features and behaviors. Up until very recently analysis of systems such as the Internet, or the national electricity distribution system, have primarily relied on the use of non-dynamical models, which neglect their complex, and frequently subtle, inherent dynamical properties. These traditional approaches have enjoyed considerable success while systems are run in predominantly cooperative environments, and provided that their performance boundaries are not approached. With the current proliferation of applications using and relying on such infrastructures, these infrastructures are becoming increasingly stressed, and as a result the incentives for malicious attacks are heightening. The stunning fact is that the fundamental assumptions under which all significant large-scale distributed infrastructures have been constructed and analyzed no longer hold; the invalidity of these non-dynamical assumptions is witnessed with the greater frequency of catastrophic failures in major infrastructures such as the Internet, the power grid, the air traffic system, and national-scale telecommunication systems. This project is about network, reliability and robustness in large-scale systems. The major vision of this program is ubiquitous: we have distributed computing and information and would like to link these via secure communications to allow coordination of limited resources to achieve *This research was supported by AFOSR DoD award number 49620-01-1-0365

[1]  Eytan Modiano,et al.  Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity , 2007, IEEE Transactions on Information Theory.

[2]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[3]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[4]  Anurag Kumar,et al.  Time and energy complexity of distributed computation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[5]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  R. Srikant,et al.  Scheduling with QoS constraints over Rayleigh fading channels , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[7]  Sanjeev R. Kulkarni,et al.  A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.

[8]  Sanjay Lall,et al.  Error-bounds for balanced model-reduction of linear time-varying systems , 2003, IEEE Trans. Autom. Control..

[9]  R. Srikant,et al.  Global stability of congestion controllers for the Internet , 2003, IEEE Trans. Autom. Control..

[10]  Scott Shenker,et al.  Approximate Fair Allocation of Link Bandwidth , 2003, IEEE Micro.

[11]  Scott Shenker,et al.  Approximate fairness through differential dropping: (summary) , 2002, CCRV.

[12]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[14]  Philip A. Whiting,et al.  Cdma data qos scheduling on the forward link with variable channel conditions , 2000 .

[15]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[16]  Eyal Kushilevitz,et al.  Computation in noisy radio networks , 2005, SODA '98.

[17]  John N. Tsitsiklis,et al.  Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach , 1998, IEEE Trans. Autom. Control..

[18]  Robert G. Gallager,et al.  Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.

[19]  R. Gallager Information Theory and Reliable Communication , 1968 .