S
Sonia Fahmy
Researcher at Purdue University
Publications - 222
Citations - 11620
Sonia Fahmy is an academic researcher from Purdue University. The author has contributed to research in topics: Asynchronous Transfer Mode & Wireless sensor network. The author has an hindex of 39, co-authored 217 publications receiving 11177 citations. Previous affiliations of Sonia Fahmy include Ohio State University & Hewlett-Packard.
Papers
More filters
Proceedings ArticleDOI
A Device-Independent Router Model
TL;DR: A measurement-based model for routers and other forwarding devices is presented, which is used to simulate two different Cisco routers under varying traffic conditions and preliminary results indicate that the model can approximate the Cisco routers.
Journal Article
On determining the fair bandwidth share for ABR connections in ATM networks
TL;DR: In this paper, the authors proposed a new method for determining the effective number of active connections and the fair bandwidth share for each connection, and proved the efficiency and fairness of the proposed method analytically and use several simulations to illustrate its fairness dynamics and transient response properties.
Journal ArticleDOI
FlowMate: scalable on-line flow clustering
O. Younis,Sonia Fahmy +1 more
TL;DR: It is found that coordinated congestion management techniques are more fair when integrated with FlowMate, and the results demonstrate that clustering of medium to long-lived flows is accurate, even with bursty background traffic.
Proceedings ArticleDOI
Synergy: an overlay internetworking architecture
Minseok Kwon,Sonia Fahmy +1 more
TL;DR: Synergy is designed, a utility-based overlay internetworking architecture that fosters overlay cooperation and promotes fair peering relationships to achieve synergism, and results from Internet experiments with cooperative forwarding overlays indicate that the Synergy prototype improves delay, throughput, and loss performance, while maintaining the autonomy and heterogeneity of individual overlay networks.
Proceedings ArticleDOI
Competitive Online Convex Optimization with Switching Costs and Ramp Constraints
TL;DR: A powerful computational framework is developed that can compute an optimized competitive ratio based on the class of affine policies and a robustification procedure is designed to produce an online algorithm that can attain good performance for both average-case and worst-case inputs.