T4E 2016 is scheduled to be held at the Indian Institute of Technology Bombay, India during December 2-4, 2016. This is the 8 year of the conference. The first one, held in Bangalore during August 4-6, 2009 was an International Workshop on Technology for Education. The success of T4E 2009 inspired the community to enlarge the scope of T4E from that of a Workshop to an annual Conference to be held in major centers of learning technology in India. IIT Bombay shouldered the responsibility for T4E 2010. T4E 2011, 2012, 2013, 2014 and 2015 were held at IIT Madras, IIIT Hyderabad, IIT Kharagpur, Amrita University and NIT Warangal respectively.
{"title":"Message from the General Chair","authors":"L. Wosinska","doi":"10.1109/LCN.2004.76","DOIUrl":"https://doi.org/10.1109/LCN.2004.76","url":null,"abstract":"T4E 2016 is scheduled to be held at the Indian Institute of Technology Bombay, India during December 2-4, 2016. This is the 8 year of the conference. The first one, held in Bangalore during August 4-6, 2009 was an International Workshop on Technology for Education. The success of T4E 2009 inspired the community to enlarge the scope of T4E from that of a Workshop to an annual Conference to be held in major centers of learning technology in India. IIT Bombay shouldered the responsibility for T4E 2010. T4E 2011, 2012, 2013, 2014 and 2015 were held at IIT Madras, IIIT Hyderabad, IIT Kharagpur, Amrita University and NIT Warangal respectively.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"3 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90164186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-24DOI: 10.1109/LCN.2009.5355008
E. Elmallah
On behalf of the organizing committee of the 30th IEEE Symposium on Reliable Distributed Systems (SRDS 2011), it is my pleasure to welcome the symposium attendants to Madrid, Spain. The conference is organized by the Distributed Systems Lab (LSD) of the Universidad Politécnica de Madrid in this first visit of the conference to Spain. The conference will take place in a historical building of the University, the Escuela de Minas, located in the city center of Madrid that dates back to1893.
我很高兴代表第30届IEEE可靠分布式系统研讨会(SRDS 2011)的组委会，欢迎研讨会的与会者来到西班牙马德里。这次会议是由马德里politcnica大学的分布式系统实验室(LSD)组织的，这是该会议首次访问西班牙。会议将在位于马德里市中心的Escuela de Minas大学的历史建筑中举行，该建筑可追溯到1893年。
{"title":"Message from the general chair","authors":"E. Elmallah","doi":"10.1109/LCN.2009.5355008","DOIUrl":"https://doi.org/10.1109/LCN.2009.5355008","url":null,"abstract":"On behalf of the organizing committee of the 30th IEEE Symposium on Reliable Distributed Systems (SRDS 2011), it is my pleasure to welcome the symposium attendants to Madrid, Spain. The conference is organized by the Distributed Systems Lab (LSD) of the Universidad Politécnica de Madrid in this first visit of the conference to Spain. The conference will take place in a historical building of the University, the Escuela de Minas, located in the city center of Madrid that dates back to1893.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"18 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2021-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78426385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the advent of big data, data center applications are processing vast amounts of unstructured and semi-structured data, in parallel on large clusters, across hundreds to thousands of nodes. The highest performance for these batch big data workloads is achieved using expensive network equipment with large buffers, which accommodate bursts in network traffic and allocate bandwidth fairly even when the network is congested. Throughput-sensitive big data applications are, however, often executed in the same data center as latency-sensitive workloads. For both workloads to be supported well, the network must provide both maximum throughput and low latency. Progress has been made in this direction, as modern network switches support Active Queue Management (AQM) and Explicit Congestion Notifications (ECN), both mechanisms to control the level of queue occupancy, reducing the total network latency. This paper is the first study of the effect of Active Queue Management on both throughput and latency, in the context of Hadoop and the MapReduce programming model. We give a quantitative comparison of four different approaches for controlling buffer occupancy and latency: RED and CoDel, both standalone and also combined with ECN and DCTCP network protocol, and identify the AQM configurations that maintain Hadoop execution time gains from larger buffers within 5%, while reducing network packet latency caused by bufferbloat by up to 85%. Finally, we provide recommendations to administrators of Hadoop clusters as to how to improve latency without degrading the throughput of batch big data workloads.
{"title":"Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management?","authors":"Renan Fischer e Silva, P. Carpenter","doi":"10.1109/LCN.2016.70","DOIUrl":"https://doi.org/10.1109/LCN.2016.70","url":null,"abstract":"With the advent of big data, data center applications are processing vast amounts of unstructured and semi-structured data, in parallel on large clusters, across hundreds to thousands of nodes. The highest performance for these batch big data workloads is achieved using expensive network equipment with large buffers, which accommodate bursts in network traffic and allocate bandwidth fairly even when the network is congested. Throughput-sensitive big data applications are, however, often executed in the same data center as latency-sensitive workloads. For both workloads to be supported well, the network must provide both maximum throughput and low latency. Progress has been made in this direction, as modern network switches support Active Queue Management (AQM) and Explicit Congestion Notifications (ECN), both mechanisms to control the level of queue occupancy, reducing the total network latency. This paper is the first study of the effect of Active Queue Management on both throughput and latency, in the context of Hadoop and the MapReduce programming model. We give a quantitative comparison of four different approaches for controlling buffer occupancy and latency: RED and CoDel, both standalone and also combined with ECN and DCTCP network protocol, and identify the AQM configurations that maintain Hadoop execution time gains from larger buffers within 5%, while reducing network packet latency caused by bufferbloat by up to 85%. Finally, we provide recommendations to administrators of Hadoop clusters as to how to improve latency without degrading the throughput of batch big data workloads.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"25 1","pages":"415-423"},"PeriodicalIF":0.0,"publicationDate":"2016-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88080826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Random linear network coding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A substantial limitation, however, is delay: decoding requires as many independent linear combinations as data blocks. Hierarchical network coding purportedly solves this delay problem. It introduces layers to decode prioritized data blocks early, which may benefit video streaming applications or applications for sensor information collection. While hierarchical network coding reduces decoding delays, it introduces significant space complexity and additional decoding time. We propose a decoding algorithm that manages all prioritization layers in a joint decoder matrix. Analytical evaluation and performance measurements show that we maintain prioritization benefits without increased space complexity and improve decoding performance. With memory requirements independent of the number of layers, our algorithm facilitates more fine-grained prioritization layers to further the benefits of hierarchical network coding.
{"title":"Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity","authors":"R. Naumann, S. Dietzel, B. Scheuermann","doi":"10.1109/LCN.2016.123","DOIUrl":"https://doi.org/10.1109/LCN.2016.123","url":null,"abstract":"Random linear network coding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A substantial limitation, however, is delay: decoding requires as many independent linear combinations as data blocks. Hierarchical network coding purportedly solves this delay problem. It introduces layers to decode prioritized data blocks early, which may benefit video streaming applications or applications for sensor information collection. While hierarchical network coding reduces decoding delays, it introduces significant space complexity and additional decoding time. We propose a decoding algorithm that manages all prioritization layers in a joint decoder matrix. Analytical evaluation and performance measurements show that we maintain prioritization benefits without increased space complexity and improve decoding performance. With memory requirements independent of the number of layers, our algorithm facilitates more fine-grained prioritization layers to further the benefits of hierarchical network coding.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"723-731"},"PeriodicalIF":0.0,"publicationDate":"2016-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87826617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fangzhou Jiang, Zhi Liu, Kanchana Thilakarathna, Zhenyu Li, Yusheng Ji, A. Seneviratne
Mobile video traffic is exploding and it is particularly challenging to stream video when high density of users are "on the move", e.g., in public transport systems. It becomes increasingly problematic as video traffic is predicted to account for more than 80% of Internet traffic by 2019. This will be exacerbated by factors such as cellular network coverage issues and unstable network throughput due to high speed mobility. By exploiting the predictable public transport mobility patterns, spatio-temporal correlation of user interests and users' video viewing behaviors, we proposed TransFetch which uses intelligent caching on-board the public transport vehicles as well as a novel video chunk placement algorithm. We show through extensive simulations, that TransFetch reduces the system cellular data usage by up to 45% and improves the quality of video streaming by up to 35%. Finally, we demonstrate the practical feasibility of TransFetch by implementing caching units on a Raspberry-Pi and a mobile app on an Android device.
{"title":"TransFetch: A Viewing Behavior Driven Video Distribution Framework in Public Transport","authors":"Fangzhou Jiang, Zhi Liu, Kanchana Thilakarathna, Zhenyu Li, Yusheng Ji, A. Seneviratne","doi":"10.1109/LCN.2016.27","DOIUrl":"https://doi.org/10.1109/LCN.2016.27","url":null,"abstract":"Mobile video traffic is exploding and it is particularly challenging to stream video when high density of users are \"on the move\", e.g., in public transport systems. It becomes increasingly problematic as video traffic is predicted to account for more than 80% of Internet traffic by 2019. This will be exacerbated by factors such as cellular network coverage issues and unstable network throughput due to high speed mobility. By exploiting the predictable public transport mobility patterns, spatio-temporal correlation of user interests and users' video viewing behaviors, we proposed TransFetch which uses intelligent caching on-board the public transport vehicles as well as a novel video chunk placement algorithm. We show through extensive simulations, that TransFetch reduces the system cellular data usage by up to 45% and improves the quality of video streaming by up to 35%. Finally, we demonstrate the practical feasibility of TransFetch by implementing caching units on a Raspberry-Pi and a mobile app on an Android device.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"26 1","pages":"147-155"},"PeriodicalIF":0.0,"publicationDate":"2016-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83218579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Björn Richerzhagen, Nils Richerzhagen, Julian Zobel, Sophie Schönherr, B. Koldehofe, R. Steinmetz
With a plethora of sensors and ubiquitous access to the Internet, modern smartphones have enabled a broad range of context-based applications. Most applications make use of the user's physical location to filter relevant content. However, filtering based on dynamic contextual information results in high complexity of the filtering process. This limits the applicability of existing publish/subscribe systems, as they rely on aggregation of filters and fast decentralized matching and forwarding. In this work, we propose a mechanism for transitions between different filter schemes for location-based services. Our mechanism adapts the filtering process to the dynamics in user behavior and resulting load by trading computational complexity at the broker against communication overhead and computational complexity at the mobile client. We integrate our mechanism into an existing publish/subscribe system and evaluate transitions between a context-based filter scheme and two channel-based filter schemes, showing the applicability of our approach.
{"title":"Seamless Transitions between Filter Schemes for Location-Based Mobile Applications","authors":"Björn Richerzhagen, Nils Richerzhagen, Julian Zobel, Sophie Schönherr, B. Koldehofe, R. Steinmetz","doi":"10.1109/LCN.2016.28","DOIUrl":"https://doi.org/10.1109/LCN.2016.28","url":null,"abstract":"With a plethora of sensors and ubiquitous access to the Internet, modern smartphones have enabled a broad range of context-based applications. Most applications make use of the user's physical location to filter relevant content. However, filtering based on dynamic contextual information results in high complexity of the filtering process. This limits the applicability of existing publish/subscribe systems, as they rely on aggregation of filters and fast decentralized matching and forwarding. In this work, we propose a mechanism for transitions between different filter schemes for location-based services. Our mechanism adapts the filtering process to the dynamics in user behavior and resulting load by trading computational complexity at the broker against communication overhead and computational complexity at the mobile client. We integrate our mechanism into an existing publish/subscribe system and evaluate transitions between a context-based filter scheme and two channel-based filter schemes, showing the applicability of our approach.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"4 1","pages":"348-356"},"PeriodicalIF":0.0,"publicationDate":"2016-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78881724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Attribute Based Encryption (ABE) scheme has been proposed to implement cryptographic fine grained access control to shared information. It allows to share information of type one-to-many users, without considering the number of users and their identities. However, original ABE systems suffer from the non-efficiency of their attribute revocation mechanisms. Based on Ciphertext-Policy ABE (CP-ABE) scheme, we propose an efficient proxy-based immediate private key update which does require neither re-encrypting ciphertexts, nor affect other users' secret keys. The semi-trusted proxy assists nodes during the decryption process without having ability to decrypt users' data. Finally, we analyze the security of our scheme and demonstrate that the proposed solution outperforms existing ones in terms of generated overheard.
{"title":"Instantaneous Proxy-Based Key Update for CP-ABE","authors":"Lyes Touati, Y. Challal","doi":"10.1109/LCN.2016.100","DOIUrl":"https://doi.org/10.1109/LCN.2016.100","url":null,"abstract":"Attribute Based Encryption (ABE) scheme has been proposed to implement cryptographic fine grained access control to shared information. It allows to share information of type one-to-many users, without considering the number of users and their identities. However, original ABE systems suffer from the non-efficiency of their attribute revocation mechanisms. Based on Ciphertext-Policy ABE (CP-ABE) scheme, we propose an efficient proxy-based immediate private key update which does require neither re-encrypting ciphertexts, nor affect other users' secret keys. The semi-trusted proxy assists nodes during the decryption process without having ability to decrypt users' data. Finally, we analyze the security of our scheme and demonstrate that the proposed solution outperforms existing ones in terms of generated overheard.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"31 1","pages":"591-594"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74469633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose, design and experiment an energy efficient protocol for Wireless Sensor Networks (WSNs) named Opportunistic Duty cYcle based routing protocol for wirelesS Sensor nEtworks (ODYSSE). The main key innovation of ODYSSE is that it judiciously makes use of three mechanisms. The first one is duty cycling which consists in randomly switching on/off transceivers to save energy. The second one is opportunistic routing in which the next hop is not rigidly fixed: any node closer to the destination might become a relay. The third one, is source coding using LDPC, Low-Density Parity-Check codes. With asynchronous duty cycling as a starting point, the above techniques fit perfectly, yielding a robust low complexity protocol for highly constrained nodes. ODYSSE is implemented and installed in an experimental testbed composed of 45 Arduino nodes communicating with IEEE 802.15.4 (XBee) modules deployed in the large-scale platform FIT IoT-LAB. Results show that the performance obtained is very satisfying in both following scenarios: high load (images) and light load (reporting of infrequent event).
{"title":"Experiments with ODYSSE: Opportunistic Duty cYcle Based Routing for Wireless Sensor nEtworks","authors":"I. Amdouni, C. Adjih, N. Aitsaadi, P. Mühlethaler","doi":"10.1109/LCN.2016.50","DOIUrl":"https://doi.org/10.1109/LCN.2016.50","url":null,"abstract":"In this paper, we propose, design and experiment an energy efficient protocol for Wireless Sensor Networks (WSNs) named Opportunistic Duty cYcle based routing protocol for wirelesS Sensor nEtworks (ODYSSE). The main key innovation of ODYSSE is that it judiciously makes use of three mechanisms. The first one is duty cycling which consists in randomly switching on/off transceivers to save energy. The second one is opportunistic routing in which the next hop is not rigidly fixed: any node closer to the destination might become a relay. The third one, is source coding using LDPC, Low-Density Parity-Check codes. With asynchronous duty cycling as a starting point, the above techniques fit perfectly, yielding a robust low complexity protocol for highly constrained nodes. ODYSSE is implemented and installed in an experimental testbed composed of 45 Arduino nodes communicating with IEEE 802.15.4 (XBee) modules deployed in the large-scale platform FIT IoT-LAB. Results show that the performance obtained is very satisfying in both following scenarios: high load (images) and light load (reporting of infrequent event).","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"629 1","pages":"232-235"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77656190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we investigate the influence of intra-and inter-cell mobility of users on performance of 4G/5G cellular networks, such as LTE and LTE-A. To this end, we develop a multi-class PS queue model that captures mobility of users between zones of a cell and between cells, through a simple mobility model, that is decoupled from the cell model itself, enabling to directly apply the approach to more realistic mobility patterns. We first show that this model is consistent with known analytical bounds corresponding to a system with either static users or users having an infinite speed. We then compare our model to simulations for more realistic speeds, and show that it provides user and cell performance with a very good accuracy. The outcomes of our model confirm that mobility may improve both users and cells performance, and enable to quantify the gain as a function of users speed.
{"title":"Performance Model for 4G/5G Networks Taking into Account Intra- and Inter-Cell Mobility of Users","authors":"B. Baynat, N. Nya","doi":"10.1109/LCN.2016.45","DOIUrl":"https://doi.org/10.1109/LCN.2016.45","url":null,"abstract":"In this paper, we investigate the influence of intra-and inter-cell mobility of users on performance of 4G/5G cellular networks, such as LTE and LTE-A. To this end, we develop a multi-class PS queue model that captures mobility of users between zones of a cell and between cells, through a simple mobility model, that is decoupled from the cell model itself, enabling to directly apply the approach to more realistic mobility patterns. We first show that this model is consistent with known analytical bounds corresponding to a system with either static users or users having an infinite speed. We then compare our model to simulations for more realistic speeds, and show that it provides user and cell performance with a very good accuracy. The outcomes of our model confirm that mobility may improve both users and cells performance, and enable to quantify the gain as a function of users speed.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"39 1","pages":"212-215"},"PeriodicalIF":0.0,"publicationDate":"2016-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85916248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Datacenter transport has attracted much recent interest, however, most proposed improvements require changing the datacenter fabric, which hinders their applicability and deployability over commodity hardware. In this paper, we present a novel congestion controller, Logistic Growth Control (LGC), for datacenters which does not require changes to the datacenter fabric. LGC uses a similar ECN marking as in DCTCP, but adapts to congestion using the logistic growth function. This function has been proven to have nice characteristics including stability, convergence, fairness, and scalability, which are very appealing for congestion control. As a result, our LGC mechanism operates in the datacenter network in a more stable and fair manner, leading to less queuing and latency. LGC also behaves better than DCTCP, and it converges to the fair share of the bottleneck link capacity irrespective of the Round-Trip-Time (RTT). We discuss the stability and fairness of LGC using a fluid model, and show its performance improvement with simulations.
{"title":"Even Lower Latency, Even Better Fairness: Logistic Growth Congestion Control in Datacenters","authors":"P. Teymoori, D. Hayes, M. Welzl, S. Gjessing","doi":"10.1109/LCN.2016.12","DOIUrl":"https://doi.org/10.1109/LCN.2016.12","url":null,"abstract":"Datacenter transport has attracted much recent interest, however, most proposed improvements require changing the datacenter fabric, which hinders their applicability and deployability over commodity hardware. In this paper, we present a novel congestion controller, Logistic Growth Control (LGC), for datacenters which does not require changes to the datacenter fabric. LGC uses a similar ECN marking as in DCTCP, but adapts to congestion using the logistic growth function. This function has been proven to have nice characteristics including stability, convergence, fairness, and scalability, which are very appealing for congestion control. As a result, our LGC mechanism operates in the datacenter network in a more stable and fair manner, leading to less queuing and latency. LGC also behaves better than DCTCP, and it converges to the fair share of the bottleneck link capacity irrespective of the Round-Trip-Time (RTT). We discuss the stability and fairness of LGC using a fluid model, and show its performance improvement with simulations.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"68 1","pages":"10-18"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74309827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：