Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317972
Yao-Min Huang, Jin-Jang Leou, M. Cheng
For very low bit rate video coding, coarse-quantized DCT coefficients induce discontinuities at block boundaries, namely, blocking artifacts. Furthermore, motion-compensated prediction propagates blocking artifacts to inner-block regions of subsequent video frames. Blocking artifacts caused by motion-compensated prediction (MCP) can be solved by a loop-filter. The main drawback of loop-filter is its in-flexibility. In this study, a post deblocking filter for H.264 video is proposed. In this study, to estimate inner-block discontinuities, a motion-compensated based approach is proposed. A map of detected blocking artifacts within each video frame is stored. Combining motion vectors and blocking artifact maps of previous frames, possible locations of blocking artifacts can be estimated. Cooperating with oriented blocking artifact detection and filtering, a post deblocking filter having loop-filter performance is established. The proposed approach can also used in other DCT/MCP based codecs.
{"title":"A Post Deblocking Filter for H.264 Video","authors":"Yao-Min Huang, Jin-Jang Leou, M. Cheng","doi":"10.1109/ICCCN.2007.4317972","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317972","url":null,"abstract":"For very low bit rate video coding, coarse-quantized DCT coefficients induce discontinuities at block boundaries, namely, blocking artifacts. Furthermore, motion-compensated prediction propagates blocking artifacts to inner-block regions of subsequent video frames. Blocking artifacts caused by motion-compensated prediction (MCP) can be solved by a loop-filter. The main drawback of loop-filter is its in-flexibility. In this study, a post deblocking filter for H.264 video is proposed. In this study, to estimate inner-block discontinuities, a motion-compensated based approach is proposed. A map of detected blocking artifacts within each video frame is stored. Combining motion vectors and blocking artifact maps of previous frames, possible locations of blocking artifacts can be estimated. Cooperating with oriented blocking artifact detection and filtering, a post deblocking filter having loop-filter performance is established. The proposed approach can also used in other DCT/MCP based codecs.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128029503","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317968
D. Messina, M. Ortolani, G. Re
This paper proposes a network-layer protocol for wireless sensor networks based on the IEEE 802.15.4 standard. Our protocol is devised to provide reliable data gathering in latency-constrained applications, and exploits both the flexibility of the IEEE 802.15.4 MAC layer and features of data aggregation techniques, such as implicit acknowledgment of reception. The proposed protocol acts as a routing module and a control entity for the MAC layer and provides reliable communication, while managing power saving and synchronization among nodes. Without relying on MAC-layer acknowledgments, the protocol implements caching and network-layer retransmissions, triggered upon detection of a link failure. The performance of the proposed approach is studied through simulations, in which we evaluate the achieved reliability and the energy consumption with varying network settings.
{"title":"Achieving Robustness through Caching and Retransmissions in IEEE 802.15.4-based WSNs","authors":"D. Messina, M. Ortolani, G. Re","doi":"10.1109/ICCCN.2007.4317968","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317968","url":null,"abstract":"This paper proposes a network-layer protocol for wireless sensor networks based on the IEEE 802.15.4 standard. Our protocol is devised to provide reliable data gathering in latency-constrained applications, and exploits both the flexibility of the IEEE 802.15.4 MAC layer and features of data aggregation techniques, such as implicit acknowledgment of reception. The proposed protocol acts as a routing module and a control entity for the MAC layer and provides reliable communication, while managing power saving and synchronization among nodes. Without relying on MAC-layer acknowledgments, the protocol implements caching and network-layer retransmissions, triggered upon detection of a link failure. The performance of the proposed approach is studied through simulations, in which we evaluate the achieved reliability and the energy consumption with varying network settings.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"67 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132782485","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4318009
Qingsheng Zhang, Yong Qi, Jizhong Zhao, Di Hou, Tianhai Zhao, Liang Liu
By using personal information in a pervasive computing environment, context-aware applications can provide appropriate services for people. This personal information is often involved in personal privacy. In order to protect personal privacy concerns about personal information, privacy role is proposed to control access personal information. We also construct an information system about the privacy decision of personal information disclosure based on people's interaction history. In the initial period of personal information disclosure, the privacy decision is made by people and the information system is constructed based on the decision data. Then privacy disclosure policies are extracted from this information system using rough set theory. According to deducing from the privacy disclosure policies and people's context information, the context-aware application is assigned to an adequate privacy role. It reduces the distraction of privacy decision for people. A case study further shows the proposed method is effective. Finally, it provides about the overload performance of privacy role analysis engine.
{"title":"A Study on Context-aware Privacy Protection for Personal Information","authors":"Qingsheng Zhang, Yong Qi, Jizhong Zhao, Di Hou, Tianhai Zhao, Liang Liu","doi":"10.1109/ICCCN.2007.4318009","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4318009","url":null,"abstract":"By using personal information in a pervasive computing environment, context-aware applications can provide appropriate services for people. This personal information is often involved in personal privacy. In order to protect personal privacy concerns about personal information, privacy role is proposed to control access personal information. We also construct an information system about the privacy decision of personal information disclosure based on people's interaction history. In the initial period of personal information disclosure, the privacy decision is made by people and the information system is constructed based on the decision data. Then privacy disclosure policies are extracted from this information system using rough set theory. According to deducing from the privacy disclosure policies and people's context information, the context-aware application is assigned to an adequate privacy role. It reduces the distraction of privacy decision for people. A case study further shows the proposed method is effective. Finally, it provides about the overload performance of privacy role analysis engine.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131769893","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317780
V. Bhargava
The cognitive radio technology will allow a group of potential users to identify and access available spectrum resources provided that the interference to users for whom the band has been licensed is kept below a prescribed level. This research area is at an early stage because various research challenges have to be addressed and solved. In this talk we present an overview of some research issues for cognitive radio networks. Specifically, we present some research and developments in cognitive radio networks with focus on: i) information-theoretic aspects, ii) spectrum sensing, iii) link adaptation, iv) advanced transceiver design, and v) admission control. We discuss research problems related to these specific topics that need to be discussed before deployment of cognitive radio systems. The presentation concludes with a rendition of "Ya Moustafa, Ya Moustafa" and its relation to cognitive radios!
认知无线电技术将允许一组潜在用户识别和访问可用的频谱资源，前提是对已获得频段许可的用户的干扰保持在规定水平以下。这个研究领域还处于早期阶段，因为各种各样的研究挑战需要解决。在这次演讲中，我们概述了认知无线电网络的一些研究问题。具体来说，我们介绍了认知无线电网络的一些研究和发展，重点是:i)信息理论方面，ii)频谱感知，iii)链路自适应，iv)先进的收发器设计，以及v)准入控制。我们讨论了在部署认知无线电系统之前需要讨论的与这些特定主题相关的研究问题。演讲以“Ya Moustafa, Ya Moustafa”及其与认知无线电的关系结束!
{"title":"Research Challenges in Cognitive Radio Networks","authors":"V. Bhargava","doi":"10.1109/ICCCN.2007.4317780","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317780","url":null,"abstract":"The cognitive radio technology will allow a group of potential users to identify and access available spectrum resources provided that the interference to users for whom the band has been licensed is kept below a prescribed level. This research area is at an early stage because various research challenges have to be addressed and solved. In this talk we present an overview of some research issues for cognitive radio networks. Specifically, we present some research and developments in cognitive radio networks with focus on: i) information-theoretic aspects, ii) spectrum sensing, iii) link adaptation, iv) advanced transceiver design, and v) admission control. We discuss research problems related to these specific topics that need to be discussed before deployment of cognitive radio systems. The presentation concludes with a rendition of \"Ya Moustafa, Ya Moustafa\" and its relation to cognitive radios!","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"27 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132285834","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317874
Rosanna Bova, Hye-young Paik, S. Hassas, S. Benbernou, B. Benatallah
With the proliferation of Web services, it is becoming increasingly important to support the users in selecting the most appropriate compositions of services for a task. We propose a new service discovery and selection framework that utilises the concept of task memories and a social network of task memories. A task memory captures the service composition history and their meta-data such as associated context and user rating. A network of task memories is formed to realise an effective task memory sharing platform among the users.
{"title":"WS-Advisor: A Task Memory for Service Composition Frameworks","authors":"Rosanna Bova, Hye-young Paik, S. Hassas, S. Benbernou, B. Benatallah","doi":"10.1109/ICCCN.2007.4317874","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317874","url":null,"abstract":"With the proliferation of Web services, it is becoming increasingly important to support the users in selecting the most appropriate compositions of services for a task. We propose a new service discovery and selection framework that utilises the concept of task memories and a social network of task memories. A task memory captures the service composition history and their meta-data such as associated context and user rating. A network of task memories is formed to realise an effective task memory sharing platform among the users.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134598558","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317806
K. Lin, Shuo-Chan Tsai, Yi-Ting Chang, Cheng-Fu Chou
Recently, peer-to-peer systems have become one of the most popular distributed applications. Many previous works have investigated identifier-based indexing systems that support a query-by-identifier service. However, clients usually have only partial information about an object, and prefer to query by keywords. In this paper, we propose a small-world-based keyword search system (SW-KSS) that provides keyword search and similarity search services simultaneously. The proposed SW-KSS applies the concept of the "small world theory" to the construction of an indexing structure. Such structures mirror the way humans keep track of their friends and acquaintances; hence, they can cluster peers who share common interests. The method enables a peer to And objects of interest from similar neighboring peers efficiently. We evaluate the performance of SW-KSS via simulations. The results show that SW-KSS can achieve both scalability and partial-match look-up capability.
{"title":"Enabling Search and Similarity Search in Small-World-based P2P Systems","authors":"K. Lin, Shuo-Chan Tsai, Yi-Ting Chang, Cheng-Fu Chou","doi":"10.1109/ICCCN.2007.4317806","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317806","url":null,"abstract":"Recently, peer-to-peer systems have become one of the most popular distributed applications. Many previous works have investigated identifier-based indexing systems that support a query-by-identifier service. However, clients usually have only partial information about an object, and prefer to query by keywords. In this paper, we propose a small-world-based keyword search system (SW-KSS) that provides keyword search and similarity search services simultaneously. The proposed SW-KSS applies the concept of the \"small world theory\" to the construction of an indexing structure. Such structures mirror the way humans keep track of their friends and acquaintances; hence, they can cluster peers who share common interests. The method enables a peer to And objects of interest from similar neighboring peers efficiently. We evaluate the performance of SW-KSS via simulations. The results show that SW-KSS can achieve both scalability and partial-match look-up capability.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115311799","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317918
Wei-Cheng Lin, C. Chen
This paper presents an approach that reuses data stored in the frame memory and in the motion estimation (ME) internal buffer to avoid unnecessary memory accesses and redundant ME computations for MPEG video encoders. This work employs a macroblock bitmap table, which can be easily maintained, to locate the reusable data. The experimental results show that the proposed scheme is particularly efficient in low motion video sequences, approximately saving 18% of the frame memory accesses as well as about 16% of the ME computations without any sacrifice in the image quality.
{"title":"Reduction of Frame Memory Accesses and Motion Estimation Computations in MPEG Video Encoder","authors":"Wei-Cheng Lin, C. Chen","doi":"10.1109/ICCCN.2007.4317918","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317918","url":null,"abstract":"This paper presents an approach that reuses data stored in the frame memory and in the motion estimation (ME) internal buffer to avoid unnecessary memory accesses and redundant ME computations for MPEG video encoders. This work employs a macroblock bitmap table, which can be easily maintained, to locate the reusable data. The experimental results show that the proposed scheme is particularly efficient in low motion video sequences, approximately saving 18% of the frame memory accesses as well as about 16% of the ME computations without any sacrifice in the image quality.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115544852","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317856
Sergey Gorinsky, Christoph Jechlitschek
File transfer, web download, and many other applications are primarily interested in minimal delay achievable for their messages. In this paper, we investigate allocating the bottleneck link capacity to transmit messages efficiently but fairly. While SRPT (Shortest Remaining Processing Time) is an optimally efficient algorithm that minimizes average delay of messages, large messages might starve under SRPT in heavy load conditions. PS (Processor Sharing) and ViFi (Virtual Finish Time First) are fair but yield higher average delays than under SRPT. We explore the class of fair algorithms further and prove that no online algorithm in this class is optimally efficient. Then, we derive a fair algorithm SFS (Shortest Fair Sojourn) and report extensive experimental evidence that SFS is consistently more efficient than PS and even ViFi during either temporal overload or steady-state operation, with largest benefits achieved when average load is around the bottleneck link capacity. Furthermore, average delay under the fair SFS remains close to the minimum attained under the unfair SRPT.
{"title":"Fair Efficiency, or Low Average Delay without Starvation","authors":"Sergey Gorinsky, Christoph Jechlitschek","doi":"10.1109/ICCCN.2007.4317856","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317856","url":null,"abstract":"File transfer, web download, and many other applications are primarily interested in minimal delay achievable for their messages. In this paper, we investigate allocating the bottleneck link capacity to transmit messages efficiently but fairly. While SRPT (Shortest Remaining Processing Time) is an optimally efficient algorithm that minimizes average delay of messages, large messages might starve under SRPT in heavy load conditions. PS (Processor Sharing) and ViFi (Virtual Finish Time First) are fair but yield higher average delays than under SRPT. We explore the class of fair algorithms further and prove that no online algorithm in this class is optimally efficient. Then, we derive a fair algorithm SFS (Shortest Fair Sojourn) and report extensive experimental evidence that SFS is consistently more efficient than PS and even ViFi during either temporal overload or steady-state operation, with largest benefits achieved when average load is around the bottleneck link capacity. Furthermore, average delay under the fair SFS remains close to the minimum attained under the unfair SRPT.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114460893","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317872
Jingwen Jin, Jin Liang, Jingyi Jin, K. Nahrstedt
Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalability by means of topology abstraction and routing state aggregation. The paper presents and solves several unique challenges associated with the hierarchical-based QoS service composition solution in overlay networks, including topology formation (cluster detection and dynamic reclustering), QoS and service state aggregation and distribution, and QoS service path computation in a hierarchically structured network topology. In our framework, we (1) cluster network nodes based on their Internet distances and maintain clustering optimality at low cost by means of local reclustering operations when dealing with dynamic membership; (2) use data clustering and Bloom filter techniques to jointly reduce complexity of data representation associated with services within a cluster; and (3) investigate a top-down approach for computing QoS service paths in a hierarchical topology.
{"title":"Large-Scale QoS-Aware Service-Oriented Networking with a Clustering-Based Approach","authors":"Jingwen Jin, Jin Liang, Jingyi Jin, K. Nahrstedt","doi":"10.1109/ICCCN.2007.4317872","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317872","url":null,"abstract":"Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalability by means of topology abstraction and routing state aggregation. The paper presents and solves several unique challenges associated with the hierarchical-based QoS service composition solution in overlay networks, including topology formation (cluster detection and dynamic reclustering), QoS and service state aggregation and distribution, and QoS service path computation in a hierarchically structured network topology. In our framework, we (1) cluster network nodes based on their Internet distances and maintain clustering optimality at low cost by means of local reclustering operations when dealing with dynamic membership; (2) use data clustering and Bloom filter techniques to jointly reduce complexity of data representation associated with services within a cluster; and (3) investigate a top-down approach for computing QoS service paths in a hierarchical topology.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114581427","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317960
R. Awdeh
When both TCP Vegas and TCP Reno share the same wired network, TCP Reno dominates and obtains most of the bandwidth due to its more aggressive mechanisms. In this paper, a simulation study of the compatibility of TCP Reno and TCP Vegas in wireless IEEE 802.11 ad hoc networks using both static and mobile network configurations, is presented. It is shown that when both coexist in the same static ad hoc network, TCP Vegas generally dominates and gets most of the wireless bandwidth. The main reason is that the static wireless ad hoc network environment does not favor the aggressive nature of TCP Reno. However, using a mobile network model, it is shown that TCP Reno is slightly more dominant than TCP Vegas. This is because TCP Vegas is more sensitive to node mobility and the resulting high variability of RTT caused by re-routing. This causes TCP Vegas to lose some of its advantages in mobile environments. In all scenarios examined, it is shown that better fairness can be achieved, while not sacrificing goodput performance, via the use of a small TCP maximum window size.
{"title":"Evaluating Fairness In Heterogeneous Wireless Ad Hoc Networks","authors":"R. Awdeh","doi":"10.1109/ICCCN.2007.4317960","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317960","url":null,"abstract":"When both TCP Vegas and TCP Reno share the same wired network, TCP Reno dominates and obtains most of the bandwidth due to its more aggressive mechanisms. In this paper, a simulation study of the compatibility of TCP Reno and TCP Vegas in wireless IEEE 802.11 ad hoc networks using both static and mobile network configurations, is presented. It is shown that when both coexist in the same static ad hoc network, TCP Vegas generally dominates and gets most of the wireless bandwidth. The main reason is that the static wireless ad hoc network environment does not favor the aggressive nature of TCP Reno. However, using a mobile network model, it is shown that TCP Reno is slightly more dominant than TCP Vegas. This is because TCP Vegas is more sensitive to node mobility and the resulting high variability of RTT caused by re-routing. This causes TCP Vegas to lose some of its advantages in mobile environments. In all scenarios examined, it is shown that better fairness can be achieved, while not sacrificing goodput performance, via the use of a small TCP maximum window size.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129958651","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
扫码关注我们
求助内容：
应助结果提醒方式：