Abstract A sharing community prospers when participation and contribution are both high. We sugge... more Abstract A sharing community prospers when participation and contribution are both high. We suggest the two, while being related decisions every peer makes, should be given separate rational bases. Considered as such, a basic issue is the viability of club formation, which necessitates the modelling of two major sources of heterogeneity, namely, peers and shared content.
Classifying network traffic according to its applications is important to a broad range of networ... more Classifying network traffic according to its applications is important to a broad range of network areas. Since new applications, especially P2P applications, no longer use well-known fixed port numbers, the native port-based traffic classification technique has become much less effective. In this paper, we propose a novel approach to identify P2P traffic by leveraging the data transfer behavior of P2P applications. The behavior investigated in the paper is that downloaded data from a P2P host will be uploaded to other hosts later.
Network coding has become a prominent approach to improve throughput of wireless networks. Howeve... more Network coding has become a prominent approach to improve throughput of wireless networks. However, most of work in the literature concentrates mainly on 802.11-like random access networks. New technologies such as OFDMA (orthogonal frequency division multiple access), offer new opportunities for employing network coding. This paper considers how to apply the practical network coding scheme in OFDMA relay networks via cross-layer optimization.
Dynamic spectrum sharing is a promising technology to improve spectrum utilization in future wire... more Dynamic spectrum sharing is a promising technology to improve spectrum utilization in future wireless networks. The flexible spectrum management provides new opportunities for licensed primary user and unlicensed secondary users to reallocate the spectrum resource efficiently. In this paper, we present an oligopoly pricing framework for dynamic spectrum allocation in which the primary users sell excessive spectrum to the secondary users for monetary return.
Abstract: Popular peer to peer streaming media systems such as PPLive and UUSee rely on periodic ... more Abstract: Popular peer to peer streaming media systems such as PPLive and UUSee rely on periodic buffer-map exchange between peers for proper operation. The buffer-map exchange contains redundant information which causes non-negligible overhead. In this paper we present a theoretical framework to study how the overhead can be lowered.
Abstract: In this paper, we explore what\ emph {network economics} is all about, focusing on the ... more Abstract: In this paper, we explore what\ emph {network economics} is all about, focusing on the interesting topics brought about by the Internet. Our intent is make this a brief survey, useful as an outline for a course on this topic, with an extended list of references. We try to make it as intuitive and readable as possible. We also deliberately try to be critical at times, and hope our interpretation of the topic will lead to interests for further discussions by those doing research in the same field.
Abstract Traditional video-on-demand (VoD) systems rely purely on servers to stream video content... more Abstract Traditional video-on-demand (VoD) systems rely purely on servers to stream video content to clients, which does not scale. In recent years, peer-to-peer assisted VoD (P2P VoD) has proven to be practical and effective. In P2P VoD, each peer contributes some storage to store videos (or segments of videos) to help the video server.
[Docs] [txt|pdf] [Tracker] [Email] [Diff1] [Diff2] [Nits] Versions: 00 01 PPSP K. Wu Internet Dra... more [Docs] [txt|pdf] [Tracker] [Email] [Diff1] [Diff2] [Nits] Versions: 00 01 PPSP K. Wu Internet Draft Z. Lei Intended status: BCP D. Chiu Expires: April 2011 ASTRI October 18, 2010 P2P Layered Streaming for Heterogeneous Networks in PPSP draft-wu-ppsp-p2p-layered- streaming-01.txt Status of this Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
Abstract We consider a P2P-assisted content storage and delivery system to support a streaming Vi... more Abstract We consider a P2P-assisted content storage and delivery system to support a streaming Video-on-Demand (VoD) service. In this system, the peers are part of the service provider (eg set-top boxes) with limited storage space. Servers with ample storage and bandwidth are deployed to guarantee the availability and quality, but it is desirable to minimize the server utilization to reduce costs.
Abstract In this paper, we consider a central problem in P2P content distribution: given a set of... more Abstract In this paper, we consider a central problem in P2P content distribution: given a set of neighboring peers connected to each other to exchange content, how they can optimally negotiate the rate in helping each other so as to achieve maximum overall throughput and minimize the content server's load. We call this the “load balancing problem” of a P2P system.
Abstract Recent works show conflicting results: network capacity may increase or decrease with hi... more Abstract Recent works show conflicting results: network capacity may increase or decrease with higher transmission power under different scenarios. In this work, we want to understand this paradox.
Abstract. Due to the significant increase of peer-to-peer (P2P) traffic in the past few years, mo... more Abstract. Due to the significant increase of peer-to-peer (P2P) traffic in the past few years, more attentions are put on designing effective methodologies of monitoring and identifying P2P traffic. In this paper, we propose a novel approach to measure and discover the special characteristics of P2P applications, the periodic behaviors, from the packet traces. We call this the “periodic behavioral spectrum”(PBS) of P2P applications.
Abstract: In considering the college admissions problem, almost fifty years ago, Gale and Shapley... more Abstract: In considering the college admissions problem, almost fifty years ago, Gale and Shapley came up with a simple abstraction based on preferences of students and colleges. They introduced the concept of stability and optimality; and proposed the deferred acceptance (DA) algorithm that is proven to lead to a stable and optimal solution. This algorithm is simple and computationally efficient.
Abstract In this paper, we compare the maximum achieveable throughput using network coding with r... more Abstract In this paper, we compare the maximum achieveable throughput using network coding with routing in P2P networks. Our analysis is based on a simple star network where there is no multicast and network coding can only be applied at the peers. Under the idealized assumption that there is perfect information to realize optimal routing, this model captures the essential elements of a P2P network, yet allows simple analysis for what can be achieved by network coding and by routing respectively.
Abstract In this paper, we propose to model the dynamics of BitTorrent (BT) P2P file sharing syst... more Abstract In this paper, we propose to model the dynamics of BitTorrent (BT) P2P file sharing systems using the stochastic differential equation method. Unlike previous approach, our method can capture more realistic network environment and peers behavior. Closed-form solutions of various performance measures such as the average number of downloaders, seeders, the system throughput and file downloading time are derived.
Abstract: Recent development of peer-to-peer (P2P) services (eg streaming, file sharing, and stor... more Abstract: Recent development of peer-to-peer (P2P) services (eg streaming, file sharing, and storage) systems introduces a new type of queue systems not studied before. In these new systems, both job and server arrive and depart randomly. The server dynamics may or may not correlate to the job dynamics. Motivated by these observations, we develop queuing models for P2P service systems and a taxonomy for different variations of these queueing models.
ABSTRACT We consider the following advertisement problem in social networks. Given a fixed advert... more ABSTRACT We consider the following advertisement problem in social networks. Given a fixed advertisement investment (eg, provide free samples to small number of users), a company needs to determine the probability that users of a social network will eventually purchase the product. In this paper, we model social networks as scalefree graphs (with or without high clustering coefficient). We then characterize and model various influence mechanisms that govern the influence spreading in large scale social networks.
Abstract Sponsored search mechanisms have drawn much attention from both academic community and i... more Abstract Sponsored search mechanisms have drawn much attention from both academic community and industry in recent years since the seminal papers of [3] and [4]. However, most of the existing literature concentrates on the mechanism design and analysis within the scope of only one search engine in the market. In this paper we propose a mathematical framework for modeling the interaction of publishers, advertisers and end users in a competitive market.
Abstract Analyzing transport layer operation and enhancing its performance over multihop ad hoc n... more Abstract Analyzing transport layer operation and enhancing its performance over multihop ad hoc networks have attracted a lot of attentions. Although the fundamental reasons for the performance degradation of TCP have been studied for many years, the tight coupling between transport layer and the wireless MAC layer is still not well understood. In this paper, we focus on the interactions between the hidden nodes and network congestion.
Abstract A sharing community prospers when participation and contribution are both high. We sugge... more Abstract A sharing community prospers when participation and contribution are both high. We suggest the two, while being related decisions every peer makes, should be given separate rational bases. Considered as such, a basic issue is the viability of club formation, which necessitates the modelling of two major sources of heterogeneity, namely, peers and shared content.
Classifying network traffic according to its applications is important to a broad range of networ... more Classifying network traffic according to its applications is important to a broad range of network areas. Since new applications, especially P2P applications, no longer use well-known fixed port numbers, the native port-based traffic classification technique has become much less effective. In this paper, we propose a novel approach to identify P2P traffic by leveraging the data transfer behavior of P2P applications. The behavior investigated in the paper is that downloaded data from a P2P host will be uploaded to other hosts later.
Network coding has become a prominent approach to improve throughput of wireless networks. Howeve... more Network coding has become a prominent approach to improve throughput of wireless networks. However, most of work in the literature concentrates mainly on 802.11-like random access networks. New technologies such as OFDMA (orthogonal frequency division multiple access), offer new opportunities for employing network coding. This paper considers how to apply the practical network coding scheme in OFDMA relay networks via cross-layer optimization.
Dynamic spectrum sharing is a promising technology to improve spectrum utilization in future wire... more Dynamic spectrum sharing is a promising technology to improve spectrum utilization in future wireless networks. The flexible spectrum management provides new opportunities for licensed primary user and unlicensed secondary users to reallocate the spectrum resource efficiently. In this paper, we present an oligopoly pricing framework for dynamic spectrum allocation in which the primary users sell excessive spectrum to the secondary users for monetary return.
Abstract: Popular peer to peer streaming media systems such as PPLive and UUSee rely on periodic ... more Abstract: Popular peer to peer streaming media systems such as PPLive and UUSee rely on periodic buffer-map exchange between peers for proper operation. The buffer-map exchange contains redundant information which causes non-negligible overhead. In this paper we present a theoretical framework to study how the overhead can be lowered.
Abstract: In this paper, we explore what\ emph {network economics} is all about, focusing on the ... more Abstract: In this paper, we explore what\ emph {network economics} is all about, focusing on the interesting topics brought about by the Internet. Our intent is make this a brief survey, useful as an outline for a course on this topic, with an extended list of references. We try to make it as intuitive and readable as possible. We also deliberately try to be critical at times, and hope our interpretation of the topic will lead to interests for further discussions by those doing research in the same field.
Abstract Traditional video-on-demand (VoD) systems rely purely on servers to stream video content... more Abstract Traditional video-on-demand (VoD) systems rely purely on servers to stream video content to clients, which does not scale. In recent years, peer-to-peer assisted VoD (P2P VoD) has proven to be practical and effective. In P2P VoD, each peer contributes some storage to store videos (or segments of videos) to help the video server.
[Docs] [txt|pdf] [Tracker] [Email] [Diff1] [Diff2] [Nits] Versions: 00 01 PPSP K. Wu Internet Dra... more [Docs] [txt|pdf] [Tracker] [Email] [Diff1] [Diff2] [Nits] Versions: 00 01 PPSP K. Wu Internet Draft Z. Lei Intended status: BCP D. Chiu Expires: April 2011 ASTRI October 18, 2010 P2P Layered Streaming for Heterogeneous Networks in PPSP draft-wu-ppsp-p2p-layered- streaming-01.txt Status of this Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
Abstract We consider a P2P-assisted content storage and delivery system to support a streaming Vi... more Abstract We consider a P2P-assisted content storage and delivery system to support a streaming Video-on-Demand (VoD) service. In this system, the peers are part of the service provider (eg set-top boxes) with limited storage space. Servers with ample storage and bandwidth are deployed to guarantee the availability and quality, but it is desirable to minimize the server utilization to reduce costs.
Abstract In this paper, we consider a central problem in P2P content distribution: given a set of... more Abstract In this paper, we consider a central problem in P2P content distribution: given a set of neighboring peers connected to each other to exchange content, how they can optimally negotiate the rate in helping each other so as to achieve maximum overall throughput and minimize the content server's load. We call this the “load balancing problem” of a P2P system.
Abstract Recent works show conflicting results: network capacity may increase or decrease with hi... more Abstract Recent works show conflicting results: network capacity may increase or decrease with higher transmission power under different scenarios. In this work, we want to understand this paradox.
Abstract. Due to the significant increase of peer-to-peer (P2P) traffic in the past few years, mo... more Abstract. Due to the significant increase of peer-to-peer (P2P) traffic in the past few years, more attentions are put on designing effective methodologies of monitoring and identifying P2P traffic. In this paper, we propose a novel approach to measure and discover the special characteristics of P2P applications, the periodic behaviors, from the packet traces. We call this the “periodic behavioral spectrum”(PBS) of P2P applications.
Abstract: In considering the college admissions problem, almost fifty years ago, Gale and Shapley... more Abstract: In considering the college admissions problem, almost fifty years ago, Gale and Shapley came up with a simple abstraction based on preferences of students and colleges. They introduced the concept of stability and optimality; and proposed the deferred acceptance (DA) algorithm that is proven to lead to a stable and optimal solution. This algorithm is simple and computationally efficient.
Abstract In this paper, we compare the maximum achieveable throughput using network coding with r... more Abstract In this paper, we compare the maximum achieveable throughput using network coding with routing in P2P networks. Our analysis is based on a simple star network where there is no multicast and network coding can only be applied at the peers. Under the idealized assumption that there is perfect information to realize optimal routing, this model captures the essential elements of a P2P network, yet allows simple analysis for what can be achieved by network coding and by routing respectively.
Abstract In this paper, we propose to model the dynamics of BitTorrent (BT) P2P file sharing syst... more Abstract In this paper, we propose to model the dynamics of BitTorrent (BT) P2P file sharing systems using the stochastic differential equation method. Unlike previous approach, our method can capture more realistic network environment and peers behavior. Closed-form solutions of various performance measures such as the average number of downloaders, seeders, the system throughput and file downloading time are derived.
Abstract: Recent development of peer-to-peer (P2P) services (eg streaming, file sharing, and stor... more Abstract: Recent development of peer-to-peer (P2P) services (eg streaming, file sharing, and storage) systems introduces a new type of queue systems not studied before. In these new systems, both job and server arrive and depart randomly. The server dynamics may or may not correlate to the job dynamics. Motivated by these observations, we develop queuing models for P2P service systems and a taxonomy for different variations of these queueing models.
ABSTRACT We consider the following advertisement problem in social networks. Given a fixed advert... more ABSTRACT We consider the following advertisement problem in social networks. Given a fixed advertisement investment (eg, provide free samples to small number of users), a company needs to determine the probability that users of a social network will eventually purchase the product. In this paper, we model social networks as scalefree graphs (with or without high clustering coefficient). We then characterize and model various influence mechanisms that govern the influence spreading in large scale social networks.
Abstract Sponsored search mechanisms have drawn much attention from both academic community and i... more Abstract Sponsored search mechanisms have drawn much attention from both academic community and industry in recent years since the seminal papers of [3] and [4]. However, most of the existing literature concentrates on the mechanism design and analysis within the scope of only one search engine in the market. In this paper we propose a mathematical framework for modeling the interaction of publishers, advertisers and end users in a competitive market.
Abstract Analyzing transport layer operation and enhancing its performance over multihop ad hoc n... more Abstract Analyzing transport layer operation and enhancing its performance over multihop ad hoc networks have attracted a lot of attentions. Although the fundamental reasons for the performance degradation of TCP have been studied for many years, the tight coupling between transport layer and the wireless MAC layer is still not well understood. In this paper, we focus on the interactions between the hidden nodes and network congestion.
Uploads
Papers by Dah Ming Chiu