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

Christopher Marty

dblp:25/6667 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

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

Systems, architecture and hardware · 2Computer networks · 2 · 2 first-author

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
Routing and switching · 30% Transport protocols and congestion control · 30% Network optimization and economics · 30%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › rate control
explicit rate control
0.112006
An Integrated Framework for Managing Best Effort Traffic in MPLS Networks · INFOCOM 2006
Network optimization and economics › fairness
max-min fair rate allocation
0.112006
An Integrated Framework for Managing Best Effort Traffic in MPLS Networks · INFOCOM 2006
Routing and switching
MPLS
0.112006
An Integrated Framework for Managing Best Effort Traffic in MPLS Networks · INFOCOM 2006
Internet architecture and protocols › resource reservation
RSVP
0.012006
An Integrated Framework for Managing Best Effort Traffic in MPLS Networks · INFOCOM 2006

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

weight proportional max-min fairness algorithm · 0.1simulation · 0.1
YearPublicationVenuePosition
2009 Online Risk Analytics on the Cloud
abstract
In todays turbulent market conditions, the ability to generate accurate and timely risk measures has become critical to operating successfully, and necessary for survival. Value-at-risk (VaR) is a market standard risk measure used by senior management and regulators to quantify the risk level of a firm's holdings. However, the time-critical nature and dynamic computational workloads of VaR applications, make it essential for computing infrastructures to handle bursts in computing and storage resources needs. This requires on-demand scalability, dynamic provisioning, and the integration of distributed resources. While emerging utility computing services and clouds have the potential for cost-effectively supporting such spikes in resource requirements, integrating clouds with computing platforms and data centers, as well as developing and managing applications to utilize the platform remains a challenge. In this paper, we focus on the dynamic resource requirements of online risk analytics applications and how they can be addressed by cloud environments. Specifically, we demonstrate how the CometCloud autonomic computing engine can support online multi-resolution VaR analytics using and integration of private and Internet cloud resources.
Hyunjoo Kim, Shivangi Chaudhari, Manish Parashar, Christopher Marty
CCGRID4
2009 Advanced risk analytics on the cell broadband engine
abstract
This paper explores the effectiveness of using the CBE platform for Value-at-Risk (VaR) calculations. Specifically, it focuses on the design, optimization and evaluation of pricing European and American stock options across Monte-Carlo VaR scenarios. This analysis is performed on two distinct platforms with CBE processors, i.e., IBM Q22 blade server and the Playstation3 gaming console.
Ciprian Docan, Manish Parashar, Christopher Marty
IPDPS3
2006 TERM: TCP Friendly Explicit Rate Congestion Control for MPLS Networks
abstract
In this paper we present a TCP friendly explicit rate congestion control mechanism for MPLS networks (TERM). The components of the TERM system include a method for using resource reservation protocol (RSVP) to signal explicit rate information, a weight proportional max-min (WPMM) algorithm that calculates weighted fair rates in O(l) time, and a priority based packet marking and queue management system. Simulations validate that, working in conjunction, TERM components increase throughput of TCP and LDP traffic while enforcing weighted fair rates. The unique TERM approach accomplishes this with minimal network and computational overhead.
Christopher Marty, Mohamed A. Ali
GLOBECOM1
2006 An Integrated Framework for Managing Best Effort Traffic in MPLS Networks
abstract
This paper presents a scalable and flexible system for explicit rate congestion control in multi-protocol label switched networks. Resource reservation protocol is used to signal explicit rate congestion control information for best effort label switched paths. We present a weight proportional max-min fair rate algorithm that works with the signaling mechanism to calculate differentiated fair rates in O(1) time. We propose a method for marking traffic that is above the explicit rate as less than best effort allowing bursty traffic to utilize excess capacity while ensuring all label switched paths get a fair allocation of bandwidth. Simulations are presented that show the effectiveness of the proposed system.
Christopher Marty, Mohamed A. Ali
INFOCOM1