Sciweavers

858 search results - page 45 / 172
» Sharing the Cost of a Capacity Network
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Pricing and Incentives in Peer-to-Peer Networks
—Peer-to-peer (P2P) networks offer a cost effective and easily deployable framework for sharing user-generated content. However, intrinsic incentive problems reside in P2P networ...
Jaeok Park, Mihaela van der Schaar
COCOON
2005
Springer
14 years 2 months ago
Share the Multicast Payment Fairly
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certa...
Weizhao Wang, Xiang-Yang Li, Zheng Sun
ACSAC
2006
IEEE
14 years 3 months ago
Covert and Side Channels Due to Processor Architecture
Information leakage through covert channels and side channels is becoming a serious problem, especially when these are enhanced by modern processor architecture features. We show ...
Zhenghong Wang, Ruby B. Lee
INFOCOM
2010
IEEE
13 years 7 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
DAM
2007
78views more  DAM 2007»
13 years 9 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin