Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Joseph D. Houle

dblp:44/5021 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network optimization and economics · 46% Internet architecture and protocols · 23% Edge and fog computing · 23%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics › network economics › internet economics
network neutrality
0.112008
Class-of-service in ip backbones: informing the network neutrality debate · SIGMETRICS 2008
Edge and fog computing › resource management › resource provisioning › network provisioning
over-provisioning
0.112008
Class-of-service in ip backbones: informing the network neutrality debate · SIGMETRICS 2008
Network optimization and economics
resource allocation
0.112008
Class-of-service in ip backbones: informing the network neutrality debate · SIGMETRICS 2008
Internet architecture and protocols › quality of service
service classes
0.112008
Class-of-service in ip backbones: informing the network neutrality debate · SIGMETRICS 2008

Methods — techniques the papers use, named apart from their topics

ns-2 simulation · 0.1link modeling · 0.1
YearPublicationVenuePosition
2012 Required extra capacity: A comparative estimation of overprovisioning needed for a classless IP backbone
Murat Yuksel, K. K. Ramakrishnan, Shivkumar Kalyanaraman, Joseph D. Houle, Rita Sadhvani
Comput. Networks4
2010 Quantifying Overprovisioning vs. Class-of-Service: Informing the Net Neutrality Debate
abstract
The benefit of Class-of-Service (CoS) is an important topic in the "Network Neutrality" debate. Proponents of network neutrality suggest that over-provisioning is a viable alternative to CoS. We quantify the extra capacity requirement for an over-provisioned classless (i.e., best-effort) network compared to a CoS network providing the same delay or loss performance for premium traffic. We first develop a link model that quantifies this Required Extra Capacity (REC). For realistic traffic distributions (e.g., long-range dependent), we find the REC using ns-2 simulations of the CoS and classless links. Our primary contribution is in using these link models to quantify the REC for realistic network topologies under various scenarios including "closed loop" environments with traffic generated by TCP sources that adapt to the available capacity. We show that REC can be significant even when the proportion of premium traffic requiring performance assurances is small, a situation often considered benign for the over-provisioning alternative.
Murat Yuksel, K. K. Ramakrishnan, Shivkumar Kalyanaraman, Joseph D. Houle, Rita Sadhvani
ICCCN4
2008 Class-of-service in ip backbones: informing the network neutrality debate
abstract
The benefit of Class-of-Service (CoS) is an important topic in the "Network Neutrality" debate. Proponents of network neutrality suggest that over-provisioning is a viable alternative to CoS. We quantify the extra capacity requirement for an over-provisioned classless (i.e., best-effort) network compared to a CoS network providing the same delay or loss performance for premium traffic. We first develop a link model that quantifies this Required Extra Capacity (REC). For bursty and realistic traffic distributions, we find the REC using ns-2 simulation comparisons of the CoS and classless link cases. We use these link models to quantify the REC for realistic network topologies. We show that REC can be significant even when the proportion of premium traffic is small, a situation often considered benign for the over-provisioning alternative.
Murat Yuksel, K. K. Ramakrishnan, Shivkumar Kalyanaraman, Joseph D. Houle, Rita Sadhvani
SIGMETRICS4
2007 Value of Supporting Class-of-Service in IP Backbones
abstract
The desire or ability of an ISP to provide differentiated service is a current hotly debated topic. In this paper, we quantify the value of having differentiated service (i.e., class-of-service (CoS)) support in an IP backbone. We compare the capacity requirements of a Diffserv environment providing service for applications that require delay or loss assurances in comparison to a network that provides classless (i.e., best-effort) service and still has to meet the same performance assurances. Our modeling framework first develops a link model that quantifies the required extra capacity (REC) in order for a classless link to provide the same level of performance as experienced by premium class traffic passing through a fixed capacity CoS link. We develop the REC calculations for the cases when average delay or the average loss probability is the target performance goal with Poisson or Markov modulated Poisson process (MMPP) input traffic. Our primary contribution is in quantifying the value of the CoS support in a network setting.
Murat Yuksel, K. K. Ramakrishnan, Shivkumar Kalyanaraman, Joseph D. Houle, Rita Sadhvani
IWQoS4