http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Youngmi Jin,Kesidis, George,Jinwoo Shin,Kocak, Fatih,Yung Yi IEEE 2015 IEEE/ACM transactions on networking Vol.23 No.6
<P>This paper considers a hybrid peer-to-peer (p2p) system, a dynamic distributed caching system with an authoritative server dispensing contents only if the contents fail to be found by searching an unstructured p2p system. We study the case when some peers may not be fully cooperative in the search process and examine the impact of various noncooperative behaviors in the aspect of scalability, more specifically average server load and average peer load as the peer population size increases. We categorize selfish peers into three classes: impatient peers that directly query the server without searching the p2p system, non-forwarders that refuse to forward query requests, and non-resolvers that refuse to share contents. It is shown that in the hybrid p2p system, impatient and/or non-forwarding behaviors prevent the system from scaling well because of the high server load, while the system scales well under the non-resolving selfish peers. Our study implies that the hybrid p2p system does not mandate an incentive mechanism for content sharing, which is in stark contrast to unstructured p2p systems, where incentivizing peers to share contents is known to be a key factor for the system's scalability.</P>
A Channel Aware MAC Protocol in an ALOHA Network with Selfish Users
Youngmi Jin,Kesidis, G.,Ju Wook Jang IEEE 2012 IEEE journal on selected areas in communications Vol.30 No.1
<P>We consider a game theoretic model incorporating channel state information into slotted ALOHA in a fading environment. Each user sets a threshold for her channel gain and sends a packet only when the channel gain is higher than the threshold at a given slot. This threshold is decided to maximize the net benefit of a user, utility minus power consumption. The asymptotic behaviors of the total throughput at a symmetric Nash equilibrium point are studied for fading and non-fading environments in a homogeneous system. It is shown that the total throughput in a fading environment increases as the number of users increases, while the total throughput in the simple classical slotted ALOHA decreases when users are sensitive enough to power consumption. Convergence to the symmetric Nash equilibrium is also studied.</P>
Diffusion Dynamics of Network Technologies With Bounded Rational Users: Aspiration-Based Learning
Youngmi Jin,Kesidis, G.,Ju Wook Jang IEEE 2013 IEEE/ACM transactions on networking Vol.21 No.1
<P>Recently, economic models have been proposed to study adoption dynamics of entrant and incumbent technologies motivated by the need for new network architectures to complement the current Internet. We propose new models of adoption dynamics of entrant and incumbent technologies among bounded rational users who choose a satisfying strategy rather than an optimal strategy based on aspiration-based learning. Two models of adoption dynamics are proposed according to the characteristics of aspiration level. The impacts of switching cost, the benefit from entrant and incumbent technologies, and the initial aspiration level on the adoption dynamics are investigated.</P>
Technique for Estimating the Number of Active Flows in High-Speed Networks
Sungwon Yi,Xidong Deng,George Kesidis,Chita R. Das 한국전자통신연구원 2008 ETRI Journal Vol.30 No.2
The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic. We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.