The area of trustworthy charging in self-organized environments has been developed quite recently. This paper introduces a new secure charging-protocol, the polynomial-assisted charging protocol, for these environments. The protocol relies on polynomial composition for speeding the identification process in small groups. This protocol is able to provide strict guarantees of cooperative behavior in traffic forwarding, with minimal network overhead. Protocol performance is evaluated in multiple ad-hoc environments and results are compared with previously proposed work. The performance results show the merits of this protocol in multiple types of environments.
{"title":"The polynomial-assisted ad-hoc charging protocol","authors":"J. Barraca, S. Sargento, R. Aguiar","doi":"10.1109/ISCC.2005.145","DOIUrl":"https://doi.org/10.1109/ISCC.2005.145","url":null,"abstract":"The area of trustworthy charging in self-organized environments has been developed quite recently. This paper introduces a new secure charging-protocol, the polynomial-assisted charging protocol, for these environments. The protocol relies on polynomial composition for speeding the identification process in small groups. This protocol is able to provide strict guarantees of cooperative behavior in traffic forwarding, with minimal network overhead. Protocol performance is evaluated in multiple ad-hoc environments and results are compared with previously proposed work. The performance results show the merits of this protocol in multiple types of environments.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527537","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}
We consider the problem of determining the outage probability in cellular systems where each of the links is lognormal-shadowed, Weibull-faded and corrupted by additive noise. We propose two solutions for this problem; a simple lower bound on the outage probability based on the concavity of the logarithmic function and an approximate expression based on the use of the central limit theorem. The approximate expression is slightly more complicated than the lower bound but provides a better accuracy for most of the parameters values. We verify the accuracy of the proposed expressions by comparing them to the outage probability obtained by means of Monte Carlo simulations.
{"title":"Outage probability analysis in cellular systems with noisy Weibull-faded lognormal-shadowed links","authors":"M. H. Ismail, M. Matalgah","doi":"10.1109/ISCC.2005.117","DOIUrl":"https://doi.org/10.1109/ISCC.2005.117","url":null,"abstract":"We consider the problem of determining the outage probability in cellular systems where each of the links is lognormal-shadowed, Weibull-faded and corrupted by additive noise. We propose two solutions for this problem; a simple lower bound on the outage probability based on the concavity of the logarithmic function and an approximate expression based on the use of the central limit theorem. The approximate expression is slightly more complicated than the lower bound but provides a better accuracy for most of the parameters values. We verify the accuracy of the proposed expressions by comparing them to the outage probability obtained by means of Monte Carlo simulations.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123126578","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}
The paper proposes an energy-aware contention-based protocol for the medium access control (MAC) sub-layer for wireless sensor networks. The innovative approach with frequent sleeps proactively and aggressively reduces the wasted energy while increasing the throughput and decreasing the latency. The proposed MAC protocol solves the energy inefficiency caused by idle listening, control-packet overhead, and overhearing. Simulation experiments have been performed to demonstrate the effectiveness of the proposed approach, especially compared to the S-MAC and T-MAC protocols.
{"title":"An energy-aware medium-access-control protocol with frequent sleeps for wireless sensor networks","authors":"C. K. Nguyen, Anup Kumar","doi":"10.1109/ISCC.2005.26","DOIUrl":"https://doi.org/10.1109/ISCC.2005.26","url":null,"abstract":"The paper proposes an energy-aware contention-based protocol for the medium access control (MAC) sub-layer for wireless sensor networks. The innovative approach with frequent sleeps proactively and aggressively reduces the wasted energy while increasing the throughput and decreasing the latency. The proposed MAC protocol solves the energy inefficiency caused by idle listening, control-packet overhead, and overhearing. Simulation experiments have been performed to demonstrate the effectiveness of the proposed approach, especially compared to the S-MAC and T-MAC protocols.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"66 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114086005","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}
Much work has been done on IPv6 standards and testbeds deployment. However, little is known about the performance of the real IPv6 Internet, especially from the perspective of end users. In this paper, we present a measurement study of current IPv6 performance conducted from CERNET. We study 585, 680 packet-level traces with 133,340 million packets collected from 936 IPv4/IPv6 dual-stack Web servers located in 44 countries. We present a comprehensive performance comparison of IPv6 and IPv4, including connectivity, packet loss rate, round-trip time, etc. Our measurement results show that IPv6 connections tend to have smaller RTTs than their IPv4 counterparts, but suffer higher packet loss rate at the same time. We also notice that tunneled paths do not show notable performance degradation compared with native paths. To our best knowledge, this paper is the first performance study based on both large scale TCP and ICMP traffic measurement in real IPv6 Internet.
{"title":"Understanding current IPv6 performance: a measurement study","authors":"Yi Wang, Shaozhi Ye, Xing Li","doi":"10.1109/ISCC.2005.151","DOIUrl":"https://doi.org/10.1109/ISCC.2005.151","url":null,"abstract":"Much work has been done on IPv6 standards and testbeds deployment. However, little is known about the performance of the real IPv6 Internet, especially from the perspective of end users. In this paper, we present a measurement study of current IPv6 performance conducted from CERNET. We study 585, 680 packet-level traces with 133,340 million packets collected from 936 IPv4/IPv6 dual-stack Web servers located in 44 countries. We present a comprehensive performance comparison of IPv6 and IPv4, including connectivity, packet loss rate, round-trip time, etc. Our measurement results show that IPv6 connections tend to have smaller RTTs than their IPv4 counterparts, but suffer higher packet loss rate at the same time. We also notice that tunneled paths do not show notable performance degradation compared with native paths. To our best knowledge, this paper is the first performance study based on both large scale TCP and ICMP traffic measurement in real IPv6 Internet.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116059451","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}
The paper proposes a distributed spatial reuse (DSR) MAC protocol for IEEE 802.11 ad-hoc wireless LANs (WLANs) to increase bandwidth utilization and reduce power consumption. Through power control, the communications that do not interfere with each other can transmit simultaneously. Therefore, the overall efficiency and effectiveness of IEEE 802.11 ad-hoc WLANs can be enhanced. DSR allows the maximum number of interference-free communication pairs to transmit in parallel without collisions. According to the experiment results, DSR is much better than traditional WLAN protocol, IEEE 802.11 DCF, and the related work. The protocol indeed can effectively enhance the overall WLANs efficiency.
{"title":"A distributed spatial reuse (DSR) MAC protocol for IEEE 802.11 ad-hoc wireless LANs","authors":"K. Shih, Chien-Min Chou, Mu-Ying Lu, Szu-Min Chen","doi":"10.1109/ISCC.2005.9","DOIUrl":"https://doi.org/10.1109/ISCC.2005.9","url":null,"abstract":"The paper proposes a distributed spatial reuse (DSR) MAC protocol for IEEE 802.11 ad-hoc wireless LANs (WLANs) to increase bandwidth utilization and reduce power consumption. Through power control, the communications that do not interfere with each other can transmit simultaneously. Therefore, the overall efficiency and effectiveness of IEEE 802.11 ad-hoc WLANs can be enhanced. DSR allows the maximum number of interference-free communication pairs to transmit in parallel without collisions. According to the experiment results, DSR is much better than traditional WLAN protocol, IEEE 802.11 DCF, and the related work. The protocol indeed can effectively enhance the overall WLANs efficiency.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116668642","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}
Transport of compressed video is expected to pervade computer networks in the near future. Video is commonly encoded in variable bit rate traffic to improve video quality and reduce encoding delays and yet to make efficient use of the available capacity using statistical multiplexing. Variable bit rate coded video imposes a real challenge to network planners who aim to evaluate its necessary capacity share. In this paper, we present a dimensioning model tailored especially for variable bit rate video transmission over IP networks taking the network delay into account unlike existing dimensioning models. We investigate this new model in terms of different system parameters.
{"title":"Capacity assignment for video traffic in multiservice IP networks with statistical QoS guarantees","authors":"S. Sharafeddine, Z. Dawy","doi":"10.1109/ISCC.2005.41","DOIUrl":"https://doi.org/10.1109/ISCC.2005.41","url":null,"abstract":"Transport of compressed video is expected to pervade computer networks in the near future. Video is commonly encoded in variable bit rate traffic to improve video quality and reduce encoding delays and yet to make efficient use of the available capacity using statistical multiplexing. Variable bit rate coded video imposes a real challenge to network planners who aim to evaluate its necessary capacity share. In this paper, we present a dimensioning model tailored especially for variable bit rate video transmission over IP networks taking the network delay into account unlike existing dimensioning models. We investigate this new model in terms of different system parameters.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116723499","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 primary security challenges of the mobile agent paradigm is that of protecting the result of computation carried out by a mobile agent against an attack by a malicious host. There are various proposals that appeared in the literature. Beside their benefits, a well-known vulnerability of their technique is the collusion attack. The collusion attack mainly considered in this paper is the two colluders truncation attack, which could be engendered by the leakage of a one time private key. This paper demonstrates the prevention of the two colluders truncation attack, the detection of other forms of collusion attacks, and the identification of the malicious host. The proposed protocol incorporates and extends the notion of publicly verified chained signature (G. Karjoth, et al., 1998) by using a list of route information and a trusted third party to generate a one time public/private key pair.
{"title":"A new approach for computation result protection in the mobile agent paradigm","authors":"Suphithat Songsiri","doi":"10.1109/ISCC.2005.14","DOIUrl":"https://doi.org/10.1109/ISCC.2005.14","url":null,"abstract":"One of the primary security challenges of the mobile agent paradigm is that of protecting the result of computation carried out by a mobile agent against an attack by a malicious host. There are various proposals that appeared in the literature. Beside their benefits, a well-known vulnerability of their technique is the collusion attack. The collusion attack mainly considered in this paper is the two colluders truncation attack, which could be engendered by the leakage of a one time private key. This paper demonstrates the prevention of the two colluders truncation attack, the detection of other forms of collusion attacks, and the identification of the malicious host. The proposed protocol incorporates and extends the notion of publicly verified chained signature (G. Karjoth, et al., 1998) by using a list of route information and a trusted third party to generate a one time public/private key pair.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125619170","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}
Bart De Vleeschauwer, F. Turck, B. Dhoedt, P. Demeester
With the deployment of broadband Internet access, a new set of applications that is becoming more and more popular are highly interactive services such as online gaming. When the delay experienced in an online game passes a certain threshold, the quality of service (QoS) degrades enormously, as a result the clients are no longer satisfied and might decide to leave the game or to cancel the subscription. Thus, delay is critical to the success of this type of service. Network delay is a result of the way the data is distributed between the players. In this paper we propose the use of a set of game servers. These servers not only play the role of a traditional game server but also form an overlay network which can be used as an application layer routing infrastructure, allowing us to route along low delay paths and thereby increasing the QoS of the game. We study algorithms that determine the ideal location of the servers in a network and look at the performance of the resulting overlay networks in terms of end-to-end delay and the relationship between the number of servers in the overlay network and the offered QoS. We also compare our distributed architecture with both a single server and a peer-to-peer architecture.
{"title":"Server placement algorithms for the construction of a QoS enabled gaming infrastructure","authors":"Bart De Vleeschauwer, F. Turck, B. Dhoedt, P. Demeester","doi":"10.1109/ISCC.2005.137","DOIUrl":"https://doi.org/10.1109/ISCC.2005.137","url":null,"abstract":"With the deployment of broadband Internet access, a new set of applications that is becoming more and more popular are highly interactive services such as online gaming. When the delay experienced in an online game passes a certain threshold, the quality of service (QoS) degrades enormously, as a result the clients are no longer satisfied and might decide to leave the game or to cancel the subscription. Thus, delay is critical to the success of this type of service. Network delay is a result of the way the data is distributed between the players. In this paper we propose the use of a set of game servers. These servers not only play the role of a traditional game server but also form an overlay network which can be used as an application layer routing infrastructure, allowing us to route along low delay paths and thereby increasing the QoS of the game. We study algorithms that determine the ideal location of the servers in a network and look at the performance of the resulting overlay networks in terms of end-to-end delay and the relationship between the number of servers in the overlay network and the offered QoS. We also compare our distributed architecture with both a single server and a peer-to-peer architecture.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122467768","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}
Mobile networks are requested to provide several added value services with different QoS levels. An efficient call admission control (CAC) is one of the strategic components that a network management policy requires, which defines how to allocate network resources to roaming and new users. We assume a hierarchical network architecture constituted of several cellular IP regions which may communicate each other accessing the Internet through a Mobile IP protocol. In such scenario, we demonstrate the importance of CAC not only in the ingress wireless points, but in the wired network too. An integrated approach to CAC is then proposed whose advantages are shown through simulation analysis.
移动网络被要求提供多种具有不同QoS级别的增值业务。有效的call admission control (CAC)是网络管理策略的一个重要组成部分，它定义了如何将网络资源分配给漫游用户和新用户。我们假设一个分层的网络体系结构，由几个蜂窝IP区域组成，这些区域可以通过移动IP协议访问互联网相互通信。在这种情况下，我们证明了CAC不仅在入口无线点，而且在有线网络中的重要性。在此基础上，提出了一种集成的CAC方法，并通过仿真分析证明了该方法的优越性。
{"title":"Call admission control in hierarchical mobile networks","authors":"Dario Bruneo, L. Paladina, M. Paone, A. Puliafito","doi":"10.1109/ISCC.2005.40","DOIUrl":"https://doi.org/10.1109/ISCC.2005.40","url":null,"abstract":"Mobile networks are requested to provide several added value services with different QoS levels. An efficient call admission control (CAC) is one of the strategic components that a network management policy requires, which defines how to allocate network resources to roaming and new users. We assume a hierarchical network architecture constituted of several cellular IP regions which may communicate each other accessing the Internet through a Mobile IP protocol. In such scenario, we demonstrate the importance of CAC not only in the ingress wireless points, but in the wired network too. An integrated approach to CAC is then proposed whose advantages are shown through simulation analysis.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132692599","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}
Properly reacting to congestion is known to be a requirement for maintaining the stability of the Internet; in addition, UDP based applications should do so for their own sake if they are delay- or loss-sensitive. We measured the responsiveness of the three popular streaming media applications RealPlayer, Windows MediaPIayer and Quicktime with a varying amount of cross traffic and present a comparison of the results.
众所周知，对拥塞作出适当反应是维护互联网稳定的必要条件;此外，如果基于UDP的应用程序对延迟或丢失敏感，则应该这样做。我们测量了三个流行的流媒体应用程序RealPlayer, Windows MediaPIayer和Quicktime在不同数量的交叉流量下的响应性，并给出了结果的比较。
{"title":"An empirical study of the congestion response of RealPlayer, Windows MediaPlayer and Quicktime","authors":"Sven Hessler, M. Welzl","doi":"10.1109/ISCC.2005.25","DOIUrl":"https://doi.org/10.1109/ISCC.2005.25","url":null,"abstract":"Properly reacting to congestion is known to be a requirement for maintaining the stability of the Internet; in addition, UDP based applications should do so for their own sake if they are delay- or loss-sensitive. We measured the responsiveness of the three popular streaming media applications RealPlayer, Windows MediaPIayer and Quicktime with a varying amount of cross traffic and present a comparison of the results.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117260480","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
扫码关注我们
求助内容：
应助结果提醒方式：