<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Network and Service Management, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 4275028 </description>
		<year>2013</year>
		<month>May      </month>
		<day>16</day>
		<item>
			<title><![CDATA[Table of contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6478865]]></link>
			<description><![CDATA[Presents the cover/table of contents for this issue of the periodical.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6478865]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>c1</startPage>
			<endPage>c1</endPage>
			<fileSize>42</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Guest Editors' Introduction: Special Issue on Quality-of-Service]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6478866]]></link>
			<description><![CDATA[The papers in this special issue focus on quality of service in the network and services management sectors.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6478866]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>1</startPage>
			<endPage>2</endPage>
			<fileSize>171</fileSize>
			<authors><![CDATA[Lin, Bill;Sinha, Prasun;Xu, Jun;]]></authors>
		</item>
		<item>
			<title><![CDATA[Rake: Semantics Assisted Network-Based Tracing Framework]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6313581]]></link>
			<description><![CDATA[The ability to trace request execution paths is critical for diagnosing performance faults in large-scale distributed systems. Previous black-box and white-box approaches are either inaccurate or invasive. We present a novel semantics-assisted gray-box tracing approach, called Rake, which can accurately trace individual request by observing network traffic. Rake infers the causality between messages by identifying polymorphic IDs in messages according to application semantics. To make Rake universally applicable, we design a Rake language so that users can easily describe necessary semantics of their applications while reusing the core Rake component. We evaluate Rake using a few popular distributed applications, including web search, distributed computing cluster, content provider network, and online chatting. Our results demonstrate Rake is much more accurate than the black-box approaches while requiring no modification to OS/applications. In the CoralCDN (a content distributed network) experiments, Rake links messages with much higher accuracy than WAP5, a state-of-the-art black-box approach. In the Hadoop (a distributed computing cluster platform) experiments, Rake helps reveal several previously unknown issues that may lead to performance degradation, including a RPC (Remote Procedure Call) abusing problem.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6313581]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>3</startPage>
			<endPage>14</endPage>
			<fileSize>699</fileSize>
			<authors><![CDATA[Yao Zhao;Yinzhi Cao;Yan Chen;Ming Zhang;Goyal, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On Multiplexing Models for Independent Traffic Flows in Single- and Multi-Node Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6298751]]></link>
			<description><![CDATA[In packet switched networks, statistical multiplexing of independent variable bit rate flows achieves significant resource savings, i.e., N flows require considerably less than N times the resources needed for one flow. In this work, we explore statistical multiplexing using methods from the current stochastic network calculus, where we compare the accuracy of different analytical approaches. While these approaches are known to provide identical results for a single flow, we find significant differences if several independent flows are multiplexed. Recent results on the concatenation of nodes along a network path allow us to investigate both single- as well as multi-node networks with cross traffic. The analysis enables us to distinguish different independence assumptions between traffic flows at a single node as well as between cross traffic flows at consecutive nodes of a network path. We contribute insights into the scaling of end-to-end delay bounds in the number of nodes n of a network path under statistical independence. Our work is complemented by numerical applications, e.g., on access multiplexer dimensioning and traffic trunk management.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6298751]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>15</startPage>
			<endPage>28</endPage>
			<fileSize>725</fileSize>
			<authors><![CDATA[Rizk, A.;Fidler, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multi-Tiered, Burstiness-Aware Bandwidth Estimation and Scheduling for VBR Video Flows]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6407139]]></link>
			<description><![CDATA[The increasing demand for high-quality streaming video delivered to mobile clients necessitates efficient bandwidth utilization and allocation at not only the wireless channel but also the wired backhaul of broadband cellular networks. In this context, we propose techniques for increasing the link utilization and enhancing the quality-of-experience (QoE) for end users while multiplexing video streams over a wired link. For increasing the link utilization, we present a generic multi-tiered bandwidth estimation and scheduling scheme that can guarantee lower bounds on loss for flows at lower tiers. This scheme can be used for supporting heterogeneous loss classes, providing differentiated losses for different layers of video streams, or providing per-flow guarantees using lower aggregate bandwidth than schemes proposed in the literature. For enhancing the end-user QoE, we present a scheme for minimizing correlated losses and improving the smoothness of video quality by minimizing the maximum loss suffered by any logical unit of a stream and also the variability in loss across the length of the stream. In extensive simulations performed using video sources encoded in various formats, our multi-tiered scheme could lower the estimated bandwidth and improve statistical multiplexing gains by up to 25% with two and three classes and over 30% in the context of providing per-flow guarantees and differentiated loss for different layers. Our loss-minimization approach could lower the maximum loss by a factor of five and the loss variance by more than an order of magnitude.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6407139]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>29</startPage>
			<endPage>42</endPage>
			<fileSize>427</fileSize>
			<authors><![CDATA[Devi, U.C.;Kalle, R.;Kalyanaraman, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[QoS Guarantees and Service Differentiation for Dynamic Cloud Applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6298750]]></link>
			<description><![CDATA[Cloud elasticity allows dynamic resource provisioning in concert with actual application demands. Feedback control approaches have been applied with success to resource allocation in physical servers. However, cloud dynamics make the design of an accurate and stable resource controller challenging, especially when application-level performance is considered as the measured output. Application-level performance is highly dependent on the characteristics of workload and sensitive to cloud dynamics. To address these challenges, we extend a self-tuning fuzzy control (STFC) approach, originally developed for response time assurance in web servers to resource allocation in virtualized environments. We introduce mechanisms for adaptive output amplification and flexible rule selection in the STFC approach for better adaptability and stability. Based on the STFC, we further design a two-layer QoS provisioning framework, DynaQoS, that supports adaptive multi-objective resource allocation and service differentiation. We implement a prototype of DynaQoS on a Xen-based cloud testbed. Experimental results on representative server workloads show that STFC outperforms popular controllers such as Kalman filter, ARMA and, Adaptive PI in the control of CPU, memory, and disk bandwidth resources under both static and dynamic workloads. Further results with multiple control objectives and service classes demonstrate the effectiveness of DynaQoS in performance-power control and service differentiation.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6298750]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>43</startPage>
			<endPage>55</endPage>
			<fileSize>732</fileSize>
			<authors><![CDATA[Jia Rao;Yudi Wei;Jiayu Gong;Cheng-Zhong Xu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Real-World Empirical Studies on Multi-Channel Reliability and Spectrum Usage for Home-Area Sensor Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6307795]]></link>
			<description><![CDATA[Home area networks (HANs) consisting of wireless sensors have emerged as the enabling technology for important applications such as smart energy. These applications impose unique network management constraints, requiring low data rates but high network reliability in the face of unpredictable wireless environments. This paper presents two in-depth empirical studies on wireless channels in real homes, providing key design guidelines for meeting the network management constraints of HAN applications. The spectrum study analyzes spectrum usage in the 2.4 GHz band where HANs based on the IEEE 802.15.4 standard must coexist with existing wireless devices. We characterize the ambient wireless environment in six apartments through passive spectrum analysis across the entire 2.4 GHz band over seven days in each apartment. We find that the wireless conditions in these residential environments are much more complex and varied than in a typical office environment. Moreover, while 802.11 signals play a significant role in spectrum usage, there also exists non-negligible noise from non-802.11 devices. The multi-channel link study measures the reliability of different 802.15.4 channels through active probing with motes in ten apartments. We find that there is not always a persistently reliable channel over 24 hours, and that link reliability does not exhibit cyclic behavior at daily or weekly timescales. Nevertheless, reliability can be maintained through infrequent channel hopping, suggesting dynamic channel hopping as a key tool for meeting the network management requirements of HAN applications. Our empirical studies provide important guidelines and insights in designing HANs for residential environments.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6307795]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>56</startPage>
			<endPage>69</endPage>
			<fileSize>3071</fileSize>
			<authors><![CDATA[Mo Sha;Hackmann, G.;Chenyang Lu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Social Connections in User-Generated Content Video Systems: Analysis and Recommendation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6328214]]></link>
			<description><![CDATA[User-generated content (UGC) video systems by definition heavily depend on the input of their community of users and their social interactions for video diffusion and opinion sharing. Nevertheless, we show in this paper, through measurement and analysis of YouKu, the most popular UGC video system in China, that the social connectivity of its users is very low. These observations are consistent with what was reported about YouTube in previous works. As a UGC system can achieve a larger audience through improved connectivity, our findings motivate us to propose a mean to enhance the users' connectivity by taking benefit of friend recommendation. To this end, we assess two similarity metrics based on users' interests that are derived from their uploads and favorites tagging of videos, to evaluate the interest similarity between friends. The results consistently show that friends share to a great extent common interests. Two friend recommendation algorithms are then proposed. The algorithms use public information provided by users to suggest potential friends with similar interests as measured by the similarity metrics. Experiments on our gathered YouKu dataset demonstrate that the social connectivity can be greatly enhanced by our friend proposition set and that users can access a larger set of interesting videos through the recommendations.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6328214]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>70</startPage>
			<endPage>83</endPage>
			<fileSize>550</fileSize>
			<authors><![CDATA[Zhenyu Li;Jiali Lin;Salamatian, K.;Gaogang Xie;]]></authors>
		</item>
		<item>
			<title><![CDATA[Peer-Assisted Social Media Streaming with Social Reciprocity]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6317102]]></link>
			<description><![CDATA[Online video sharing and social networking are cross-pollinating rapidly in today's Internet: Online social network users are sharing more and more media contents among each other, while online video sharing sites are leveraging social connections among users to promote their videos. An intriguing development as it is, the operational challenge in previous video sharing systems persists, em i.e., the large server cost demanded for scaling of the systems. Peer-to-peer video sharing could be a rescue, only if the video viewers' mutual resource contribution has been fully incentivized and efficiently scheduled. Exploring the unique advantages of a social network based video sharing system, we advocate to utilize social reciprocities among peers with social relationships for efficient contribution incentivization and scheduling, so as to enable high-quality video streaming with low server cost. We exploit social reciprocity with two give-and-take ratios at each peer: (1) peer contribution ratio (em PCR), which evaluates the reciprocity level between a pair of social friends, and (2) system contribution ratio (em SCR), which records the give-and-take level of the user to and from the entire system. We design efficient peer-to-peer mechanisms for video streaming using the two ratios, where each user optimally decides which other users to seek relay help from and help in relaying video streams, respectively, based on combined evaluations of their social relationship and historical reciprocity levels. Our design achieves effective incentives for resource contribution, load balancing among relay peers, as well as efficient social-aware resource scheduling. We also discuss practical implementation and implement our design in a prototype social media sharing system. Our extensive evaluations based on PlanetLab experiments verify that high-quality large-scale social media sharing can be achieved with conservative server costs.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6317102]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>84</startPage>
			<endPage>94</endPage>
			<fileSize>656</fileSize>
			<authors><![CDATA[Zhi Wang;Chuan Wu;Lifeng Sun;Shiqiang Yang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Torrents on Twitter: Explore Long-Term Social Relationships in Peer-to-Peer Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6313582]]></link>
			<description><![CDATA[Peer-to-peer file sharing systems, most notably BitTorrent (BT), have achieved tremendous success among Internet users. Recent studies suggest that the long-term relationships among BT peers can be explored to enhance the downloading performance; for example, for re-sharing previously downloaded contents or for effectively collaborating among the peers. However, whether such relationships do exist in real world remains unclear. In this paper, we take a first step towards the real-world applicability of peers' long-term relationship through a measurement based study. We find that 95% peers cannot even meet each other again in the BT networks; therefore, most peers can hardly be organized for further cooperation. This result contradicts to the conventional understanding based on the observed daily arrival pattern in peer-to-peer networks. To better understand this, we revisit the arrival of BT peers as well as their long-range dependence. We find that the peers' arrival patterns are highly diverse; only a limited number of stable peers have clear self-similar and periodic daily arrivals patterns. The arrivals of most peers are, however, quite random with little evidence of long-range dependence. To better utilize these stable peers, we start to explore peers' long-term relationships in specific swarms instead of conventional BT networks. Fortunately, we find that the peers in Twitter-initialized torrents have stronger temporal locality, thus offering great opportunity for improving their degree of sharing. Our PlanetLab experiments further indicate that the incorporation of social relations remarkably accelerates the download completion time. The improvement remains noticeable even in a hybrid system with a small set of social friends only.]]></description>
			<pubDate><![CDATA[March  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6313582]]></guid>
			<volume>10</volume>
			<issue>1</issue>
			<startPage>95</startPage>
			<endPage>104</endPage>
			<fileSize>1399</fileSize>
			<authors><![CDATA[Haiyang Wang;Feng Wang;Jiangchuan Liu;Ke Xu;Di Wu;]]></authors>
		</item>
	</channel>
</rss>