WorldCat Identities

Stoica, Ion 1965-

Overview
Works: 20 works in 90 publications in 1 language and 1,806 library holdings
Genres: Conference papers and proceedings  Academic theses 
Roles: Author, Author of introduction, Other, Editor
Publication Timeline
.
Most widely held works by Ion Stoica
Stateless core : a scalable approach for quality of service in the Internet : winning thesis of the 2001 ACM Doctoral Dissertation Competition by Ion Stoica( )

20 editions published between 2000 and 2005 in English and held by 971 WorldCat member libraries worldwide

This book is a revised version of the author's PhD thesis, which was selected as the winning thesis of the 2001 ACM Doctoral Dissertation Competition. Ion Stoica did his PhD work at Carnegie Mellon University with Hui Zhang as thesis adviser. The author addresses the most pressing and difficult problem facing the Internet community today: how to enhance the Internet to support rich functionalities, such as QoS and traffic management, while still maintaining the scalability and robustness properties embodied in the original Internet architecture. The monograph presents complete solutions including architectures, algorithms, and implementations dealing with fundamental problems of today's Internet: providing guaranteed services, differentiated services, and flow protection. Compared to existing solutions, Ion Stoica's solution eliminates the complex operations on both data and control paths in the network core. All in all, the research results presented in this monograph constitute one of the most important contributions to networking research in the past ten years
Quality of service-IWQoS 2003 : 11th International Workshop, Berkeley, CA, USA, June 2-4, 2003 : proceedings by IWQoS 2003( Book )

24 editions published in 2003 in English and held by 337 WorldCat member libraries worldwide

This book constitutes the refereed proceedings of the 10th International Workshop on Quality of Service, IWQoS 2003, held in Berkeley, CA, USA, in June 2003. The 27 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on analysis and modeling, resource allocation and admission control, multimedia and incentives, dependability and fault tolerance, routing, availability and dependability, Web services, rate-based QoS, and storage
Peer-to-peer systems II : second international workshop, IPTPS 2003, Berkeley, CA, USA, February 21-22, 2003 : revised paper by Frans Kaashoek( Book )

15 editions published in 2003 in English and held by 312 WorldCat member libraries worldwide

In very short time, peer-to-peer computing has evolved from an attractive new paradigm into an exciting and vibrant research field bringing together researchers from systems, networking, and theory. This book constitutes the thoroughly refereed post-proceedings of the Second International Workshop on Peer-to-Peer Systems, IPTPS 2003, held in Berkeley, CA, USA in February 2003. The 27 revised papers presented together with an introductory summary of the discussions at the workshop were carefully selected during two rounds of reviewing and revision from initially 166 submissions. The papers are organized in topical sections on experience with P2P; theory and algorithms, P2P in a broader perspective; incentive and fairness; new DHT designs; naming, indexing, and searching; file sharing; and networking and applications
Proceedings of the 3rd USENIX conference on Hot topics in cloud computing by Ion Stoica( )

3 editions published in 2011 in English and held by 44 WorldCat member libraries worldwide

Peer-to-Peer Systems II Second International Workshop, IPTPS 2003, Berkeley, CA, USA, February 21-22, 2003. Revised Papers by Frans Kaashoek( )

2 editions published in 2003 in English and held by 41 WorldCat member libraries worldwide

Quality of Service -- IWQoS 2003 11th International Workshop Berkeley, CA, USA, June 2-4, 2003 Proceedings by Kevin Jeffay( )

1 edition published in 2003 in English and held by 31 WorldCat member libraries worldwide

Structured peer-to-peer systems : fundamentals of hierarchical organization, routing, scaling, and security by Dmitry Korzun( )

1 edition published in 2012 in English and held by 25 WorldCat member libraries worldwide

The field of structured P2P systems has seen fast growth upon the introduction of Distributed Hash Tables (DHTs) in the early 2000s. The first proposals, including Chord, Pastry, Tapestry, were gradually improved to cope with scalability, locality and security issues. By utilizing the processing and bandwidth resources of end users, the P2P approach enables high performance of data distribution which is hard to achieve with traditional client-server architectures. The P2P computing community is also being actively utilized for software updates to the Internet, P2PSIP VoIP, video-on-demand, an
Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation by Symposium on Networked Systems Design and Implementation( )

2 editions published in 2014 in English and held by 11 WorldCat member libraries worldwide

A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services by Ion Stoica( Book )

4 editions published in 1997 in English and held by 5 WorldCat member libraries worldwide

In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed real-time services with decoupled delay (priority) and bandwidth allocation. We extend the service curve based QoS model, which defines both delay and bandwidth requirements of a class, to include fairness, which is important for the integration of real-time and hierarchical link-sharing services. The resulting Fair Service Curve link-sharing model formalizes the goals of link-sharing and real-time services and exposes the fundamental tradeoffs between these goals. In particular, with decoupled delay and bandwidth allocation, it is impossible to simultaneously provide guaranteed real-time service and achieve perfect link-sharing. We propose a novel scheduling algorithm called Hierarchical Fair Service Curve (H-FSC) that approximates the model closely and efficiently. The algorithm always guarantees the performance for leaf classes, thus ensures real-time services, while minimizing the discrepancy between the actual services provided to the interior classes and the services defined by the Fair Service Curve link-sharing model. We have implemented the H-FSC scheduler in the NetBSD environment. By performing simulation and measurement experiments, we evaluate the link-sharing and real-time performances of H-FSC, and determine the computation overhead
Building a flexible and efficient routing infrastructure : need and challenges by Karthik Lakshminarayanan( Book )

1 edition published in 2003 in English and held by 4 WorldCat member libraries worldwide

Core-stateless fair queueing : achieving approximately fair bandwidth allocations in high speed networks by Ion Stoica( Book )

3 editions published in 1998 in English and held by 4 WorldCat member libraries worldwide

Abstract: "Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. In this paper, we propose an architecture that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. We apply this approach to an island of routers -- that is, a contiguous region of the network -- and we distinguish between edge routers and core routers. Edge routers maintain per flow state; they estimate the incoming rate of each flow and insert a label into each packet header based on this estimate. Core routers maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the router. We call the scheme Core-Stateless Fair Queueing. We present simulations and analysis on the performance of this approach, and discuss an alternate approach."
REUNITE : a recursive unicast approach to multicast by Ion Stoica( Book )

3 editions published in 2000 in English and held by 4 WorldCat member libraries worldwide

Abstract: "We propose a new multicast protocol called REUNITE. The key idea of REUNITE is to use recursive unicast trees to implement multicast service. REUNITE does not use class D IP addresses. Instead, both group identification and data forwarding are based on unicast IP addresses. Compared with existing IP multicast protocols, REUNITE has several unique properties. First, only routers that are acting as multicast tree branching points for a group need to keep multicast forwarding state of the group. All other non-branching-point routers simply forward data packets by unicast routing. In addition, REUNITE can be incrementally deployed in the sense that it works even if only a subset of the routers implement the protocol. Furthermore, REUNITE supports load balancing and graceful degradation such that when a router does not have resources (forwarding table entry, buffer space, processing power) to support additional multicast groups, the branching can be automatically migrated to other less loaded routers. Finally, sender access control can be easily supported in REUNITE. Although in REUNITE, routers in a multicast tree still need to maintain control path state, we discuss a variant of REUNITE in which routers do not need to maintain any control path state. However, this is achieved at the expense of having two additional protocol message types, and a slightly more complex protocol."
Providing guaranteed services without per flow management by Ion Stoica( Book )

3 editions published between 1998 and 1999 in English and held by 3 WorldCat member libraries worldwide

Existing approaches for providing guaranteed services require routers to manage per flow states and perform per flow operations. Such a stateful network architecture is less scalable and robust than stateless network architectures like the original IP and the recently proposed Diffserv. However, services provided with current stateless solutions, Diffserv included, have lower flexibility, utilization, and/or assurance level as compared to the services that can be provided with per flow mechanisms. In this paper, we propose techniques that do not require per flow management (either control or data planes) at core routers, but can implement guaranteed services with levels of flexibility, utilization, and assurance similar to those that can be provided with per flow mechanisms. In this way we can simultaneously achieve high quality of service, high scalability and robustness. The key technique we use is called Dynamic Packet State (DPS), which provides a lightweight and robust mechanism tor routers to coordinate actions and implement distributed algorithms. We present an implementation of the proposed algorithms that has minimum incompatibility with IPv4
Packet fair queueing algorithms for wireless networks with location-dependent errors by T. S. Eugene Ng( Book )

2 editions published in 2000 in English and held by 3 WorldCat member libraries worldwide

Abstract: "While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead to situations in which a session receives significantly less service than it is supposed to, while another receives more. This results in large discrepancies between the sessions' virtual times, making it difficult to provide both delay-guarantees and fairness simultaneously. Our contribution is twofold. First, we identify a set of properties, called Channel-condition Independent Fair (CIF), that a Packet Fair Queueing algorithm should have in a wireless environment: (1) delay and throughput guarantees for error-free sessions, (2) long term fairness for error sessions, (3) short term fairness for error-free sessions, and (4) graceful degradation for sessions that have received excess service. Second, we present a methodology for adapting PFQ algorithms for wireless networks and we apply this methodology to derive a novel algorithm based on Start-time Fair Queueing, called Channel-condition Independent packet Fair Queueing (CIF-Q), that achieves all the above properties. To evaluate the algorithm we provide both theoretical analysis and simulation results."
The cost of inconsistency in DHTs by Shelley Q Zhuang( Book )

1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide

A scalable and robust solution for bandwidth allocation by Sridhar Machiraju( Book )

1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide

Routing as a service by Karthik Lakshminarayanan( Book )

1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide

An overlay MAC layer for 802.11 networks by Ananth Rajagopala Rao( Book )

1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide

MultiChord : a resilient namespace management protocol by Nancy A Lynch( Book )

1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide

Books, libraries, information : selected papers : 1( Book )

1 edition published in 1982 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.43 (from 0.19 for Stateless ... to 0.93 for Books, lib ...)

Stateless core : a scalable approach for quality of service in the Internet : winning thesis of the 2001 ACM Doctoral Dissertation Competition
Covers
Quality of service-IWQoS 2003 : 11th International Workshop, Berkeley, CA, USA, June 2-4, 2003 : proceedingsPeer-to-peer systems II : second international workshop, IPTPS 2003, Berkeley, CA, USA, February 21-22, 2003 : revised paper
Alternative Names
Ion Stoica Amerikaans informaticus

Ion Stoica amerikansk-rumænsk datalog

Ion Stoica (informatician)

Ion Stoica informaticien américain

Languages
English (90)