Ion Gabriel Stoica | Amity University, Noida (original) (raw)

Uploads

Papers by Ion Gabriel Stoica

Proceedings of the 15th International Middleware Conference on - Middleware '14, 2014

Lecture Notes in Computer Science, 2003

Analysis and Modeling.- Network Characteristics: Modelling, Measurements, and Admission Control.-... more Analysis and Modeling.- Network Characteristics: Modelling, Measurements, and Admission Control.- Statistical Characterization for Per-hop QoS.- Performance Analysis of Server Sharing Collectives for Content Distribution.- An Approximation of the End-to-End Delay Distribution.- Resource Allocation and Admission Control.- Price-Based Resource Allocation in Wireless Ad Hoc Networks.- On Achieving Fairness in the Joint Allocation of Processing and Bandwidth Resources.- Distributed Admission Control for Heterogeneous Multicast with Bandwidth Guarantees.- Multimedia & Incentives.- Subjective Impression of Variations in Layer Encoded Videos.- A Moving Average Predictor for Playout Delay Control in VoIP.- To Play or to Control: A Game-Based Control-Theoretic Approach to Peer-to-Peer Incentive Engineering.- Dependability and Fault Tolerance.- Improving Dependability of Real-Time Communication with Preplanned Backup Routes and Spare Resource Pool.- Fault Tolerance in Networks with an Advance Reservation Service.- Routing.- Routing and Grooming in Two-Tier Survivable Optical Mesh Networks.- Fast Network Re-optimization Schemes for MPLS and Optical Networks.- HMP: Hotspot Mitigation Protocol for Mobile Ad hoc Networks.- Availability and Dependability.- Failure Insensitive Routing for Ensuring Service Availability.- Network Availability Based Service Differentiation.- Quality of Availability: Replica Placement for Widely Distributed Systems.- Web Services.- Using Latency Quantiles to Engineer QoS Guarantees for Web Services.- DotQoS - A QoS Extension for .NET Remoting.- Dynamic Resource Allocation for Shared Data Centers Using Online Measurements.- Rate-Based QoS.- Providing Deterministic End-to-End Fairness Guarantees in Core-Stateless Networks.- Per-domain Packet Scale Rate Guarantee for Expedited Forwarding.- On Achieving Weighted Service Differentiation: An End-to-End Perspective.- Storage.- Online Response Time Optimization of Apache Web Server.- A Practical Learning-Based Approach for Dynamic Storage Bandwidth Allocation.- CacheCOW: QoS for Storage System Caches.

AbstractThe rapid growth of the Internet has made IPv4 addresses a scarce resource. Today we wit... more AbstractThe rapid growth of the Internet has made IPv4 addresses a scarce resource. Today we witness two major trends to get around this problem. The first is to upgrade and deploy networks using IPv6; the second is to deploy net-works using reusable-IPv4 addresses. As a result, ...

We describe a new approach to implement proportional share resource allocation and to provide di ... more We describe a new approach to implement proportional share resource allocation and to provide di erent levels of service quality. We consider multiple clients that compete for a time-shared resource, and we associate to each client a certain amount of funds. At the ...

Dialysis & …, 1998

... successful kidney transplantation. Auteur(s) / Author(s). JOSEPH LJ (1) ; DESAI KB (1) ; MEHT... more ... successful kidney transplantation. Auteur(s) / Author(s). JOSEPH LJ (1) ; DESAI KB (1) ; MEHTA HJ (1) ; MEHTA MN (1 2) ; ALMEIDA AF (2) ; ACHARYA VN (2) ; SAMUEL AM (1) ; Affiliation(s) du ou des auteurs / Author(s) Affiliation(s). ...

Proc. of ACM SIGCOMM, 2001

To provide routing flexibility, that is, to accommodate vari- ous performance and policy goals, r... more To provide routing flexibility, that is, to accommodate vari- ous performance and policy goals, routing protocols (such as OSPF and EIGRP) include many complex knobs. Owing to this complexity, protocols today do not adequately satisfy their main goal—to provide connectivity between nodes in the face of failures and misconfigured nodes. In this paper, we ask the question of how one can design routing proto- cols that are flexible, yet provide connectivity in the face of failures and misconfigurations. To this end, we propose a dif- ferent routing paradigm that decouples the task of providing basic connectivity from sophisticated routing operations. We propose an underlying Basic Connectivity Routing Protocol (BCRP) that is robust to link failures and prevents miscon- figured nodes from arbitrarily subverting traffic. Routing can then be made flexible by layering sophisticated route selec- tion on top of BCRP; these protocols fall back to BCRP when failures are encountered.

USENIX Association, Mar 30, 2011

Matei Zaharia is a fifth year PhD student at UC Berkeley, working with Scott Shenker and Ion Sto... more Matei Zaharia is a fifth year PhD student at UC Berkeley, working with Scott Shenker and Ion Stoica on topics in computer systems, networks, cloud computing, and big data. He is also a committer on Apache Hadoop and Apache

Neural programs are highly accurate and structured policies that perform algorithmic tasks by con... more Neural programs are highly accurate and structured policies that perform algorithmic tasks by controlling the behavior of a computation mechanism. Despite the potential to increase the interpretability and the compositionality of the behavior of artificial agents, it remains difficult to learn from demonstrations neural networks that represent computer programs. The main challenges that set algorithmic domains apart from other imitation learning domains are the need for high accuracy, the involvement of specific structures of data, and the extremely limited observability. To address these challenges, we propose to model programs as Parametrized Hierarchical Procedures (PHPs). A PHP is a sequence of conditional operations, using a program counter along with the observation to select between taking an elementary action, invoking another PHP as a sub-procedure, and returning to the caller. We develop an algorithm for training PHPs from a set of supervisor demonstrations, only some of w...

Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization

Proceedings of the VLDB Endowment

Distributed storage employs replication to mask failures and improve availability. However, these... more Distributed storage employs replication to mask failures and improve availability. However, these systems typically exhibit a hard tradeoff between consistency and performance. Ensuring consistency introduces coordination overhead, and as a result the system throughput does not scale with the number of replicas. We present Harmonia, a replicated storage architecture that exploits the capability of new-generation programmable switches to obviate this tradeoff by providing near-linear scalability without sacrificing consistency. To achieve this goal, Harmonia detects read-write conflicts in the network, which enables any replica to serve reads for objects with no pending writes. Harmonia implements this functionality at line rate, thus imposing no performance overhead. We have implemented a prototype of Harmonia on a cluster of commodity servers connected by a Barefoot Tofino switch, and have integrated it with Redis. We demonstrate the generality of our approach by supporting a varie...

Proceedings of the 15th International Middleware Conference on - Middleware '14, 2014

Lecture Notes in Computer Science, 2003

Dialysis & …, 1998

Proc. of ACM SIGCOMM, 2001

USENIX Association, Mar 30, 2011

Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization

Proceedings of the VLDB Endowment