Search

Your search keyword '"Harfoush, Khaled A."' showing total 40 results
Start Over Author "Harfoush, Khaled A."
40 results on '"Harfoush, Khaled A."'

4. Measuring Bandwidth Signatures of Network Paths

Author

Neginhal, Mradula, Harfoush, Khaled, Perros, Harry, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Akyildiz, Ian F., editor, Sivakumar, Raghupathy, editor, Ekici, Eylem, editor, Oliveira, Jaudelice Cavalcante de, editor, and McNair, Janise, editor

Published
2007
Full Text
View/download PDF

11. Inference and labeling of Metric-Induced Network Topologies

Author

Bestavros, Azer, Byers, John W., and Harfoush, Khaled A.

Subjects
Network architecture -- Analysis, Bayesian statistical decision theory -- Methods, Network architecture, Business, Computers, Electronics, Electronics and electrical industries
Abstract

Metric-Induced Network Topology (MINT), a general framework for the construction of metric-induced models using end-to-end measurements is proposed. The basic theoretical underpinnings of MINT for a broad class of performance metrics is presented and PERISCOPE, a Linux embodiment of MINT constructions are described.

Published
2005

38. On the efficacy of WDM virtual topology design strategies.

Author

Ma, Xuezhou and Harfoush, Khaled

Abstract

Existing WDM virtual topology models mainly aim at maximizing the network throughput by optimizing predetermined objective functions. While the literature is rich in variants of such objective functions, they share a few deficiencies. Specifically, they abstract the problem with one fixed objective assuming that the throughput hindrance is uniform across the network, and do not consider node structure nor router utilization. These factors, when considered, affect network bottlenecks limiting a network throughput. As a result, none of the existing models fits all ISP networks. In this paper, we introduce a novel algorithm to determine a network bottleneck based on the 1) physical topology, 2) traffic demand and 3) technology constraints, and a topology model leading to optimized network throughput. [ABSTRACT FROM PUBLISHER]

Published
2013
Full Text
View/download PDF

39. Towards a robust and green internet backbone network.

Author

Ma, Xuezhou and Harfoush, Khaled

Abstract

Networking infrastructure consumes a sizable fraction of the electricity supply. A network design model aimed at maximizing energy savings by aggregating traffic demand at a small set of resources, to put under-utilized resources to sleep, is offset by legacy models aimed at maximizing the network throughput by spreading the load across network resources. Traffic fluctuations and sudden spikes further complicate the problem. In this paper, we show that the problem is NP-hard, and propose a heuristic which targets optimal power usage for common traffic demand, while accommodating traffic fluctuations. The efficacy of our design is tested on two published backbone networks: NLR and NSFNET. Simulation results reveal that the proposed heuristic closely matches the results of the optimal algorithm in both energy savings and network utilization, while enjoying polynomial time complexity. [ABSTRACT FROM PUBLISHER]

Published
2012

40. Measuring Capacity Bandwidth of Targeted Path Segments.

Author

Harfoush, Khaled, Bestavros, Azer, and Byers, John

Subjects
INTERNET traffic, TELECOMMUNICATION traffic, COMPUTER networks, BOTTLENECKS (Manufacturing), END-to-end delay, BANDWIDTHS, DATA transmission systems
Abstract

Accurate measurement of network bandwidth is important for network management applications as well as flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. Extensive work has focused on two approaches to measuring band-width: measuring it hop-by-hop, and measuring it end-to-end along a path. Unfortunately, best-practice techniques for the former are inefficient and techniques for the latter are only able to observe bottlenecks visible at end-to-end scope. In this paper, we develop end-to-end probing methods which can measure bottleneck capacity bandwidth along arbitrary, targeted subpaths of a path in the network, including subpaths shared by a set of flows. We evaluate our technique through ns simulations, then provide a comparative Internet performance evaluation against hop-by-hop and end-to-end techniques. We also describe a number of applications which we foresee as standing to benefit from solutions to this problem, ranging from network troubleshooting and capacity provisioning to optimizing the layout of application-level overlay networks, to optimized replica placement. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results