In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in terms of energy consumption and fairness. First, we propose a heuristic power control method that improves throughput, and then we model the Utility Constrained Energy Minimization (UCEM) problem in which the utility constraint takes into account single and multi node performance. UCEM is modeled as a convex optimization problem and Sequential Quadratic Programming (SQP) is used to find optimal transmission probabilities. Numerical results show that our method can achieve fairness, reduce energy consumption and enhance lifetime of such networks.
{"title":"Utility Constrained Energy Minimization In Aloha Networks","authors":"A. Khodaian, B. Khalaj, M. S. Talebi","doi":"10.1109/CCNC.2007.136","DOIUrl":"https://doi.org/10.1109/CCNC.2007.136","url":null,"abstract":"In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in terms of energy consumption and fairness. First, we propose a heuristic power control method that improves throughput, and then we model the Utility Constrained Energy Minimization (UCEM) problem in which the utility constraint takes into account single and multi node performance. UCEM is modeled as a convex optimization problem and Sequential Quadratic Programming (SQP) is used to find optimal transmission probabilities. Numerical results show that our method can achieve fairness, reduce energy consumption and enhance lifetime of such networks.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125771115","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}
One of the big challenges in ad hoc network design is packet routing. Studies have shown that on-demand routing protocols perform better than table-driven routing protocols. In order to avoid route discovery for each packet, on-demand routing protocols cache routes previously learnt. A node in ad hoc network learns routing information by overhearing or forwarding packets to other nodes and keep learned routes in its route cache. However, node movement results broken links and therefore increases risk of cache pollution. Ensuring cache freshness in on-demand routing protocols, therefore, presents a serious challenge. A lot of research has been done in route cache organization, however, little effort has been done for route cache timeout policy to prevent stale routes from being used. In this paper we propose a new cross-layer framework to improve route cache performance in on-demand routing protocols. The proposed framework presents novel use of Received Signal Strength Indicator (RSSI) information to choose cache timeout of individual links in route cache.
{"title":"Ensuring Cache Freshness in On-Demand Routing Protocols for Mobile Ad Hoc Network: A Cross-layer Framework","authors":"A. Shukla","doi":"10.1109/CCNC.2007.59","DOIUrl":"https://doi.org/10.1109/CCNC.2007.59","url":null,"abstract":"One of the big challenges in ad hoc network design is packet routing. Studies have shown that on-demand routing protocols perform better than table-driven routing protocols. In order to avoid route discovery for each packet, on-demand routing protocols cache routes previously learnt. A node in ad hoc network learns routing information by overhearing or forwarding packets to other nodes and keep learned routes in its route cache. However, node movement results broken links and therefore increases risk of cache pollution. Ensuring cache freshness in on-demand routing protocols, therefore, presents a serious challenge. A lot of research has been done in route cache organization, however, little effort has been done for route cache timeout policy to prevent stale routes from being used. In this paper we propose a new cross-layer framework to improve route cache performance in on-demand routing protocols. The proposed framework presents novel use of Received Signal Strength Indicator (RSSI) information to choose cache timeout of individual links in route cache.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125115516","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 : 2008-04-01DOI: 10.1109/MCOM.2008.4481342
N. Baldo, M. Zorzi
The search for the ultimate architecture for cross-layer optimization in cognitive radio networks is characterized by challenges such as modularity, interpretability, imprecision, scalability, and complexity constraints. In this article we propose fuzzy logic as an effective means of meeting these challenges, as far as both knowledge representation and control implementation are concerned.
{"title":"Fuzzy Logic for Cross-layer Optimization in Cognitive Radio Networks","authors":"N. Baldo, M. Zorzi","doi":"10.1109/MCOM.2008.4481342","DOIUrl":"https://doi.org/10.1109/MCOM.2008.4481342","url":null,"abstract":"The search for the ultimate architecture for cross-layer optimization in cognitive radio networks is characterized by challenges such as modularity, interpretability, imprecision, scalability, and complexity constraints. In this article we propose fuzzy logic as an effective means of meeting these challenges, as far as both knowledge representation and control implementation are concerned.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126242833","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}
An analytical model is proposed for the perfor- mance study of IEEE 802.11 distributed coordination function (DCF) with finite traffic load. Based on the model, average medium access control (MAC) sublayer service time of a frame and channel throughput are obtained. The model is further extended for the performance analysis of DCF with mixed voice and data traffic. The maximum number of voice connections supported in IEEE 802.11 WLAN under various background data traffic is derived. The results are useful for effective call admission control in IEEE 802.11 WLAN. Extensive simulations are performed to validate our analysis. I. INTRODUCTION The IEEE 802.11 standard (1) has been widely deployed around the world. Its medium access control (MAC) sublayer specifies two modes, the mandatory distributed coordination function (DCF) and the optional point coordination function (PCF). DCF is a distributed random access mechanism that is suitable for ad hoc networks, while PCF is a centralized polling based mechanism that can only work in infrastructure- based wireless LANs (WLANs). Due to its inefficient polling schemes and limited Quality-of-Service (QoS) provisioning, PCF is not widely implemented in practice. Therefore, in this paper, we study the performance of the dominant DCF in various scenarios. To date most research work in the literature (e.g., (2)-(4)) focuses on the study of DCF performance in the saturation case, in which every station in the network always has frames waiting for transmission. However, when there are more than In this paper, we first propose an analytical model to study the DCF throughput and average MAC service time under various load conditions for a single traffic type. It is based on the fundamental relationship between the mean MAC service time and the mean traffic arrival rate, and thus applicable to general traffic arrival processes. The proposed model improves the one in (10) in several aspects such as more accurate calculation of the average backoff time and the average number of transmission trials of a frame. Moreover, by comparing the obtained average MAC service time for a frame with the given average frame inter-arrival time, whether or not a station is in the saturated state can be accurately determined with the proposed model. The maximum number of stations that can be supported in such a network is also obtained. This information is critical to the design of admission control schemes that are usually adopted for QoS support in a network. It is worthy to note that this information cannot be readily obtained from the analysis of a saturation case. As VoIP over WLAN becomes more and more popular, it is instructive to study analytically the performance of DCF in a WLAN with mixed voice and data traffic. However, little work on this thread has been reported. In this paper, we carefully extend the proposed model to study the performance of DCF in such a situation. Using the extended model, the maximum number of voice
{"title":"Performance Analysis of IEEE 802.11 DCF with Heterogeneous Traffic","authors":"Xinhua Ling, L. Cai, J. Mark, Xuemin Shen","doi":"10.1109/CCNC.2007.17","DOIUrl":"https://doi.org/10.1109/CCNC.2007.17","url":null,"abstract":"An analytical model is proposed for the perfor- mance study of IEEE 802.11 distributed coordination function (DCF) with finite traffic load. Based on the model, average medium access control (MAC) sublayer service time of a frame and channel throughput are obtained. The model is further extended for the performance analysis of DCF with mixed voice and data traffic. The maximum number of voice connections supported in IEEE 802.11 WLAN under various background data traffic is derived. The results are useful for effective call admission control in IEEE 802.11 WLAN. Extensive simulations are performed to validate our analysis. I. INTRODUCTION The IEEE 802.11 standard (1) has been widely deployed around the world. Its medium access control (MAC) sublayer specifies two modes, the mandatory distributed coordination function (DCF) and the optional point coordination function (PCF). DCF is a distributed random access mechanism that is suitable for ad hoc networks, while PCF is a centralized polling based mechanism that can only work in infrastructure- based wireless LANs (WLANs). Due to its inefficient polling schemes and limited Quality-of-Service (QoS) provisioning, PCF is not widely implemented in practice. Therefore, in this paper, we study the performance of the dominant DCF in various scenarios. To date most research work in the literature (e.g., (2)-(4)) focuses on the study of DCF performance in the saturation case, in which every station in the network always has frames waiting for transmission. However, when there are more than In this paper, we first propose an analytical model to study the DCF throughput and average MAC service time under various load conditions for a single traffic type. It is based on the fundamental relationship between the mean MAC service time and the mean traffic arrival rate, and thus applicable to general traffic arrival processes. The proposed model improves the one in (10) in several aspects such as more accurate calculation of the average backoff time and the average number of transmission trials of a frame. Moreover, by comparing the obtained average MAC service time for a frame with the given average frame inter-arrival time, whether or not a station is in the saturated state can be accurately determined with the proposed model. The maximum number of stations that can be supported in such a network is also obtained. This information is critical to the design of admission control schemes that are usually adopted for QoS support in a network. It is worthy to note that this information cannot be readily obtained from the analysis of a saturation case. As VoIP over WLAN becomes more and more popular, it is instructive to study analytically the performance of DCF in a WLAN with mixed voice and data traffic. However, little work on this thread has been reported. In this paper, we carefully extend the proposed model to study the performance of DCF in such a situation. Using the extended model, the maximum number of voice","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"78 S13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132228459","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}
Component-based software architectures are being used more and more often in industry, creating new kinds of dynamic business relationships between the integrators and their partners in developing the components. In this kind of business it is especially important to ensure that both the components and the co-operation partners are trustworthy. One method of component trust management is to include in the software architecture functions that take care of loading and updating the components, and monitor their trustworthy operation. We introduce a novel trust management framework for the middleware layer and demonstrate its functionality using embedded software components. We explain the functionality of our trust management system and demonstrate its application in managing software components and utilizing database services for both management of component properties and delivery of new components from trusted sources.
{"title":"Automated Trustworthiness Management for Database Software Components","authors":"R. Savola, J. Palo","doi":"10.1109/CCNC.2007.242","DOIUrl":"https://doi.org/10.1109/CCNC.2007.242","url":null,"abstract":"Component-based software architectures are being used more and more often in industry, creating new kinds of dynamic business relationships between the integrators and their partners in developing the components. In this kind of business it is especially important to ensure that both the components and the co-operation partners are trustworthy. One method of component trust management is to include in the software architecture functions that take care of loading and updating the components, and monitor their trustworthy operation. We introduce a novel trust management framework for the middleware layer and demonstrate its functionality using embedded software components. We explain the functionality of our trust management system and demonstrate its application in managing software components and utilizing database services for both management of component properties and delivery of new components from trusted sources.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114593598","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}
Many Interactive Voice Response (IVR) systems use the popular VoiceXML standard for managing vocal dialogs. For call control aspects, such systems often use the Session Initiation Protocol (SIP) or a similar protocol. W3C is currently developing a new Call Control eXtensible Markup Language (CCXML) standard, at a higher abstraction level than SIP and which could hide the latter in order to accelerate the development of complex VoIP solutions that have an IVR component. But will this really be the case? This paper presents a comparative study base on a simple Personal Assistant system. Although there are undeniable benefits to a CCXML-VoiceXML approach, many observations and lessons lead us to believe that developers will face several limitations and potential pitfalls.
{"title":"Combining VoiceXML with CCXML: A Comparative Study","authors":"Daniel Amyot, Renato Simões","doi":"10.1109/CCNC.2007.74","DOIUrl":"https://doi.org/10.1109/CCNC.2007.74","url":null,"abstract":"Many Interactive Voice Response (IVR) systems use the popular VoiceXML standard for managing vocal dialogs. For call control aspects, such systems often use the Session Initiation Protocol (SIP) or a similar protocol. W3C is currently developing a new Call Control eXtensible Markup Language (CCXML) standard, at a higher abstraction level than SIP and which could hide the latter in order to accelerate the development of complex VoIP solutions that have an IVR component. But will this really be the case? This paper presents a comparative study base on a simple Personal Assistant system. Although there are undeniable benefits to a CCXML-VoiceXML approach, many observations and lessons lead us to believe that developers will face several limitations and potential pitfalls.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115804928","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}
A global energy efficient wireless sensor network data routing protocol typically uses few suitably located sensors to relay other sensors' data. These overused sensors reasonably consume more energy and become inactive earlier. Some other sensors then take their role of relaying other sensors' data. At some point in this cycle, a sensor with sufficient energy to sense and communicate can be disconnected from the network for not having any active sensor within its transmission range. If the used data routing protocol is modified such that a sensor is connected as long as it has sufficient energy then the actual energy efficiency of the data routing protocol will be compromised. In this paper, our proposed approach modifies an existing data routing protocol that minimizes the total energy consumption of all sensors. Our modification fulfils the connectivity requirement without compromising the existing energy efficiency of the data routing protocol.
{"title":"Optimizing a Data Routing Protocol's Influence on Communication Connectivity","authors":"A. F. M. Moshiur Rahman, S. Hussain","doi":"10.1109/CCNC.2007.123","DOIUrl":"https://doi.org/10.1109/CCNC.2007.123","url":null,"abstract":"A global energy efficient wireless sensor network data routing protocol typically uses few suitably located sensors to relay other sensors' data. These overused sensors reasonably consume more energy and become inactive earlier. Some other sensors then take their role of relaying other sensors' data. At some point in this cycle, a sensor with sufficient energy to sense and communicate can be disconnected from the network for not having any active sensor within its transmission range. If the used data routing protocol is modified such that a sensor is connected as long as it has sufficient energy then the actual energy efficiency of the data routing protocol will be compromised. In this paper, our proposed approach modifies an existing data routing protocol that minimizes the total energy consumption of all sensors. Our modification fulfils the connectivity requirement without compromising the existing energy efficiency of the data routing protocol.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121540336","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}
Cognitive Radio (CR) can effectively reuse the same frequency of the existing legacy systems with the help of the adaptivity provided by the software defined radio technique and the intelligence learned by sensing the huge spectrum in the surrounding environment. One fundamental issue for a CR network is how CR users establish an overlaying ad hoc link on licensed and unlicensed bands. On licensed band, the CR user has to detect the presence of the primary user and vacate accordingly to avoid the interference. On the unlicensed band, the medium access shall support the quality of service (QoS) as well as improving the efficiency and fairness for the spectrum usage. In this paper, by moderately reshaping the legacy carrier sense multiple access (CSMA) medium access control (MAC) protocol, we propose a cognitive and distributive MAC protocol to establish a CR ad hoc network with QoS provisioning, high efficiency and fairness. Through the simulations by NS-2, the proposed cognitive MAC protocol can improve throughput by 50% compared to the legacy carrier sense multiple access with collision avoidance (CSMA/CA) MAC protocol, while keeping the dropping rate less than 2% for delay-sensitive applications.
认知无线电(CR)利用软件无线电技术提供的自适应能力和感知周围环境中巨大频谱的智能，可以有效地重用现有遗留系统的相同频率。CR网络的一个基本问题是CR用户如何在许可和未许可频带上建立覆盖自组织链路。在许可频带上，CR用户必须检测到主用户的存在，并相应地退出以避免干扰。在免授权频段上，介质接入既要支持业务质量(QoS)，又要提高频谱使用的效率和公平性。本文通过对传统载波感知多址(CSMA)介质访问控制(MAC)协议的适度改造，提出了一种认知和分布式MAC协议，以建立具有QoS提供、高效率和公平性的CR自组织网络。通过NS-2的仿真，与传统的CSMA/CA (carrier - sense multiple access with collision avoidance) MAC协议相比，所提出的认知MAC协议的吞吐量提高了50%，同时对于延迟敏感应用，丢包率保持在2%以下。
{"title":"A Cognitive MAC Protocol for QoS Provisioning in Overlaying Ad Hoc Networks","authors":"Li-Chun Wang, Anderson Chen, David S. L. Wei","doi":"10.1109/CCNC.2007.229","DOIUrl":"https://doi.org/10.1109/CCNC.2007.229","url":null,"abstract":"Cognitive Radio (CR) can effectively reuse the same frequency of the existing legacy systems with the help of the adaptivity provided by the software defined radio technique and the intelligence learned by sensing the huge spectrum in the surrounding environment. One fundamental issue for a CR network is how CR users establish an overlaying ad hoc link on licensed and unlicensed bands. On licensed band, the CR user has to detect the presence of the primary user and vacate accordingly to avoid the interference. On the unlicensed band, the medium access shall support the quality of service (QoS) as well as improving the efficiency and fairness for the spectrum usage. In this paper, by moderately reshaping the legacy carrier sense multiple access (CSMA) medium access control (MAC) protocol, we propose a cognitive and distributive MAC protocol to establish a CR ad hoc network with QoS provisioning, high efficiency and fairness. Through the simulations by NS-2, the proposed cognitive MAC protocol can improve throughput by 50% compared to the legacy carrier sense multiple access with collision avoidance (CSMA/CA) MAC protocol, while keeping the dropping rate less than 2% for delay-sensitive applications.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125256367","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 : 2005-10-01DOI: 10.1093/ietcom/e88-b.10.4117
Mingxin Luo, Qinye Yin, Aifeng Ren
We propose a DOA-Matrix based blind CFO estimation method for a MIMO-OFDM system with Virtual Carriers. The method estimates CFO in closed-form by jointly exploiting the shift-invariant structure of time-domain signal received on multiple receive antennas. In contrast to previous training-based methods, the proposed method is bandwidth efficiency. We also present numerical simulation results for different transmit and receive antenna configurations and for different record lengths.
{"title":"Blind Carrier Frequency Offset Estimation in Mimo-Ofdm without Virtual Carriers","authors":"Mingxin Luo, Qinye Yin, Aifeng Ren","doi":"10.1093/ietcom/e88-b.10.4117","DOIUrl":"https://doi.org/10.1093/ietcom/e88-b.10.4117","url":null,"abstract":"We propose a DOA-Matrix based blind CFO estimation method for a MIMO-OFDM system with Virtual Carriers. The method estimates CFO in closed-form by jointly exploiting the shift-invariant structure of time-domain signal received on multiple receive antennas. In contrast to previous training-based methods, the proposed method is bandwidth efficiency. We also present numerical simulation results for different transmit and receive antenna configurations and for different record lengths.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123780888","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}
Adaptive-ness of multicast stream is a strongly desired for P2P multicast to be accepted broadly on the Internet. One way to achieve this is use the layered multicast technique. But it was pointed out that there are obstacles to apply it on the Internet. In this paper, we apply TFRC (TCP Friendly Rate Control) scheme onto XCAST, while TFRC is considered basically for unicast. As a proof of concept, we have implemented TFRC with XCAST onto DVTS and we were able to confirm that they achieve necessary characteristics for P2P multicast such as stability, flexibility, fairness and smoothness. These characteristics were independently observed for each sub-path of XCAST tree.
{"title":"DVTS/XCAST with TCP-Friendly Rate Control","authors":"Yuji Imai, H. Kishimoto","doi":"10.1109/CCNC.2007.224","DOIUrl":"https://doi.org/10.1109/CCNC.2007.224","url":null,"abstract":"Adaptive-ness of multicast stream is a strongly desired for P2P multicast to be accepted broadly on the Internet. One way to achieve this is use the layered multicast technique. But it was pointed out that there are obstacles to apply it on the Internet. In this paper, we apply TFRC (TCP Friendly Rate Control) scheme onto XCAST, while TFRC is considered basically for unicast. As a proof of concept, we have implemented TFRC with XCAST onto DVTS and we were able to confirm that they achieve necessary characteristics for P2P multicast such as stability, flexibility, fairness and smoothness. These characteristics were independently observed for each sub-path of XCAST tree.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"663 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123050152","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
扫码关注我们
求助内容：
应助结果提醒方式：