The queueing delay or loss rate is usually used as the performance metric for the real-time multimedia applications. In this paper, to provide more suitable quality of services (QoS) requirements of some applications, we propose a new performance metric, junk rate, where junk is the packet which queueing delay exceeds its time threshold. The model of proportional junk rate differentiation is also constructed to provide the predictable and controllable ratio of junk rates for different classes. Three schedulers, namely, proportional junk rate scheduler with infinite memory, proportional junk rate scheduler with memory M, average junk distance scheduler, are proposed to achieve this model. Simulation results show that three schedulers actually yield this model well.
{"title":"Some schedulers to achieve proportional junk rate differentiation","authors":"Y. Lai, A. Chang","doi":"10.1109/ISCC.2005.138","DOIUrl":"https://doi.org/10.1109/ISCC.2005.138","url":null,"abstract":"The queueing delay or loss rate is usually used as the performance metric for the real-time multimedia applications. In this paper, to provide more suitable quality of services (QoS) requirements of some applications, we propose a new performance metric, junk rate, where junk is the packet which queueing delay exceeds its time threshold. The model of proportional junk rate differentiation is also constructed to provide the predictable and controllable ratio of junk rates for different classes. Three schedulers, namely, proportional junk rate scheduler with infinite memory, proportional junk rate scheduler with memory M, average junk distance scheduler, are proposed to achieve this model. Simulation results show that three schedulers actually yield this model well.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"25 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":"121427537","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}
J. Coppens, T. Wauters, F. Turck, B. Dhoedt, P. Demeester
Currently, a lot of research has been devoted to (i) content distribution, (ii) traffic engineering, (iii) network monitoring and (iv) service enabling platforms. However, the integration of these four individual concepts in a single platform has not yet been studied in enough detail. In this paper we present an architecture for such a robust content delivery service. The combination of both distributed replication of videos and multi-source traffic engineering tackles specific problems such as congested network parts, overloaded servers and the occurrence of flash crowds. Contrary to most existing systems, the content placement and retrieval algorithms in the presented CDN obtain precise network state information from an integrated monitoring system, allowing even a higher efficiency. To validate the performance of the CDN, an exact placement ILP formulation and various RPA heuristics are implemented and simulated.
{"title":"Evaluation of a monitoring-based architecture for delivery of high quality multimedia content","authors":"J. Coppens, T. Wauters, F. Turck, B. Dhoedt, P. Demeester","doi":"10.1109/ISCC.2005.68","DOIUrl":"https://doi.org/10.1109/ISCC.2005.68","url":null,"abstract":"Currently, a lot of research has been devoted to (i) content distribution, (ii) traffic engineering, (iii) network monitoring and (iv) service enabling platforms. However, the integration of these four individual concepts in a single platform has not yet been studied in enough detail. In this paper we present an architecture for such a robust content delivery service. The combination of both distributed replication of videos and multi-source traffic engineering tackles specific problems such as congested network parts, overloaded servers and the occurrence of flash crowds. Contrary to most existing systems, the content placement and retrieval algorithms in the presented CDN obtain precise network state information from an integrated monitoring system, allowing even a higher efficiency. To validate the performance of the CDN, an exact placement ILP formulation and various RPA heuristics are implemented and simulated.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"8 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":"115776621","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 use of superpeers has been proposed to improve the performance of both structured and unstructured peer-to-peer (P2P) networks. In this paper, we study the performance of Yao-graph based superpeer topologies for hierarchical P2P networks. Since a Yao-graph is defined as a geometric structure, we are using the "highways" proximity clustering and placement scheme to assign geometric co-ordinates to superpeers and peers with respect to the underlying network conditions. Because of the lightweight structure of Yao-graphs, the resulting hierarchical P2P networks have promising properties with regard to scalability and performance, while still offering the benefits of the P2P approach with regard to resiliency.
{"title":"Hierarchical peer-to-peer networks using lightweight superpeer topologies","authors":"M. Kleis, E. Lua, Xiaoming Zhou","doi":"10.1109/ISCC.2005.78","DOIUrl":"https://doi.org/10.1109/ISCC.2005.78","url":null,"abstract":"The use of superpeers has been proposed to improve the performance of both structured and unstructured peer-to-peer (P2P) networks. In this paper, we study the performance of Yao-graph based superpeer topologies for hierarchical P2P networks. Since a Yao-graph is defined as a geometric structure, we are using the \"highways\" proximity clustering and placement scheme to assign geometric co-ordinates to superpeers and peers with respect to the underlying network conditions. Because of the lightweight structure of Yao-graphs, the resulting hierarchical P2P networks have promising properties with regard to scalability and performance, while still offering the benefits of the P2P approach with regard to resiliency.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"92 4 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":"125696385","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}
Wenqing Chen, Yong Yuan, Changchun Xu, Kezhong Liu, Zongkai Yang
The wireless nature of the medium combined with energy constraints pose big challenges on the design of energy efficient and reliable protocols for wireless sensor networks (WSN). In this paper, the virtual MIMO scheme is incorporated with the multi-hop networking for energy saving in wireless sensor network (WSN). An energy consumption model is developed to investigate the energy saving performance by incorporating the virtual MlMO scheme with the multi-hop networking. Then, an optimization model is developed to find the optimal number of virtual nodes and the optimal number of hops. Based on the model, a virtual MlMO protocol based on clustering is developed. Simulation results show that the protocol can save energy significantly.
{"title":"Virtual MIMO protocol based on clustering for wireless sensor network","authors":"Wenqing Chen, Yong Yuan, Changchun Xu, Kezhong Liu, Zongkai Yang","doi":"10.1109/ISCC.2005.154","DOIUrl":"https://doi.org/10.1109/ISCC.2005.154","url":null,"abstract":"The wireless nature of the medium combined with energy constraints pose big challenges on the design of energy efficient and reliable protocols for wireless sensor networks (WSN). In this paper, the virtual MIMO scheme is incorporated with the multi-hop networking for energy saving in wireless sensor network (WSN). An energy consumption model is developed to investigate the energy saving performance by incorporating the virtual MlMO scheme with the multi-hop networking. Then, an optimization model is developed to find the optimal number of virtual nodes and the optimal number of hops. Based on the model, a virtual MlMO protocol based on clustering is developed. Simulation results show that the protocol can save energy significantly.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"71 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":"127371705","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 ability of the standard IEEE802.11e to support quality of service (QoS) in wireless ad-hoc networks. Inspired by IEEE 802.11e, we propose the dual-channels request to send - RTS, clear to send CTS, and ensure to send -ETS (DRCE) scheme for effective quality of service (QoS) support in mobile ad hoc networks. We evaluate the performance of IEEE 802.11e and DRCE by simulation and find that the DRCE outperforms the IEEE 802.11e protocol in terms of average packet delay and network throughput by easing the "hidden terminal", and "exposed terminal" problem. Furthermore, the DRCE optimizes the QoS performance for different priority packets compared to IEEE 802.11e.
{"title":"DRCE: a high throughput QoS MAC protocol for wireless ad hoc networks","authors":"Tiantong You, C. Yeh, H. Hassanein","doi":"10.1109/ISCC.2005.55","DOIUrl":"https://doi.org/10.1109/ISCC.2005.55","url":null,"abstract":"In this paper, we investigate the ability of the standard IEEE802.11e to support quality of service (QoS) in wireless ad-hoc networks. Inspired by IEEE 802.11e, we propose the dual-channels request to send - RTS, clear to send CTS, and ensure to send -ETS (DRCE) scheme for effective quality of service (QoS) support in mobile ad hoc networks. We evaluate the performance of IEEE 802.11e and DRCE by simulation and find that the DRCE outperforms the IEEE 802.11e protocol in terms of average packet delay and network throughput by easing the \"hidden terminal\", and \"exposed terminal\" problem. Furthermore, the DRCE optimizes the QoS performance for different priority packets compared to IEEE 802.11e.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"46 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":"127200713","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 framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optimizing their memory requirement to meet the constraints of specific computer architectures. In addition, our algorithms can be implemented in software using commodity processors instead of specialized parallel circuits. We use this framework to design two efficient algorithms that run in the popular Intel IA32 processor architecture. First, a 'slicing-by-4' algorithm doubles the performance of existing software-based, table-driven CRC implementations based on the Sarwate (August 1988) algorithm while using a 4K cache footprint. Second, a 'slicing-by-8' algorithm triples the performance of existing software-based CRC implementations while using an 8K cache footprint.
{"title":"A systematic approach to building high performance software-based CRC generators","authors":"M. Kounavis, Frank L. Berry","doi":"10.1109/ISCC.2005.18","DOIUrl":"https://doi.org/10.1109/ISCC.2005.18","url":null,"abstract":"A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optimizing their memory requirement to meet the constraints of specific computer architectures. In addition, our algorithms can be implemented in software using commodity processors instead of specialized parallel circuits. We use this framework to design two efficient algorithms that run in the popular Intel IA32 processor architecture. First, a 'slicing-by-4' algorithm doubles the performance of existing software-based, table-driven CRC implementations based on the Sarwate (August 1988) algorithm while using a 4K cache footprint. Second, a 'slicing-by-8' algorithm triples the performance of existing software-based CRC implementations while using an 8K cache footprint.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"44 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":"130626296","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 present a concept and an architecture for a location dependent digital rights management system. The solution is based on a trusted hardware which incorporates the decryption of digital data, a precise secure clock, and a GPS position receiver. A prototype is currently being developed in cooperation with a hardware manufacturer.
{"title":"Location dependent digital rights management","authors":"T. Mundt","doi":"10.1109/ISCC.2005.96","DOIUrl":"https://doi.org/10.1109/ISCC.2005.96","url":null,"abstract":"In this paper we present a concept and an architecture for a location dependent digital rights management system. The solution is based on a trusted hardware which incorporates the decryption of digital data, a precise secure clock, and a GPS position receiver. A prototype is currently being developed in cooperation with a hardware manufacturer.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"60 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":"131821726","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}
J. Cano, Juan-Carlos Cano, P. Manzoni, David Ferrández-Bell
In this paper, we address the design of spontaneous networks using a peer to peer (P2P) and Bluetooth technology. A spontaneous network is a small infrastructureless network formed when a group of people come together to participate in some collaborative activity. In this work, we develop a base library and application work ground for easy spontaneous networks development. Based on it, we present an experimental application that provides spontaneous networks with context and transparent services to interchange resources between peers. We describe the overall network architecture and present details of the implementation steps taken to create our P2P and Bluetooth based application. Finally we run some experiments in a small testbed to evaluate the performance and system behaviour. We present our findings in term of the duration of the inquiry procedure and throughput performance with respect to distance and node speed.
{"title":"On the design of spontaneous networks using a P2P approach and Bluetooth","authors":"J. Cano, Juan-Carlos Cano, P. Manzoni, David Ferrández-Bell","doi":"10.1109/ISCC.2005.110","DOIUrl":"https://doi.org/10.1109/ISCC.2005.110","url":null,"abstract":"In this paper, we address the design of spontaneous networks using a peer to peer (P2P) and Bluetooth technology. A spontaneous network is a small infrastructureless network formed when a group of people come together to participate in some collaborative activity. In this work, we develop a base library and application work ground for easy spontaneous networks development. Based on it, we present an experimental application that provides spontaneous networks with context and transparent services to interchange resources between peers. We describe the overall network architecture and present details of the implementation steps taken to create our P2P and Bluetooth based application. Finally we run some experiments in a small testbed to evaluate the performance and system behaviour. We present our findings in term of the duration of the inquiry procedure and throughput performance with respect to distance and node speed.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"123 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133292640","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 a new architecture for media handling in ad-hoc peer-to-peer networks. The architecture is distributed with two steps in the mixing operation. Our system is composed of two levels of peers. The high level is formed by peers, which do mixing and are called mixers. Each mixer is dedicated to a number of peers belonging to the second level. Synchronization of mixers is important to deliver media streams with proper ordering and timing. We propose a distributed algorithm based on logical clocks to synchronize mixers. The two main advantages of our architecture are scalability and the limited number of mixers in end-to-end path. This second feature guarantees rapid delivery of streams. We have built a proof of concept prototype and compared the performance results with the hierarchical mixing architecture.
{"title":"Media handling for multiparty sessions in ad-hoc peer-to-peer networks: a novel distributed approach","authors":"Dhafer Ben Khedher, R. Glitho, R. Dssouli","doi":"10.1109/ISCC.2005.99","DOIUrl":"https://doi.org/10.1109/ISCC.2005.99","url":null,"abstract":"In this paper we propose a new architecture for media handling in ad-hoc peer-to-peer networks. The architecture is distributed with two steps in the mixing operation. Our system is composed of two levels of peers. The high level is formed by peers, which do mixing and are called mixers. Each mixer is dedicated to a number of peers belonging to the second level. Synchronization of mixers is important to deliver media streams with proper ordering and timing. We propose a distributed algorithm based on logical clocks to synchronize mixers. The two main advantages of our architecture are scalability and the limited number of mixers in end-to-end path. This second feature guarantees rapid delivery of streams. We have built a proof of concept prototype and compared the performance results with the hierarchical mixing architecture.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"332 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":"133638334","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}
This paper presents an efficient protection scheme to provide differentiated survivability services for dynamic traffic in mesh WDM optical networks. In the deterministic quality of protection (QoP) framework, connections with different reliability requirements are classified by assigning a continuous spectrum of QoP grades. The backup bandwidth of those connections with low QoP grades is treated as low-speed traffic and may be multiplexed into one backup lightpath for the purpose of efficient bandwidth utilization. In this way, the bandwidth can be efficiently allocated by two-level backup bandwidth aggregation: backup bandwidth sharing and backup bandwidth multiplexing. To allocate the connections with different QoP grades, we propose two efficient routing algorithms: minimum delay QoP routing (MDQR) and maximum aggregation QoP routing (MAQR). Through simulation experiments, we demonstrate that our algorithms work well in terms of blocking performance and the ability of providing differentiated survivability services.
{"title":"Dynamic routing of dependable connections with different QoP grades in WDM optical networks","authors":"Cai Ming, Luying Zhou, G. Mohan","doi":"10.1109/ISCC.2005.58","DOIUrl":"https://doi.org/10.1109/ISCC.2005.58","url":null,"abstract":"This paper presents an efficient protection scheme to provide differentiated survivability services for dynamic traffic in mesh WDM optical networks. In the deterministic quality of protection (QoP) framework, connections with different reliability requirements are classified by assigning a continuous spectrum of QoP grades. The backup bandwidth of those connections with low QoP grades is treated as low-speed traffic and may be multiplexed into one backup lightpath for the purpose of efficient bandwidth utilization. In this way, the bandwidth can be efficiently allocated by two-level backup bandwidth aggregation: backup bandwidth sharing and backup bandwidth multiplexing. To allocate the connections with different QoP grades, we propose two efficient routing algorithms: minimum delay QoP routing (MDQR) and maximum aggregation QoP routing (MAQR). Through simulation experiments, we demonstrate that our algorithms work well in terms of blocking performance and the ability of providing differentiated survivability services.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"6 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":"132267468","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
扫码关注我们
求助内容：
应助结果提醒方式：