<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/">
	<channel>
		<title><![CDATA[baijia - papers and notes - All Forums]]></title>
		<link>http://baijia.info/</link>
		<description><![CDATA[baijia - papers and notes - http://baijia.info]]></description>
		<pubDate>Thu, 20 Jun 2013 00:32:05 +0000</pubDate>
		<generator>MyBB</generator>
		<item>
			<title><![CDATA[Jestes:Building wavelet histograms on large data in MapReduce.VLDB11]]></title>
			<link>http://baijia.info/showthread.php?tid=2042</link>
			<pubDate>Sun, 16 Jun 2013 22:32:47 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=2042</guid>
			<description><![CDATA[Jeffrey Jestes, Ke Yi, and Feifei Li. 2011. Building wavelet histograms on large data in MapReduce. Proc. VLDB Endow. 5, 2 (October 2011), 109-120. <br />
<br />
PDF from VLDB.org: <a href="http://vldb.org/pvldb/vol5/p109_jeffreyjestes_vldb2012.pdf" target="_blank">http://vldb.org/pvldb/vol5/p109_jeffreyj...http://vldb.org/pvldb/vol5/p109_jeffreyjestes_vl</a><br />
<br />
@article{jestes11building<br />
 author = {Jestes, Jeffrey and Yi, Ke and Li, Feifei},<br />
 title = {Building wavelet histograms on large data in MapReduce},<br />
 journal = {Proc. VLDB Endow.},<br />
 issue_date = {October 2011},<br />
 volume = {5},<br />
 number = {2},<br />
 month = oct,<br />
 year = {2011},<br />
 issn = {2150-8097},<br />
 pages = {109--120},<br />
 numpages = {12},<br />
}]]></description>
			<content:encoded><![CDATA[Jeffrey Jestes, Ke Yi, and Feifei Li. 2011. Building wavelet histograms on large data in MapReduce. Proc. VLDB Endow. 5, 2 (October 2011), 109-120. <br />
<br />
PDF from VLDB.org: <a href="http://vldb.org/pvldb/vol5/p109_jeffreyjestes_vldb2012.pdf" target="_blank">http://vldb.org/pvldb/vol5/p109_jeffreyj...http://vldb.org/pvldb/vol5/p109_jeffreyjestes_vl</a><br />
<br />
@article{jestes11building<br />
 author = {Jestes, Jeffrey and Yi, Ke and Li, Feifei},<br />
 title = {Building wavelet histograms on large data in MapReduce},<br />
 journal = {Proc. VLDB Endow.},<br />
 issue_date = {October 2011},<br />
 volume = {5},<br />
 number = {2},<br />
 month = oct,<br />
 year = {2011},<br />
 issn = {2150-8097},<br />
 pages = {109--120},<br />
 numpages = {12},<br />
}]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[carnot]]></title>
			<link>http://baijia.info/showthread.php?tid=2039</link>
			<pubDate>Sat, 15 Jun 2013 21:13:06 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=2039</guid>
			<description><![CDATA[10.1.0.9]]></description>
			<content:encoded><![CDATA[10.1.0.9]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[gvm1e2]]></title>
			<link>http://baijia.info/showthread.php?tid=2038</link>
			<pubDate>Sat, 15 Jun 2013 21:01:11 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=2038</guid>
			<description><![CDATA[vm-10.1.0.59 at carnot. It is an offline general VM.<br />
<br />
2 VCPUs, 2GB memory, 20GB space for now.<br />
Physical machine: carnot<br />
It can be connected by &#36; ssh user_name@newton.baijia.info -p 22059]]></description>
			<content:encoded><![CDATA[vm-10.1.0.59 at carnot. It is an offline general VM.<br />
<br />
2 VCPUs, 2GB memory, 20GB space for now.<br />
Physical machine: carnot<br />
It can be connected by &#36; ssh user_name@newton.baijia.info -p 22059]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Kumagai:The smartest, greenest grid.SPEC13]]></title>
			<link>http://baijia.info/showthread.php?tid=1938</link>
			<pubDate>Fri, 14 Jun 2013 09:20:18 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1938</guid>
			<description><![CDATA[Jean Kumagai. The smartest, greenest grid. IEEE Spectrum, May 2013.]]></description>
			<content:encoded><![CDATA[Jean Kumagai. The smartest, greenest grid. IEEE Spectrum, May 2013.]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Peter Fairley:Germany jump-starts the supergrid.SPEC13]]></title>
			<link>http://baijia.info/showthread.php?tid=1937</link>
			<pubDate>Fri, 14 Jun 2013 09:19:10 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1937</guid>
			<description><![CDATA[Peter Fairley. Germany jump-starts the supergrid. IEEE Spectrum May, 2013.]]></description>
			<content:encoded><![CDATA[Peter Fairley. Germany jump-starts the supergrid. IEEE Spectrum May, 2013.]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Ye:DCUDP:A novel UDP for reliable transmission in data center networks.THESIS12]]></title>
			<link>http://baijia.info/showthread.php?tid=1853</link>
			<pubDate>Fri, 17 May 2013 16:49:02 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1853</guid>
			<description><![CDATA[Lisa Ye. DCUDP: A novel UDP for reliable transmission in data center networks. MPhil Thesis, 2012.<br />
<br />
Citation ID: ye12dcudp.]]></description>
			<content:encoded><![CDATA[Lisa Ye. DCUDP: A novel UDP for reliable transmission in data center networks. MPhil Thesis, 2012.<br />
<br />
Citation ID: ye12dcudp.]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[kapoor: Chronos: Predictable Low Latency for Data Center Applications (SOCC '12)]]></title>
			<link>http://baijia.info/showthread.php?tid=1836</link>
			<pubDate>Wed, 15 May 2013 21:54:21 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1836</guid>
			<description><![CDATA[Rishi Kapoor, George Porter, Malveeka Tewari, Geoffrey M. Voelker, and Amin Vahdat, Chronos: Predictable Low Latency for Data Center Applications. In Proceedings of the ACM Symposium on Cloud Computing (SOCC), San Jose, CA, October 2012. <br />
<br />
Full paper at <a href="http://www.socc2012.org/s9-kapoor.pdf" target="_blank">http://www.socc2012.org/s9-kapoor.pdf</a> or <a href="http://cseweb.ucsd.edu/~voelker/pubs/chronos-socc12.pdf" target="_blank">http://cseweb.ucsd.edu/~voelker/pubs/chronos-socc12.pdf</a>]]></description>
			<content:encoded><![CDATA[Rishi Kapoor, George Porter, Malveeka Tewari, Geoffrey M. Voelker, and Amin Vahdat, Chronos: Predictable Low Latency for Data Center Applications. In Proceedings of the ACM Symposium on Cloud Computing (SOCC), San Jose, CA, October 2012. <br />
<br />
Full paper at <a href="http://www.socc2012.org/s9-kapoor.pdf" target="_blank">http://www.socc2012.org/s9-kapoor.pdf</a> or <a href="http://cseweb.ucsd.edu/~voelker/pubs/chronos-socc12.pdf" target="_blank">http://cseweb.ucsd.edu/~voelker/pubs/chronos-socc12.pdf</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Plot task lifetime]]></title>
			<link>http://baijia.info/showthread.php?tid=1729</link>
			<pubDate>Fri, 10 May 2013 09:50:02 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1729</guid>
			<description><![CDATA[We provide a script to plot the task execution lifetime graph from the scheduler log.<br />
<br />
The script is under utils/plot-task-lifetime.sh in the l0sys repository (can be get through the Cod tool: <a href="http://baijia.info/showthread.php?tid=1541)" target="_blank">http://baijia.info/showthread.php?tid=1541)</a><br />
<br />
This script will invoke gnuplot to plot the figure, so make sure that gnuplot is installed on your system.<br />
<br />
After finishing a program on L0, first collect the scheduler's log (scheduler.log) under the result directory printed out by the `am` script.<br />
<br />
The plot the task lifetime graph by<br />
<br />
&#36; sh plot-task-lifetime.sh scheduler.log<br />
<br />
A eps figure named figure.eps will be generated after the script succeed.]]></description>
			<content:encoded><![CDATA[We provide a script to plot the task execution lifetime graph from the scheduler log.<br />
<br />
The script is under utils/plot-task-lifetime.sh in the l0sys repository (can be get through the Cod tool: <a href="http://baijia.info/showthread.php?tid=1541)" target="_blank">http://baijia.info/showthread.php?tid=1541)</a><br />
<br />
This script will invoke gnuplot to plot the figure, so make sure that gnuplot is installed on your system.<br />
<br />
After finishing a program on L0, first collect the scheduler's log (scheduler.log) under the result directory printed out by the `am` script.<br />
<br />
The plot the task lifetime graph by<br />
<br />
&#36; sh plot-task-lifetime.sh scheduler.log<br />
<br />
A eps figure named figure.eps will be generated after the script succeed.]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Huang:Erasure coding in Windows Azure storage.ATC12]]></title>
			<link>http://baijia.info/showthread.php?tid=1726</link>
			<pubDate>Wed, 08 May 2013 17:40:26 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1726</guid>
			<description><![CDATA[Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, and Sergey Yekhanin. 2012. Erasure coding in windows azure storage. In Proceedings of the 2012 USENIX conference on Annual Technical Conference (USENIX ATC'12).<br />
<br />
USENIX entry: <a href="https://www.usenix.org/conference/usenixfederatedconferencesweek/erasure-coding-windows-azure-storage" target="_blank">https://www.usenix.org/conference/usenix...https://www.usenix.org/conference/usenixfederatedconferencesweek/erasure-coding-windows-azu</a><br />
<br />
PDF from USENIX: <a href="https://www.usenix.org/system/files/conference/atc12/atc12-final181_0.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/atc12/atc12-fina</a>]]></description>
			<content:encoded><![CDATA[Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, and Sergey Yekhanin. 2012. Erasure coding in windows azure storage. In Proceedings of the 2012 USENIX conference on Annual Technical Conference (USENIX ATC'12).<br />
<br />
USENIX entry: <a href="https://www.usenix.org/conference/usenixfederatedconferencesweek/erasure-coding-windows-azure-storage" target="_blank">https://www.usenix.org/conference/usenix...https://www.usenix.org/conference/usenixfederatedconferencesweek/erasure-coding-windows-azu</a><br />
<br />
PDF from USENIX: <a href="https://www.usenix.org/system/files/conference/atc12/atc12-final181_0.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/atc12/atc12-fina</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Oggier:Self-repairing homomorphic codes for distributed storage systems.InfoCom11]]></title>
			<link>http://baijia.info/showthread.php?tid=1725</link>
			<pubDate>Wed, 08 May 2013 17:37:48 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1725</guid>
			<description><![CDATA[Frédérique Oggier, Anwitaman Datta. Self-repairing Homomorphic Codes for Distributed Storage Systems. The 30th IEEE International Conference on Computer Communications (Infocom 2011).]]></description>
			<content:encoded><![CDATA[Frédérique Oggier, Anwitaman Datta. Self-repairing Homomorphic Codes for Distributed Storage Systems. The 30th IEEE International Conference on Computer Communications (Infocom 2011).]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[VM Reservation System (VRS)]]></title>
			<link>http://baijia.info/showthread.php?tid=1720</link>
			<pubDate>Fri, 03 May 2013 23:42:02 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1720</guid>
			<description><![CDATA[The VM reservation system (VRS) can be accessed at <a href="http://baijia.info/booking" target="_blank">http://baijia.info/booking</a><br />
<br />
To login, use your baijia.info username and password. This also means that you need to register at baijia.info to access VRS.<br />
<br />
Users must make reservations to use the VMs, and the reservations should be requested sufficiently early (before the previous Saturday for the server usage in the following week) so that we can process it. Please be precise about the time in which you will use the VMs (e.g., night of Sept. 19, 2010 -- AM Sept. 20, 2010). A reservation is usually no more than 8 hours, and should not exceed a day. The same user shall not make reservations spanning more than two weeks. If you still need to use the VMs after the reservation time, make another reservation. When the reservation expires, the VMs will be terminated. Users can request to restart a VM if its image is still available. Please specify your research group and research project when making a reservation.<br />
<br />
All VMs/processes/threads are subject to termination without notice. When resources are stressed or important research tasks are ongoing, however, any VMs/processes/threads, including those approved in the VRS, may be terminated.<br />
<br />
The system is on a best-effort basis and there is no SLA (Service Level Agreement) guarantee. So, use the system as is, be prepared for interruptions and terminations (though it does not occur often), manage your applications well, back up your data surely, and have fun!<br />
<br />
Workflow<br />
---------<br />
A typical workflow is as follows for reserving a computing time slot.<br />
1. Visit <a href="http://baijia.info/booking/" target="_blank">http://baijia.info/booking/</a> , click the calendar to reach the day you would like to reserve time on, select in the "Host" (physical machine) and "VMs" (virtual machines) lists to locate the VM you would like to use, and click a time slot under the IP of the VM. Fill in information about the reservation, and submit the request.<br />
<br />
2. Wait until the request is approved. You can view the status of your request by clicking the time slots covered by your reservation request. After approval the "Approval status" changes to "Approved". Note that approval typically happens in the weekend. Hence, make the reservation ahead of time!<br />
<br />
3. ssh to the VMs through the IP with port forwarding.<br />
<br />
4. If there is a problem with a VM, you can click the reserved time slots under the VM, and use the "Start VM/Restart VM/Stop VM" links to start/restart/stop the VMs. Note that it takes about 5 minutes for the command to take effect.]]></description>
			<content:encoded><![CDATA[The VM reservation system (VRS) can be accessed at <a href="http://baijia.info/booking" target="_blank">http://baijia.info/booking</a><br />
<br />
To login, use your baijia.info username and password. This also means that you need to register at baijia.info to access VRS.<br />
<br />
Users must make reservations to use the VMs, and the reservations should be requested sufficiently early (before the previous Saturday for the server usage in the following week) so that we can process it. Please be precise about the time in which you will use the VMs (e.g., night of Sept. 19, 2010 -- AM Sept. 20, 2010). A reservation is usually no more than 8 hours, and should not exceed a day. The same user shall not make reservations spanning more than two weeks. If you still need to use the VMs after the reservation time, make another reservation. When the reservation expires, the VMs will be terminated. Users can request to restart a VM if its image is still available. Please specify your research group and research project when making a reservation.<br />
<br />
All VMs/processes/threads are subject to termination without notice. When resources are stressed or important research tasks are ongoing, however, any VMs/processes/threads, including those approved in the VRS, may be terminated.<br />
<br />
The system is on a best-effort basis and there is no SLA (Service Level Agreement) guarantee. So, use the system as is, be prepared for interruptions and terminations (though it does not occur often), manage your applications well, back up your data surely, and have fun!<br />
<br />
Workflow<br />
---------<br />
A typical workflow is as follows for reserving a computing time slot.<br />
1. Visit <a href="http://baijia.info/booking/" target="_blank">http://baijia.info/booking/</a> , click the calendar to reach the day you would like to reserve time on, select in the "Host" (physical machine) and "VMs" (virtual machines) lists to locate the VM you would like to use, and click a time slot under the IP of the VM. Fill in information about the reservation, and submit the request.<br />
<br />
2. Wait until the request is approved. You can view the status of your request by clicking the time slots covered by your reservation request. After approval the "Approval status" changes to "Approved". Note that approval typically happens in the weekend. Hence, make the reservation ahead of time!<br />
<br />
3. ssh to the VMs through the IP with port forwarding.<br />
<br />
4. If there is a problem with a VM, you can click the reserved time slots under the VM, and use the "Start VM/Restart VM/Stop VM" links to start/restart/stop the VMs. Note that it takes about 5 minutes for the command to take effect.]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Bowers:How to tell if your cloud files are vulnerable to drive crashes.CCS11]]></title>
			<link>http://baijia.info/showthread.php?tid=1718</link>
			<pubDate>Fri, 03 May 2013 17:25:31 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1718</guid>
			<description><![CDATA[Kevin D. Bowers, Marten van Dijk, Ari Juels, Alina Oprea, and Ronald L. Rivest. 2011. How to tell if your cloud files are vulnerable to drive crashes. In Proceedings of the 18th ACM conference on Computer and communications security (CCS '11). ACM, New York, NY, USA, 501-514.<br />
<br />
  *  *  *<br />
Based on assumptions on how data are replicated on multiple servers, the work helps verify whether some data are vulnerable to hard drive failures by measuring the access time and encoding data with erasure codes.<br />
  *  *  *<br />
<br />
ACM entry: <a href="http://doi.acm.org/10.1145/2046707.2046766" target="_blank">http://doi.acm.org/10.1145/2046707.2046766</a><br />
<br />
inproceedings{bowers11how,<br />
 author = {Bowers, Kevin D. and van Dijk, Marten and Juels, Ari and Oprea, Alina and Rivest, Ronald L.},<br />
 title = {How to tell if your cloud files are vulnerable to drive crashes},<br />
 booktitle = {Proceedings of the 18th ACM conference on Computer and communications security},<br />
 series = {CCS '11},<br />
 year = {2011},<br />
 isbn = {978-1-4503-0948-6},<br />
 location = {Chicago, Illinois, USA},<br />
 pages = {501--514},<br />
 numpages = {14},<br />
}]]></description>
			<content:encoded><![CDATA[Kevin D. Bowers, Marten van Dijk, Ari Juels, Alina Oprea, and Ronald L. Rivest. 2011. How to tell if your cloud files are vulnerable to drive crashes. In Proceedings of the 18th ACM conference on Computer and communications security (CCS '11). ACM, New York, NY, USA, 501-514.<br />
<br />
  *  *  *<br />
Based on assumptions on how data are replicated on multiple servers, the work helps verify whether some data are vulnerable to hard drive failures by measuring the access time and encoding data with erasure codes.<br />
  *  *  *<br />
<br />
ACM entry: <a href="http://doi.acm.org/10.1145/2046707.2046766" target="_blank">http://doi.acm.org/10.1145/2046707.2046766</a><br />
<br />
inproceedings{bowers11how,<br />
 author = {Bowers, Kevin D. and van Dijk, Marten and Juels, Ari and Oprea, Alina and Rivest, Ronald L.},<br />
 title = {How to tell if your cloud files are vulnerable to drive crashes},<br />
 booktitle = {Proceedings of the 18th ACM conference on Computer and communications security},<br />
 series = {CCS '11},<br />
 year = {2011},<br />
 isbn = {978-1-4503-0948-6},<br />
 location = {Chicago, Illinois, USA},<br />
 pages = {501--514},<br />
 numpages = {14},<br />
}]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Zhang:Sedic:privacy-aware data intensive computing on hybrid clouds.CCS11]]></title>
			<link>http://baijia.info/showthread.php?tid=1717</link>
			<pubDate>Fri, 03 May 2013 17:20:20 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1717</guid>
			<description><![CDATA[Kehuan Zhang, Xiaoyong Zhou, Yangyi Chen, XiaoFeng Wang, and Yaoping Ruan. 2011. Sedic: privacy-aware data intensive computing on hybrid clouds. In Proceedings of the 18th ACM conference on Computer and communications security (CCS '11). ACM, New York, NY, USA, 515-526.<br />
<br />
ACM entry: <a href="http://doi.acm.org/10.1145/2046707.2046767" target="_blank">http://doi.acm.org/10.1145/2046707.2046767</a><br />
<br />
  *  *  *<br />
<br />
Sedic presents a mechanism to separate sensitive and sanitized data, then run computation on the sensitive data inside an organization and process sanitized data on a public cloud. The techniques target MapReduce and the evaluation is run with Hadoop.<br />
<br />
  *  *  *<br />
<br />
@inproceedings{zhang11sedic,<br />
 author = {Zhang, Kehuan and Zhou, Xiaoyong and Chen, Yangyi and Wang, XiaoFeng and Ruan, Yaoping},<br />
 title = {Sedic: privacy-aware data intensive computing on hybrid clouds},<br />
 booktitle = {Proceedings of the 18th ACM conference on Computer and communications security},<br />
 series = {CCS '11},<br />
 year = {2011},<br />
 isbn = {978-1-4503-0948-6},<br />
 location = {Chicago, Illinois, USA},<br />
 pages = {515--526},<br />
 numpages = {12},<br />
}]]></description>
			<content:encoded><![CDATA[Kehuan Zhang, Xiaoyong Zhou, Yangyi Chen, XiaoFeng Wang, and Yaoping Ruan. 2011. Sedic: privacy-aware data intensive computing on hybrid clouds. In Proceedings of the 18th ACM conference on Computer and communications security (CCS '11). ACM, New York, NY, USA, 515-526.<br />
<br />
ACM entry: <a href="http://doi.acm.org/10.1145/2046707.2046767" target="_blank">http://doi.acm.org/10.1145/2046707.2046767</a><br />
<br />
  *  *  *<br />
<br />
Sedic presents a mechanism to separate sensitive and sanitized data, then run computation on the sensitive data inside an organization and process sanitized data on a public cloud. The techniques target MapReduce and the evaluation is run with Hadoop.<br />
<br />
  *  *  *<br />
<br />
@inproceedings{zhang11sedic,<br />
 author = {Zhang, Kehuan and Zhou, Xiaoyong and Chen, Yangyi and Wang, XiaoFeng and Ruan, Yaoping},<br />
 title = {Sedic: privacy-aware data intensive computing on hybrid clouds},<br />
 booktitle = {Proceedings of the 18th ACM conference on Computer and communications security},<br />
 series = {CCS '11},<br />
 year = {2011},<br />
 isbn = {978-1-4503-0948-6},<br />
 location = {Chicago, Illinois, USA},<br />
 pages = {515--526},<br />
 numpages = {12},<br />
}]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Bailis: The potential dangers of causal consistency and an explicit solution. SoCC 2012]]></title>
			<link>http://baijia.info/showthread.php?tid=1716</link>
			<pubDate>Fri, 03 May 2013 17:09:10 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1716</guid>
			<description><![CDATA[Bailis, P., Fekete, A., Ghodsi, A., Hellerstein, J. M., &amp; Stoica, I. (2012, October). The potential dangers of causal consistency and an explicit solution. In Proceedings of the Third ACM Symposium on Cloud Computing (p. 22). ACM.<br />
<br />
<a href="http://dl.acm.org/citation.cfm?id=2391251" target="_blank">http://dl.acm.org/citation.cfm?id=2391251</a><br />
<br />
This paper exposes the serious and inherent scalability limitations of causal consistency due to write propagation requirements and traditional dependency tracking mechanisms.<br />
<br />
@inproceedings{bailis2012potential,<br />
  title={The potential dangers of causal consistency and an explicit solution},<br />
  author={Bailis, Peter and Fekete, Alan and Ghodsi, Ali and Hellerstein, Joseph M and Stoica, Ion},<br />
  booktitle={Proceedings of the Third ACM Symposium on Cloud Computing},<br />
  pages={22},<br />
  year={2012},<br />
  organization={ACM}<br />
}]]></description>
			<content:encoded><![CDATA[Bailis, P., Fekete, A., Ghodsi, A., Hellerstein, J. M., &amp; Stoica, I. (2012, October). The potential dangers of causal consistency and an explicit solution. In Proceedings of the Third ACM Symposium on Cloud Computing (p. 22). ACM.<br />
<br />
<a href="http://dl.acm.org/citation.cfm?id=2391251" target="_blank">http://dl.acm.org/citation.cfm?id=2391251</a><br />
<br />
This paper exposes the serious and inherent scalability limitations of causal consistency due to write propagation requirements and traditional dependency tracking mechanisms.<br />
<br />
@inproceedings{bailis2012potential,<br />
  title={The potential dangers of causal consistency and an explicit solution},<br />
  author={Bailis, Peter and Fekete, Alan and Ghodsi, Ali and Hellerstein, Joseph M and Stoica, Ion},<br />
  booktitle={Proceedings of the Third ACM Symposium on Cloud Computing},<br />
  pages={22},<br />
  year={2012},<br />
  organization={ACM}<br />
}]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Locality scheduler]]></title>
			<link>http://baijia.info/showthread.php?tid=1715</link>
			<pubDate>Fri, 03 May 2013 13:02:57 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1715</guid>
			<description><![CDATA[We design a new scheduler for optimizing locality of a maze when processing large data on many computers.<br />
<br />
A maze (10.1.0.191/192/193/194/195) is created for this project. The original image of the maze is 10.1.0.101.<br />
<br />
It can be connected by:<br />
ssh user@newton.baijia.info -p 22191<br />
ssh user@newton.baijia.info -p 22192<br />
ssh user@newton.baijia.info -p 22193<br />
ssh user@newton.baijia.info -p 22194<br />
ssh user@newton.baijia.info -p 22195<br />
<br />
It is VM 256.1.0.8 on 256.256.256.256 at the booking system.]]></description>
			<content:encoded><![CDATA[We design a new scheduler for optimizing locality of a maze when processing large data on many computers.<br />
<br />
A maze (10.1.0.191/192/193/194/195) is created for this project. The original image of the maze is 10.1.0.101.<br />
<br />
It can be connected by:<br />
ssh user@newton.baijia.info -p 22191<br />
ssh user@newton.baijia.info -p 22192<br />
ssh user@newton.baijia.info -p 22193<br />
ssh user@newton.baijia.info -p 22194<br />
ssh user@newton.baijia.info -p 22195<br />
<br />
It is VM 256.1.0.8 on 256.256.256.256 at the booking system.]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Nishtala: Scaling Memcache at Facebook. NSDI'13]]></title>
			<link>http://baijia.info/showthread.php?tid=1706</link>
			<pubDate>Tue, 30 Apr 2013 22:39:52 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1706</guid>
			<description><![CDATA[Rajesh Nishtala, Hans Fugal, Steven Grimm, Marc Kwiatkowski, Herman Lee, Harry C. Li, Ryan McElroy, Mike Paleczny, Daniel Peek, Paul Saab, David Stafford, Tony Tung, and Venkateshwaran Venkataramani, Facebook Inc. Scaling Memcache at Facebook. NSDI'13<br />
<br />
Link: <a href="https://www.usenix.org/conference/nsdi13/scaling-memcache-facebook" target="_blank">https://www.usenix.org/conference/nsdi13...https://www.usenix.org/conference/nsdi13/scaling-memcach</a><br />
<br />
PDF: <a href="https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final170_update.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final170_</a>]]></description>
			<content:encoded><![CDATA[Rajesh Nishtala, Hans Fugal, Steven Grimm, Marc Kwiatkowski, Herman Lee, Harry C. Li, Ryan McElroy, Mike Paleczny, Daniel Peek, Paul Saab, David Stafford, Tony Tung, and Venkateshwaran Venkataramani, Facebook Inc. Scaling Memcache at Facebook. NSDI'13<br />
<br />
Link: <a href="https://www.usenix.org/conference/nsdi13/scaling-memcache-facebook" target="_blank">https://www.usenix.org/conference/nsdi13...https://www.usenix.org/conference/nsdi13/scaling-memcach</a><br />
<br />
PDF: <a href="https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final170_update.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final170_</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Doddavenkatappa: Splash: Fast Data Dissemination with Constructive Interference in Wireless Sensor Networks (NSDI '13)]]></title>
			<link>http://baijia.info/showthread.php?tid=1702</link>
			<pubDate>Mon, 29 Apr 2013 17:48:41 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1702</guid>
			<description><![CDATA[Manjunath Doddavenkatappa, Mun Choon Chan, and Ben Leong. Splash: Fast Data Dissemination with Constructive Interference in Wireless Sensor Networks. In NSDI '13.<br />
<br />
Full paper at <a href="https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final22.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/nsdi13/nsdi13-f</a>]]></description>
			<content:encoded><![CDATA[Manjunath Doddavenkatappa, Mun Choon Chan, and Ben Leong. Splash: Fast Data Dissemination with Constructive Interference in Wireless Sensor Networks. In NSDI '13.<br />
<br />
Full paper at <a href="https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final22.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/nsdi13/nsdi13-f</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Lee: SoNIC: Precise Realtime Software Access and Control of Wired Networks (NSDI '13)]]></title>
			<link>http://baijia.info/showthread.php?tid=1701</link>
			<pubDate>Mon, 29 Apr 2013 17:44:50 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1701</guid>
			<description><![CDATA[Ki Suh Lee, Han Wang, and Hakim Weatherspoon. SoNIC: Precise Realtime Software Access and Control of Wired Networks. In NSDI '13.<br />
<br />
Full paper at <a href="https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final138.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/nsdi13/nsdi13-fi</a>]]></description>
			<content:encoded><![CDATA[Ki Suh Lee, Han Wang, and Hakim Weatherspoon. SoNIC: Precise Realtime Software Access and Control of Wired Networks. In NSDI '13.<br />
<br />
Full paper at <a href="https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final138.pdf" target="_blank">https://www.usenix.org/system/files/conf...https://www.usenix.org/system/files/conference/nsdi13/nsdi13-fi</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[IDCS]]></title>
			<link>http://baijia.info/showthread.php?tid=1697</link>
			<pubDate>Sun, 28 Apr 2013 22:00:22 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1697</guid>
			<description><![CDATA[*******************************************************<br />
The 6th International Conference on <br />
Internet and Distributed Computing Systems (IDCS 2013)<br />
October 28-30, 2013, Hangzhou, Zhejiang, China<br />
*******************************************************<br />
<br />
IDCS 2013 conference is the sixth in its series to promote research in diverse fields related to Internet and Distributed Computing Systems. The emergence of Web as a ubiquitous platform for innovations has laid the foundation for the rapid growth of the Internet. Side-by-side, the use of mobile and wireless devices such as PDA, laptop, and cell phones for accessing the Internet has paved the ways for related technologies to flourish through recent developments. In addition, the popularity of sensor networks is promoting better integration of the digital world with physical environment. In IDCS 2013 conference, we are interested in receiving innovative papers on emerging technologies related to Internet and distributed systems to support the effective design and efficient implementation of high-performance computer networks. The target audience includes researchers and industry practitioners those are interested in different aspects of the Internet and distributed systems, with a particular focus on the practical experiences with the design and implementation of related technologies as well as their theoretical perspectives.<br />
<br />
Topics of Interest<br />
==================<br />
<br />
The topics of interest are organised into 5 major tracks:<br />
<br />
<br />
Track 1: Ad Hoc and Sensor Networks<br />
-----------------------------------<br />
- Middleware for Wireless Sensor Networks<br />
- Networked Sensing and Control<br />
- Sensor Fusion, Tracking and Localisation<br />
- Embedded Software for Sensor Networks<br />
- Environmental Sensing Applications<br />
- Body Sensor Networks<br />
- Vehicular Ad-Hoc Networks<br />
<br />
Track 2: Internet and Web Technologies<br />
--------------------------------------<br />
- Internet Architectures and Protocols<br />
- Modeling and Evaluation of Internet-based Systems<br />
- Internet Quality of Service<br />
- Real-time Multimedia Communication Systems<br />
- Web services and Mash-ups<br />
<br />
Track 3: Network Operations &amp; Management<br />
----------------------------------------<br />
- Energy Efficiency in Large-scale Distributed Systems<br />
- Security of Network-based Systems<br />
- Network-based Applications (VoIP, Streaming)<br />
- Network Traffic Engineering<br />
- Tools and Techniques for Network Measurements<br />
<br />
Track 4: Information Infrastructure<br />
-----------------------------------<br />
- Next Generation Content Delivery Network<br />
- Grid, Cloud, and P2P Computing<br />
- Distributed Computing Applications<br />
- Autonomic Computing<br />
- Computational Economy for Distributed Systems<br />
<br />
Track 5: Resilience, Fault tolerance, and Availability<br />
------------------------------------------------------<br />
- Fault Tolerant and Self-managing Distributed Systems<br />
- Dependability and Dependable Systems<br />
- Computing Models for Resilient Distributed Systems<br />
- Principles for Resilient Software Architecture<br />
- Availability Design<br />
<br />
<br />
Web Site and Contact Email for Inquiries<br />
========================================<br />
<br />
<a href="http://www.cloudbus.org/cdn/idcs13" target="_blank">http://www.cloudbus.org/cdn/idcs13</a><br />
email: idcs2013@easychair.org<br />
 <br />
<br />
Submission Guidelines<br />
=====================<br />
<br />
Original papers from the above-mentioned or other related areas will be considered. Papers should be submitted electronically in PDF via the conference Web site at <a href="http://www.cloudbus.org/cdn/idcs13." target="_blank">http://www.cloudbus.org/cdn/idcs13.</a> Each submitted paper should follow Springer LNCS proceedings paper template. The length of all submitted papers will have 14 pages limit, including all figures, appendix, and references, etc. Submitted papers may not have appeared in or be under consideration for another workshop, conference or a journal, nor may they be under review or submitted to another forum during the review process. Each submission will be reviewed by the members of the TPC and external reviewers.<br />
<br />
Publication<br />
===========<br />
<br />
The conference proceedings will be published as Springer Lecture Notes in Computer Science, and will be made available to all conference registrants on site. All papers will also be electronically available through SpringerLink Database, and professionally indexed through SCI and EI. Extended and enhanced versions of top-quality selected papers from the workshop will be invited for submission on a fast-track basis for special issues in high-impact renowned international journals.<br />
<br />
Registration<br />
=============<br />
<br />
Each paper selected for inclusion in the proceedings must be registered for IDCS 2013. Each paper has to be presented in person by the main author, or one of the authors.<br />
<br />
Important Dates<br />
================<br />
<br />
Submission Due: May 15, 2013<br />
Acceptance Notification: June 30, 2013<br />
Camera-ready Copy Due: July 31, 2013<br />
Conference: October 28-30, 2013<br />
<br />
Organization<br />
=============<br />
<br />
Honorary Chair<br />
--------------<br />
Wenzhan Dai, Zhejiang GongShang University, China<br />
<br />
General Chairs<br />
---------------<br />
Yun Ling, Zhejiang GongShang University, China<br />
Dimitrios Georgakopoulos, CSIRO, Australia<br />
<br />
Program Chairs<br />
--------------<br />
Mukaddim Pathan, Telstra Corporation Limited, Australia<br />
Guiyi Wei, Zhejiang GongShang University, China<br />
Giancarlo Fortino, University of Calabria, Italy<br />
<br />
Program Committee<br />
-----------------<br />
Tarem Ahmed, BRAC University, Bangladesh<br />
Hani Alzaid, King Abdulaziz City for Science and Technology, Saudi Arabia<br />
Doina Bein, The Pennsylvania State University, USA<br />
Rajkumar Buyya, The University of Melbourne, Australia<br />
Michael Compton, CSIRO, Australia<br />
Giuseppe Di Fatta, University of Reading, UK<br />
Marcos Dias De Assuncao, IBM Research, Brazil<br />
Abdelkarim Erradi, Qatar University, Qatar<br />
Zongming Fei, University of Kentucky, USA<br />
Joaquin Garcia-Alfaro, Telecom Bretagne, France<br />
Saurabh Kumar Garg, IBM Research, Australia<br />
Soumya Ghosh, Indian Institute of Technology, Kharagpur, India<br />
Victor Govindaswamy, Texas A&amp;M University-Texarkana, USA<br />
Ragib Hasan, University of Alabama at Birmingham, USA<br />
Mohammad Mehedi Hassan, King Saud University, USA<br />
Dimitrios Katsaros, University of Thessaly, Greece<br />
Hae Young Lee,  ETRI, South Korea<br />
Jaime Lloret, Polytechnic University of Valencia, Spain<br />
Rongxing Lu, University of Waterloo, Canada<br />
Carlo Mastroianni, ICAR-CNR, Italy<br />
Mohammad Matin, North South University, Bangladesh<br />
Muhammad Mostafa Monowar, King AbdulAziz university, Saudi Arabia<br />
Surya Nepal, CSIRO, Australia<br />
Marco Netto, IBM Research, Brazil<br />
Ekow Otoo, University of the Witwatersrand, South Africa<br />
George Pallis, University of Cyprus, Cyprus<br />
Haifeng Qian, East China Normal University, China<br />
Shawon Rahman, University of Hawaii-Hilo, USA<br />
Mustafizur Rahman, DSTO, Australia<br />
Thomas Repantis, University of California-Riverside, USA<br />
Riaz Ahmed Shaikh, King AbdulAziz University, Saudi Arabia<br />
Jun Shao, Zhejiang Gongshang University, China<br />
Ramesh Sitaraman, University of Massachusetts-Amherst, USA<br />
Waleed Smari, University of Dayton, USA<br />
Kerry Taylor, CSIRO &amp; Australian National University, Australia<br />
Parimala Thulasiram, University of Manitoba, Canada<br />
William Voorsluys, The University of Melbourne, Australia<br />
Licheng Wang, Beijing University of Posts and Telecommunications, China<br />
Lihua Wang, National Institute of Information and Communications Technology, Japan<br />
Xiaofeng Wang, National University of Defence Technology, China<br />
Bin Xiao, The Hong Kong Polytechnic University, Hong Kong, China<br />
Bin Xie, InfoBeyond Technology, USA<br />
Norihiko Yoshida, Saitama University, Japan<br />
Haojin Zhu, Shanghai Jiao Tong University, China]]></description>
			<content:encoded><![CDATA[*******************************************************<br />
The 6th International Conference on <br />
Internet and Distributed Computing Systems (IDCS 2013)<br />
October 28-30, 2013, Hangzhou, Zhejiang, China<br />
*******************************************************<br />
<br />
IDCS 2013 conference is the sixth in its series to promote research in diverse fields related to Internet and Distributed Computing Systems. The emergence of Web as a ubiquitous platform for innovations has laid the foundation for the rapid growth of the Internet. Side-by-side, the use of mobile and wireless devices such as PDA, laptop, and cell phones for accessing the Internet has paved the ways for related technologies to flourish through recent developments. In addition, the popularity of sensor networks is promoting better integration of the digital world with physical environment. In IDCS 2013 conference, we are interested in receiving innovative papers on emerging technologies related to Internet and distributed systems to support the effective design and efficient implementation of high-performance computer networks. The target audience includes researchers and industry practitioners those are interested in different aspects of the Internet and distributed systems, with a particular focus on the practical experiences with the design and implementation of related technologies as well as their theoretical perspectives.<br />
<br />
Topics of Interest<br />
==================<br />
<br />
The topics of interest are organised into 5 major tracks:<br />
<br />
<br />
Track 1: Ad Hoc and Sensor Networks<br />
-----------------------------------<br />
- Middleware for Wireless Sensor Networks<br />
- Networked Sensing and Control<br />
- Sensor Fusion, Tracking and Localisation<br />
- Embedded Software for Sensor Networks<br />
- Environmental Sensing Applications<br />
- Body Sensor Networks<br />
- Vehicular Ad-Hoc Networks<br />
<br />
Track 2: Internet and Web Technologies<br />
--------------------------------------<br />
- Internet Architectures and Protocols<br />
- Modeling and Evaluation of Internet-based Systems<br />
- Internet Quality of Service<br />
- Real-time Multimedia Communication Systems<br />
- Web services and Mash-ups<br />
<br />
Track 3: Network Operations &amp; Management<br />
----------------------------------------<br />
- Energy Efficiency in Large-scale Distributed Systems<br />
- Security of Network-based Systems<br />
- Network-based Applications (VoIP, Streaming)<br />
- Network Traffic Engineering<br />
- Tools and Techniques for Network Measurements<br />
<br />
Track 4: Information Infrastructure<br />
-----------------------------------<br />
- Next Generation Content Delivery Network<br />
- Grid, Cloud, and P2P Computing<br />
- Distributed Computing Applications<br />
- Autonomic Computing<br />
- Computational Economy for Distributed Systems<br />
<br />
Track 5: Resilience, Fault tolerance, and Availability<br />
------------------------------------------------------<br />
- Fault Tolerant and Self-managing Distributed Systems<br />
- Dependability and Dependable Systems<br />
- Computing Models for Resilient Distributed Systems<br />
- Principles for Resilient Software Architecture<br />
- Availability Design<br />
<br />
<br />
Web Site and Contact Email for Inquiries<br />
========================================<br />
<br />
<a href="http://www.cloudbus.org/cdn/idcs13" target="_blank">http://www.cloudbus.org/cdn/idcs13</a><br />
email: idcs2013@easychair.org<br />
 <br />
<br />
Submission Guidelines<br />
=====================<br />
<br />
Original papers from the above-mentioned or other related areas will be considered. Papers should be submitted electronically in PDF via the conference Web site at <a href="http://www.cloudbus.org/cdn/idcs13." target="_blank">http://www.cloudbus.org/cdn/idcs13.</a> Each submitted paper should follow Springer LNCS proceedings paper template. The length of all submitted papers will have 14 pages limit, including all figures, appendix, and references, etc. Submitted papers may not have appeared in or be under consideration for another workshop, conference or a journal, nor may they be under review or submitted to another forum during the review process. Each submission will be reviewed by the members of the TPC and external reviewers.<br />
<br />
Publication<br />
===========<br />
<br />
The conference proceedings will be published as Springer Lecture Notes in Computer Science, and will be made available to all conference registrants on site. All papers will also be electronically available through SpringerLink Database, and professionally indexed through SCI and EI. Extended and enhanced versions of top-quality selected papers from the workshop will be invited for submission on a fast-track basis for special issues in high-impact renowned international journals.<br />
<br />
Registration<br />
=============<br />
<br />
Each paper selected for inclusion in the proceedings must be registered for IDCS 2013. Each paper has to be presented in person by the main author, or one of the authors.<br />
<br />
Important Dates<br />
================<br />
<br />
Submission Due: May 15, 2013<br />
Acceptance Notification: June 30, 2013<br />
Camera-ready Copy Due: July 31, 2013<br />
Conference: October 28-30, 2013<br />
<br />
Organization<br />
=============<br />
<br />
Honorary Chair<br />
--------------<br />
Wenzhan Dai, Zhejiang GongShang University, China<br />
<br />
General Chairs<br />
---------------<br />
Yun Ling, Zhejiang GongShang University, China<br />
Dimitrios Georgakopoulos, CSIRO, Australia<br />
<br />
Program Chairs<br />
--------------<br />
Mukaddim Pathan, Telstra Corporation Limited, Australia<br />
Guiyi Wei, Zhejiang GongShang University, China<br />
Giancarlo Fortino, University of Calabria, Italy<br />
<br />
Program Committee<br />
-----------------<br />
Tarem Ahmed, BRAC University, Bangladesh<br />
Hani Alzaid, King Abdulaziz City for Science and Technology, Saudi Arabia<br />
Doina Bein, The Pennsylvania State University, USA<br />
Rajkumar Buyya, The University of Melbourne, Australia<br />
Michael Compton, CSIRO, Australia<br />
Giuseppe Di Fatta, University of Reading, UK<br />
Marcos Dias De Assuncao, IBM Research, Brazil<br />
Abdelkarim Erradi, Qatar University, Qatar<br />
Zongming Fei, University of Kentucky, USA<br />
Joaquin Garcia-Alfaro, Telecom Bretagne, France<br />
Saurabh Kumar Garg, IBM Research, Australia<br />
Soumya Ghosh, Indian Institute of Technology, Kharagpur, India<br />
Victor Govindaswamy, Texas A&amp;M University-Texarkana, USA<br />
Ragib Hasan, University of Alabama at Birmingham, USA<br />
Mohammad Mehedi Hassan, King Saud University, USA<br />
Dimitrios Katsaros, University of Thessaly, Greece<br />
Hae Young Lee,  ETRI, South Korea<br />
Jaime Lloret, Polytechnic University of Valencia, Spain<br />
Rongxing Lu, University of Waterloo, Canada<br />
Carlo Mastroianni, ICAR-CNR, Italy<br />
Mohammad Matin, North South University, Bangladesh<br />
Muhammad Mostafa Monowar, King AbdulAziz university, Saudi Arabia<br />
Surya Nepal, CSIRO, Australia<br />
Marco Netto, IBM Research, Brazil<br />
Ekow Otoo, University of the Witwatersrand, South Africa<br />
George Pallis, University of Cyprus, Cyprus<br />
Haifeng Qian, East China Normal University, China<br />
Shawon Rahman, University of Hawaii-Hilo, USA<br />
Mustafizur Rahman, DSTO, Australia<br />
Thomas Repantis, University of California-Riverside, USA<br />
Riaz Ahmed Shaikh, King AbdulAziz University, Saudi Arabia<br />
Jun Shao, Zhejiang Gongshang University, China<br />
Ramesh Sitaraman, University of Massachusetts-Amherst, USA<br />
Waleed Smari, University of Dayton, USA<br />
Kerry Taylor, CSIRO &amp; Australian National University, Australia<br />
Parimala Thulasiram, University of Manitoba, Canada<br />
William Voorsluys, The University of Melbourne, Australia<br />
Licheng Wang, Beijing University of Posts and Telecommunications, China<br />
Lihua Wang, National Institute of Information and Communications Technology, Japan<br />
Xiaofeng Wang, National University of Defence Technology, China<br />
Bin Xiao, The Hong Kong Polytechnic University, Hong Kong, China<br />
Bin Xie, InfoBeyond Technology, USA<br />
Norihiko Yoshida, Saitama University, Japan<br />
Haojin Zhu, Shanghai Jiao Tong University, China]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Lee: Reviving Delay-based TCP for Data Centers (SIGCOMM '12)]]></title>
			<link>http://baijia.info/showthread.php?tid=1689</link>
			<pubDate>Fri, 26 Apr 2013 11:56:24 +0800</pubDate>
			<guid isPermaLink="false">http://baijia.info/showthread.php?tid=1689</guid>
			<description><![CDATA[Changhyun Lee, Keon Jang, and Sue Moon. Reviving Delay-based TCP for Data Centers. In SIGCOMM '12 (poster).<br />
<br />
ABSTRACT<br />
With the rapid growth of data centers, minimizing the queueing delay at network switches has been one of the key challenges. In this<br />
work, we analyze the shortcomings of the current TCP algorithm<br />
when used in data center networks, and we propose to use latency-based congestion detection and rate-based transfer to achieve ultra-low queueing delay in data centers.<br />
<br />
Paper at <a href="http://dl.acm.org/ft_gateway.cfm?id=2377706&amp;ftid=1292574&amp;dwn=1&amp;CFID=320297644&amp;CFTOKEN=77488406" target="_blank">http://dl.acm.org/ft_gateway.cfm?id=2377...http://dl.acm.org/ft_gateway.cfm?id=2377706&#x26;ftid=1292574&#x26;dwn=1&#x26;CFID=320297644&#x26;CFTOKE</a>]]></description>
			<content:encoded><![CDATA[Changhyun Lee, Keon Jang, and Sue Moon. Reviving Delay-based TCP for Data Centers. In SIGCOMM '12 (poster).<br />
<br />
ABSTRACT<br />
With the rapid growth of data centers, minimizing the queueing delay at network switches has been one of the key challenges. In this<br />
work, we analyze the shortcomings of the current TCP algorithm<br />
when used in data center networks, and we propose to use latency-based congestion detection and rate-based transfer to achieve ultra-low queueing delay in data centers.<br />
<br />
Paper at <a href="http://dl.acm.org/ft_gateway.cfm?id=2377706&amp;ftid=1292574&amp;dwn=1&amp;CFID=320297644&amp;CFTOKEN=77488406" target="_blank">http://dl.acm.org/ft_gateway.cfm?id=2377...http://dl.acm.org/ft_gateway.cfm?id=2377706&ftid=1292574&dwn=1&CFID=320297644&CFTOKE</a>]]></content:encoded>
		</item>
	</channel>
</rss>