Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.117
Qifei Zhang, Baolin Sun, Chao Gui, Changjun Zeng
Backoff algorithms in traditional distributed contention-based MAC protocols concentrate on adjusting contention window size to resolve collision. However, collision may still occur as long as these windows intersect with each other. In order to solve this problem, we put forward a collision classification model to classify collisions into cross collision and intra collision and suggest to solve them with different manners. Based on this model, we propose collision classification resolution (CCR) algorithm to dynamically allocate discrete distribution windows for collided nodes to avoid cross collision, and the intra collision is resolved with an appropriate distribution window size to achieve a tradeoff between delay and collision probability. The extensive simulations performed demonstrate that compared to IEEE 802.11 DCF, CCR algorithm consistently excels, in terms of collision times, throughput, delay and fairness.
{"title":"A New Collision Resolution Mechanism for IEEE 802.11 WLAN","authors":"Qifei Zhang, Baolin Sun, Chao Gui, Changjun Zeng","doi":"10.1109/ICCCN.2008.ECP.117","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.117","url":null,"abstract":"Backoff algorithms in traditional distributed contention-based MAC protocols concentrate on adjusting contention window size to resolve collision. However, collision may still occur as long as these windows intersect with each other. In order to solve this problem, we put forward a collision classification model to classify collisions into cross collision and intra collision and suggest to solve them with different manners. Based on this model, we propose collision classification resolution (CCR) algorithm to dynamically allocate discrete distribution windows for collided nodes to avoid cross collision, and the intra collision is resolved with an appropriate distribution window size to achieve a tradeoff between delay and collision probability. The extensive simulations performed demonstrate that compared to IEEE 802.11 DCF, CCR algorithm consistently excels, in terms of collision times, throughput, delay and fairness.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"74 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129292728","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-11-17DOI: 10.1109/ICCCN.2008.ECP.176
Tsern-Huei Lee, Nai-Lun Huang
Because of its accuracy, pattern matching technique has recently been applied to Internet security applications such as intrusion detection/prevention, anti-virus, and anti-malware. Among various famous pattern matching algorithms, the Aho-Corasick (AC) can match multiple pattern strings simultaneously with worst-case performance guarantee and is adopted in both Clam antivirus (ClamAV) and Snort intrusion detection open sources. The AC algorithm is based on finite automaton which can be implemented straightforwardly with a two-dimensional state transition table. However, the memory requirement prohibits such an implementation when the total length of the pattern strings is large. The ClamAV implementation limits the depth of the finite automaton and combines with linked lists to reduce memory requirement. The banded-row format is adopted to compress the state transition table and used as an alternative pattern matching machine in Snort. In this paper we present a novel implementation which requires small memory space and achieves high throughput performance. Compared with the banded-row format, our proposed scheme achieves 39.7% reduction in memory requirement for 5,000 patterns randomly selected from ClamAV signatures. Besides, the processing time of our proposed scheme is, on the average, 83.9% of that of the banded-row format for scanning various types of files. Compared with the ClamAV implementation with the same 5,000 patterns and files, our proposed scheme requires slightly more memory space but achieves 80.6% reduction in processing time on the average.
{"title":"An Efficient and Scalable Pattern Matching Scheme for Network Security Applications","authors":"Tsern-Huei Lee, Nai-Lun Huang","doi":"10.1109/ICCCN.2008.ECP.176","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.176","url":null,"abstract":"Because of its accuracy, pattern matching technique has recently been applied to Internet security applications such as intrusion detection/prevention, anti-virus, and anti-malware. Among various famous pattern matching algorithms, the Aho-Corasick (AC) can match multiple pattern strings simultaneously with worst-case performance guarantee and is adopted in both Clam antivirus (ClamAV) and Snort intrusion detection open sources. The AC algorithm is based on finite automaton which can be implemented straightforwardly with a two-dimensional state transition table. However, the memory requirement prohibits such an implementation when the total length of the pattern strings is large. The ClamAV implementation limits the depth of the finite automaton and combines with linked lists to reduce memory requirement. The banded-row format is adopted to compress the state transition table and used as an alternative pattern matching machine in Snort. In this paper we present a novel implementation which requires small memory space and achieves high throughput performance. Compared with the banded-row format, our proposed scheme achieves 39.7% reduction in memory requirement for 5,000 patterns randomly selected from ClamAV signatures. Besides, the processing time of our proposed scheme is, on the average, 83.9% of that of the banded-row format for scanning various types of files. Compared with the ClamAV implementation with the same 5,000 patterns and files, our proposed scheme requires slightly more memory space but achieves 80.6% reduction in processing time on the average.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123642937","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-11-17DOI: 10.1109/ICCCN.2008.ECP.27
Priyanka Tembey, Anish Bhatt, Subramanya R. Dulloor, Ada Gavrilovska, K. Schwan
Emerging heterogeneous multicore systems are suitable platforms for efficient deployment of application- specific service components. Easily virtualizable and reprogrammable platforms, these 'appliances' for future information services make it possible to run familiar software stacks created with common development tools, in addition to offering acceleration capabilities for performance critical software components. Of particular importance are the efficient and scalable execution of the content-based services prevalent in future Internet applications, including flexible methods for data classification and forwarding. This paper provides a brief description of representative platform hardware and software components. It then describes in more detail the feasibility of supporting a range of flexible and reconfigurable application-specific classification operations necessary for future Internet applications.
{"title":"Flexible Classification on Heterogenous Multicore Appliance Platforms","authors":"Priyanka Tembey, Anish Bhatt, Subramanya R. Dulloor, Ada Gavrilovska, K. Schwan","doi":"10.1109/ICCCN.2008.ECP.27","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.27","url":null,"abstract":"Emerging heterogeneous multicore systems are suitable platforms for efficient deployment of application- specific service components. Easily virtualizable and reprogrammable platforms, these 'appliances' for future information services make it possible to run familiar software stacks created with common development tools, in addition to offering acceleration capabilities for performance critical software components. Of particular importance are the efficient and scalable execution of the content-based services prevalent in future Internet applications, including flexible methods for data classification and forwarding. This paper provides a brief description of representative platform hardware and software components. It then describes in more detail the feasibility of supporting a range of flexible and reconfigurable application-specific classification operations necessary for future Internet applications.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121089694","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-11-17DOI: 10.1109/ICCCN.2008.ECP.34
G. Merrett, A. Weddell, A. Lewis, N. Harris, B. Al-Hashimi, N. White
The modeling of energy components in wireless sensor network (WSN) simulation is important for obtaining realistic lifetime predictions and ensuring the faithful operation of energy-aware algorithms. The use of supercapacitors as energy stores on WSN nodes is increasing, but their behavior differs from that of batteries. This paper proposes a model for a supercapacitor energy store based upon experimental results, and compares obtained simulation results to those using an 'ideal' energy store model. The proposed model also considers the variety and behavior of energy consumers, and finds that contrary to many existing models, the energy consumed depends on the store voltage (which varies considerably during supercapacitor discharge). Furthermore, energy models in a node's embedded firmware are shown to be paramount for providing energy-aware operation.
{"title":"An Empirical Energy Model for Supercapacitor Powered Wireless Sensor Nodes","authors":"G. Merrett, A. Weddell, A. Lewis, N. Harris, B. Al-Hashimi, N. White","doi":"10.1109/ICCCN.2008.ECP.34","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.34","url":null,"abstract":"The modeling of energy components in wireless sensor network (WSN) simulation is important for obtaining realistic lifetime predictions and ensuring the faithful operation of energy-aware algorithms. The use of supercapacitors as energy stores on WSN nodes is increasing, but their behavior differs from that of batteries. This paper proposes a model for a supercapacitor energy store based upon experimental results, and compares obtained simulation results to those using an 'ideal' energy store model. The proposed model also considers the variety and behavior of energy consumers, and finds that contrary to many existing models, the energy consumed depends on the store voltage (which varies considerably during supercapacitor discharge). Furthermore, energy models in a node's embedded firmware are shown to be paramount for providing energy-aware operation.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128754516","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-11-17DOI: 10.1109/ICCCN.2008.ECP.105
D. Salyers, A. Striegel, C. Poellabauer
Maintaining synchronization of clocks between wireless systems is a well known problem of which significant research has been performed. This has lead to a variety of methods introduced to maintain clock synchronization. Typically, works are heavy weight in that they require constant communication between systems in order to maintain clock synchronization on the order of microseconds. Unfortunately, for many applications the cost of constant communication to ensure clock synchronization is neither desirable nor acceptable. Additionally, for applications such as link state routing, delay measurements and quality of service measurements, clock synchronization on the order of microseconds is not necessary, and synchronization on the order of milliseconds is sufficient. Thus, in this work we present a light weight technique for correcting for clock drift between systems that will allow for millisecond accuracy during long periods of time while requiring no special hardware nor constant communication between systems. Experimental studies of the measured delay between two systems are performed, showing that with a training period, clocks can remained synchronized within a few milliseconds over long periods of time.
{"title":"A Light Weight Method for Maintaining Clock Synchronization for Networked Systems","authors":"D. Salyers, A. Striegel, C. Poellabauer","doi":"10.1109/ICCCN.2008.ECP.105","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.105","url":null,"abstract":"Maintaining synchronization of clocks between wireless systems is a well known problem of which significant research has been performed. This has lead to a variety of methods introduced to maintain clock synchronization. Typically, works are heavy weight in that they require constant communication between systems in order to maintain clock synchronization on the order of microseconds. Unfortunately, for many applications the cost of constant communication to ensure clock synchronization is neither desirable nor acceptable. Additionally, for applications such as link state routing, delay measurements and quality of service measurements, clock synchronization on the order of microseconds is not necessary, and synchronization on the order of milliseconds is sufficient. Thus, in this work we present a light weight technique for correcting for clock drift between systems that will allow for millisecond accuracy during long periods of time while requiring no special hardware nor constant communication between systems. Experimental studies of the measured delay between two systems are performed, showing that with a training period, clocks can remained synchronized within a few milliseconds over long periods of time.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122051416","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-11-17DOI: 10.1109/ICCCN.2008.ECP.64
Srivatsan Balasubramanian, Arun Kumar Somani
Traffic grooming continues to be a rich area of research in WDM optical networks. In this paper, we identify four kinds of path level traffic aggregation/grooming strategies - point to point (P2P), point to multi-point (P2MP), multi-point to point (MP2P), and multi-point to multi-point (MP2MP). We develop an auxiliary graph based approach as a generic network dimensioning solution for these architectures. Using our model, we compare the performance of various architectures employing path level aggregation in both single hop and multi-hop scenarios. For the studied scenarios, we observe the following - (1) MP2MP outperforms other architectures by multiple orders of magnitude in single hop networks, (2) P2P performs the best in multi-hop transceiver constrained scenarios, and (3) P2MP performs the best in multi-hop wavelength constrained scenarios.
{"title":"A Comparative Study of Path Level Traffic Grooming Strategies for WDM Optical Networks with Dynamic Traffic - Invited Paper","authors":"Srivatsan Balasubramanian, Arun Kumar Somani","doi":"10.1109/ICCCN.2008.ECP.64","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.64","url":null,"abstract":"Traffic grooming continues to be a rich area of research in WDM optical networks. In this paper, we identify four kinds of path level traffic aggregation/grooming strategies - point to point (P2P), point to multi-point (P2MP), multi-point to point (MP2P), and multi-point to multi-point (MP2MP). We develop an auxiliary graph based approach as a generic network dimensioning solution for these architectures. Using our model, we compare the performance of various architectures employing path level aggregation in both single hop and multi-hop scenarios. For the studied scenarios, we observe the following - (1) MP2MP outperforms other architectures by multiple orders of magnitude in single hop networks, (2) P2P performs the best in multi-hop transceiver constrained scenarios, and (3) P2MP performs the best in multi-hop wavelength constrained scenarios.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117122961","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-11-17DOI: 10.1109/ICCCN.2008.ECP.77
R. Roy, B. Mukherjee
Telecom mesh networks require periodic upgrades to support increasing traffic. Such upgrades, which are known as network engineering (NE), determine the network resources that must be provided to meet the network performance while minimizing the network cost. To handle traffic growth, we introduce a new parameter namely network-cut exhaustion probability. We develop a method to calculate this parameter and evaluate specific upgrade requirements of telecom mesh network.
{"title":"Managing Traffic Growth in Telecom Mesh Networks (Invited Paper)","authors":"R. Roy, B. Mukherjee","doi":"10.1109/ICCCN.2008.ECP.77","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.77","url":null,"abstract":"Telecom mesh networks require periodic upgrades to support increasing traffic. Such upgrades, which are known as network engineering (NE), determine the network resources that must be provided to meet the network performance while minimizing the network cost. To handle traffic growth, we introduce a new parameter namely network-cut exhaustion probability. We develop a method to calculate this parameter and evaluate specific upgrade requirements of telecom mesh network.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129105869","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-11-17DOI: 10.1109/ICCCN.2008.ECP.165
F. Bagci, Florian Kluge, N. Bagherzadeh, T. Ungerer
Ubiquitous and pervasive computing envisions context-aware systems that gather real world information from many fixed and mobile microchips and sensors integrated in everyday objects. To provide valuable services, it is necessary to estimate the location of users or objects. Outdoor location tracking is achieved by Global Positioning System (GPS), but due to its poor indoor coverage, there is a need for alternative technologies in buildings. Since multiple wireless sensors may be situated in the environment, they can be used for location estimation and tracking. This paper presents LocSens, a cost-effective location tracking system based on sensor nodes with wireless connectivity. LocSens works with a minimum number of sensor nodes. It is established and tested in a real indoor scenario over multiple rooms. This paper describes results of several location estimation algorithms and experiences with tracking of moving objects.
{"title":"LocSens - An Indoor Location Tracking System using Wireless Sensors","authors":"F. Bagci, Florian Kluge, N. Bagherzadeh, T. Ungerer","doi":"10.1109/ICCCN.2008.ECP.165","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.165","url":null,"abstract":"Ubiquitous and pervasive computing envisions context-aware systems that gather real world information from many fixed and mobile microchips and sensors integrated in everyday objects. To provide valuable services, it is necessary to estimate the location of users or objects. Outdoor location tracking is achieved by Global Positioning System (GPS), but due to its poor indoor coverage, there is a need for alternative technologies in buildings. Since multiple wireless sensors may be situated in the environment, they can be used for location estimation and tracking. This paper presents LocSens, a cost-effective location tracking system based on sensor nodes with wireless connectivity. LocSens works with a minimum number of sensor nodes. It is established and tested in a real indoor scenario over multiple rooms. This paper describes results of several location estimation algorithms and experiences with tracking of moving objects.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129734321","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-11-17DOI: 10.1109/ICCCN.2008.ECP.78
Muhammad S. Javed, K. Thulasiraman, G. Xue
The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues to attract significant interest from the research community. An IP-over-WDM network implements Internet Protocol (IP) directly over physical WDM network by establishing lightpaths using IP routers, optical crossconnects (OXC) and optical fibers. Generally an optical fiber carries several lightpaths and all of them get disconnected, if the fiber carrying them fails. Such failures can quickly impact the performance of the entire network. If IP routers can find paths to all the nodes in the network, then the network can continue to provide service without significant performance degradation. This can be achieved by reserving network resources (protection) or provisioning the network with some additional capacity (restoration). Such networks are usually called survivable networks. In this paper, we propose four algorithms based on SMART framework proposed by Kurant and Thiran, and a hybrid approach by Shenai and Sivalingam. The algorithms use a combination of protection and restoration mechanisms to make IP-over-WDM networks survivable such that the protection capacity required is not significant.
{"title":"Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity","authors":"Muhammad S. Javed, K. Thulasiraman, G. Xue","doi":"10.1109/ICCCN.2008.ECP.78","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.78","url":null,"abstract":"The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues to attract significant interest from the research community. An IP-over-WDM network implements Internet Protocol (IP) directly over physical WDM network by establishing lightpaths using IP routers, optical crossconnects (OXC) and optical fibers. Generally an optical fiber carries several lightpaths and all of them get disconnected, if the fiber carrying them fails. Such failures can quickly impact the performance of the entire network. If IP routers can find paths to all the nodes in the network, then the network can continue to provide service without significant performance degradation. This can be achieved by reserving network resources (protection) or provisioning the network with some additional capacity (restoration). Such networks are usually called survivable networks. In this paper, we propose four algorithms based on SMART framework proposed by Kurant and Thiran, and a hybrid approach by Shenai and Sivalingam. The algorithms use a combination of protection and restoration mechanisms to make IP-over-WDM networks survivable such that the protection capacity required is not significant.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"219 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129840932","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-11-17DOI: 10.1109/ICCCN.2008.ECP.38
Wei Shen, Qing-An Zeng
In order to provide more comprehensive services, a concept of integrated heterogeneous wireless and mobile network (IHWMN) is introduced by combing different types of wireless and mobile networks (WMNs). However, it imposes great challenges such as resource management schemes to support multiple traffic in IHWMNs. In this paper, we propose two resource management schemes for IHWMNs. The first scheme is called traffic-based resource management scheme (TRMS) which allocates the resource based on traffic type, call type, bandwidth availability, and bandwidth provision. In the second scheme which is called Q-learning-based resource management scheme (QRMS), the resource management scheme is formulated as a Markov decision process (MDP) and Q-learning approach is applied to conduct the resource allocation. The system performance of both proposed schemes are evaluated and compared by using extensive simulations.
{"title":"Resource Management Schemes for Multiple Traffic in Integrated Heterogeneous Wireless and Mobile Networks","authors":"Wei Shen, Qing-An Zeng","doi":"10.1109/ICCCN.2008.ECP.38","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.38","url":null,"abstract":"In order to provide more comprehensive services, a concept of integrated heterogeneous wireless and mobile network (IHWMN) is introduced by combing different types of wireless and mobile networks (WMNs). However, it imposes great challenges such as resource management schemes to support multiple traffic in IHWMNs. In this paper, we propose two resource management schemes for IHWMNs. The first scheme is called traffic-based resource management scheme (TRMS) which allocates the resource based on traffic type, call type, bandwidth availability, and bandwidth provision. In the second scheme which is called Q-learning-based resource management scheme (QRMS), the resource management scheme is formulated as a Markov decision process (MDP) and Q-learning approach is applied to conduct the resource allocation. The system performance of both proposed schemes are evaluated and compared by using extensive simulations.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126848332","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
扫码关注我们
求助内容：
应助结果提醒方式：