Pub Date : 2007-04-11DOI: 10.1109/PCCC.2007.358939
Vineet Chaudhary, R. Tripathi, N. Shukla, N. Nasser
In this paper a new channel allocation scheme is proposed and analyzed for real time traffic. There is no division of channels into groups. Two thresholds (lower and higher) are taken depending on the signal strength of the mobile host in the cell. The handoff calls have the right of preemption over the originating calls with signal strength less than the lower threshold value. The performance of the system is evaluated in terms of handoff dropping probability, originating call blocking probability and the channel utilization.
{"title":"A New Channel Allocation Scheme for Real-Time Traffic in Wireless Cellular Networks","authors":"Vineet Chaudhary, R. Tripathi, N. Shukla, N. Nasser","doi":"10.1109/PCCC.2007.358939","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358939","url":null,"abstract":"In this paper a new channel allocation scheme is proposed and analyzed for real time traffic. There is no division of channels into groups. Two thresholds (lower and higher) are taken depending on the signal strength of the mobile host in the cell. The handoff calls have the right of preemption over the originating calls with signal strength less than the lower threshold value. The performance of the system is evaluated in terms of handoff dropping probability, originating call blocking probability and the channel utilization.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115565608","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-04-11DOI: 10.1109/PCCC.2007.358877
Sean D. Boyden, A. Mahanti, C. Williamson
In this paper we study the use of TCP Vegas as a transport protocol for streaming media. We also consider TCP NewReno as a transport protocol for streaming media. We find that: 1) TCP is able to transport streaming media with good performance in a wide variety of scenarios; 2) TCP Vegas performs better than TCP NewReno in many cases; and 3) for viable media streams, both TCP variants need to achieve mean throughputs that are at least 1.5 times the encoding rate of the media objects being carried.
{"title":"TCP Vegas Performance with Streaming Media","authors":"Sean D. Boyden, A. Mahanti, C. Williamson","doi":"10.1109/PCCC.2007.358877","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358877","url":null,"abstract":"In this paper we study the use of TCP Vegas as a transport protocol for streaming media. We also consider TCP NewReno as a transport protocol for streaming media. We find that: 1) TCP is able to transport streaming media with good performance in a wide variety of scenarios; 2) TCP Vegas performs better than TCP NewReno in many cases; and 3) for viable media streams, both TCP variants need to achieve mean throughputs that are at least 1.5 times the encoding rate of the media objects being carried.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133849606","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-04-11DOI: 10.1109/PCCC.2007.358919
P. Venkataram, B. Babu, M. Naveen, G. H. S. Gungal
The need for paying with mobile devices has urged the development of payment systems for mobile electronic commerce. In this paper we have considered two important abases in electronic payments systems for detection. The fraud, which is an intentional deception accomplished to secure an unfair gain, and an intrusion which are any set of actions that attempt to compromise the integrity, confidentiality or availability of a resource. Most of the available fraud and intrusion detection systems for e-payments are specific to the systems where they have been incorporated. This paper proposes a generic model called as activity-event-symptoms (AES) model for detecting fraud and intrusion attacks which appears daring payment process in the mobile commerce environment. The AES model is designed to identify the symptoms of fraud and intrusions by observing various events/transactions occurs daring mobile commerce activity. The symptoms identification is followed by computing the suspicion factors for event attributes, and the certainty factor for a fraud and intrusion is generated using these suspicion factors. We have tested the proposed system by conducting various case studies, on the in-house established mobile commerce environment over wired and wire-less networks test bed.
{"title":"A Method of Fraud & Intrusion Detection for E-payment Systems in Mobile e-Commerce","authors":"P. Venkataram, B. Babu, M. Naveen, G. H. S. Gungal","doi":"10.1109/PCCC.2007.358919","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358919","url":null,"abstract":"The need for paying with mobile devices has urged the development of payment systems for mobile electronic commerce. In this paper we have considered two important abases in electronic payments systems for detection. The fraud, which is an intentional deception accomplished to secure an unfair gain, and an intrusion which are any set of actions that attempt to compromise the integrity, confidentiality or availability of a resource. Most of the available fraud and intrusion detection systems for e-payments are specific to the systems where they have been incorporated. This paper proposes a generic model called as activity-event-symptoms (AES) model for detecting fraud and intrusion attacks which appears daring payment process in the mobile commerce environment. The AES model is designed to identify the symptoms of fraud and intrusions by observing various events/transactions occurs daring mobile commerce activity. The symptoms identification is followed by computing the suspicion factors for event attributes, and the certainty factor for a fraud and intrusion is generated using these suspicion factors. We have tested the proposed system by conducting various case studies, on the in-house established mobile commerce environment over wired and wire-less networks test bed.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987792","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-04-11DOI: 10.1109/PCCC.2007.358903
Chinh T. Vu, R. Beyah, Yingshu Li
Sensor networks can be used for event alarming applications. To date, in most of the proposed schemes, the raw or aggregated sensed data is periodically sent to a data consuming center. However, with this scheme, the occurrence of an emergency event such as a fire is hardly reported in a timely manner which is a strict requirement for event alarming applications. In sensor networks, it is also highly desired to conserve energy so that the network lifetime can be maximized. Furthermore, to ensure the quality of surveillance, some applications require that if an event occurs, it needs to be detected by at least k sensors where k is a user-defined parameter. In this work, we examine the timely energy-efficient k-watching event detection problem (TEKWEO). A topology-and-routing-supported algorithm is proposed which constructs a set of detection sets that satisfy the short notification time, energy conservation, and tunable quality of surveillance requirements for event alarming applications. Simulation results are shown to validate the proposed algorithm.
{"title":"Composite Event Detection in Wireless Sensor Networks","authors":"Chinh T. Vu, R. Beyah, Yingshu Li","doi":"10.1109/PCCC.2007.358903","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358903","url":null,"abstract":"Sensor networks can be used for event alarming applications. To date, in most of the proposed schemes, the raw or aggregated sensed data is periodically sent to a data consuming center. However, with this scheme, the occurrence of an emergency event such as a fire is hardly reported in a timely manner which is a strict requirement for event alarming applications. In sensor networks, it is also highly desired to conserve energy so that the network lifetime can be maximized. Furthermore, to ensure the quality of surveillance, some applications require that if an event occurs, it needs to be detected by at least k sensors where k is a user-defined parameter. In this work, we examine the timely energy-efficient k-watching event detection problem (TEKWEO). A topology-and-routing-supported algorithm is proposed which constructs a set of detection sets that satisfy the short notification time, energy conservation, and tunable quality of surveillance requirements for event alarming applications. Simulation results are shown to validate the proposed algorithm.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130134781","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-04-11DOI: 10.1109/PCCC.2007.358901
Jehan-Francois Pâris, T. Schwarz, D. Long
We propose increasing the survivability of data stored in two-dimensional RAID arrays by causing these arrays to reorganize themselves whenever they detect a disk failure. This reorganization will rebalance as much as possible the redundancy level of all stored data, thus reducing the potential impact of additional disk failures. It remains in effect until the failed disk gets repaired. We show how our technique can be applied to two-dimensional RAID arrays consisting of n2 data disks and 2n parity disks and show how it can increase the mean time to data loss of the array by at least 200 percent as long as the reorganization process takes less than half the time it takes to replace a failed disk.
{"title":"Self-Adaptive Two-Dimensional RAID Arrays","authors":"Jehan-Francois Pâris, T. Schwarz, D. Long","doi":"10.1109/PCCC.2007.358901","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358901","url":null,"abstract":"We propose increasing the survivability of data stored in two-dimensional RAID arrays by causing these arrays to reorganize themselves whenever they detect a disk failure. This reorganization will rebalance as much as possible the redundancy level of all stored data, thus reducing the potential impact of additional disk failures. It remains in effect until the failed disk gets repaired. We show how our technique can be applied to two-dimensional RAID arrays consisting of n2 data disks and 2n parity disks and show how it can increase the mean time to data loss of the array by at least 200 percent as long as the reorganization process takes less than half the time it takes to replace a failed disk.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121286538","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-04-11DOI: 10.1109/PCCC.2007.358876
Sivakumar Bakthavachalu, Steven Bassi, Xu Jianxuan, M. Labrador
Voice over IP and video applications continue to increase the amount of real-time traffic over the Internet. These applications utilize the UDP protocol because TCP is not suitable for streaming applications since its congestion control mechanism can change the connection's transmission rate drastically, affecting the user-perceived quality of the transmission. Nonetheless, the use of end-to-end flow and congestion control mechanisms for streaming applications has been acknowledged as an important measure to ease or eliminate the congestion collapse problem in the Internet, and the unfairness problem that exist when TCP and UDP share the same congested bottleneck link. In this paper, we propose the smooth fair TCP SACK-based (SF-SACK) protocol to address these problems. SF-SACK implements the well-known end-to-end window-based congestion control algorithm of TCP but uses an additive increase smooth decrease (AISD) strategy that considers history in the evolution of the congestion window. Through simulations and experimentation, we show that if SF-SACK is used by both streaming and data-oriented applications, streaming applications receive a smooth service, and fairness is achieved. If SF-SACK is used for streaming applications only, it is unfair to TCP (not TCP-friendly) but substantially fairer and beneficial than UDP.
{"title":"An Additive Increase Smooth Decrease (AISD) Strategy for Data and Streaming Applications","authors":"Sivakumar Bakthavachalu, Steven Bassi, Xu Jianxuan, M. Labrador","doi":"10.1109/PCCC.2007.358876","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358876","url":null,"abstract":"Voice over IP and video applications continue to increase the amount of real-time traffic over the Internet. These applications utilize the UDP protocol because TCP is not suitable for streaming applications since its congestion control mechanism can change the connection's transmission rate drastically, affecting the user-perceived quality of the transmission. Nonetheless, the use of end-to-end flow and congestion control mechanisms for streaming applications has been acknowledged as an important measure to ease or eliminate the congestion collapse problem in the Internet, and the unfairness problem that exist when TCP and UDP share the same congested bottleneck link. In this paper, we propose the smooth fair TCP SACK-based (SF-SACK) protocol to address these problems. SF-SACK implements the well-known end-to-end window-based congestion control algorithm of TCP but uses an additive increase smooth decrease (AISD) strategy that considers history in the evolution of the congestion window. Through simulations and experimentation, we show that if SF-SACK is used by both streaming and data-oriented applications, streaming applications receive a smooth service, and fairness is achieved. If SF-SACK is used for streaming applications only, it is unfair to TCP (not TCP-friendly) but substantially fairer and beneficial than UDP.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127859500","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-04-01DOI: 10.1109/PCCC.2007.358897
X. Qin, Mohammed I. Alghamdi, Mais Nijim, Ziliang Zong, K. Bellam
Existing packets scheduling algorithms designed for energy-efficient wireless networks ignore important features of periodic packets, thereby being inadequate for periodic packets with energy constraints. To remedy this problem, we present in this paper an approach to scheduling periodic packets in wireless networks subject to both timing and energy constraints. We propose a necessary and sufficient feasibility check for a set of periodic packets to be transmitted over a wireless link. Next, we develop an algorithm to schedule periodic packets (or ESPP for short) over a wireless link. The ESPP algorithm aims at minimizing energy dissipation of periodic packets without missing deadlines of periodic packets. We show through simulation studies that ESPP can significantly reduce energy consumption of wireless networks by an average of 46.4% while guaranteeing timing constraints of periodic packets.
{"title":"Scheduling of Periodic Packets in Energy-Aware Wireless Networks","authors":"X. Qin, Mohammed I. Alghamdi, Mais Nijim, Ziliang Zong, K. Bellam","doi":"10.1109/PCCC.2007.358897","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358897","url":null,"abstract":"Existing packets scheduling algorithms designed for energy-efficient wireless networks ignore important features of periodic packets, thereby being inadequate for periodic packets with energy constraints. To remedy this problem, we present in this paper an approach to scheduling periodic packets in wireless networks subject to both timing and energy constraints. We propose a necessary and sufficient feasibility check for a set of periodic packets to be transmitted over a wireless link. Next, we develop an algorithm to schedule periodic packets (or ESPP for short) over a wireless link. The ESPP algorithm aims at minimizing energy dissipation of periodic packets without missing deadlines of periodic packets. We show through simulation studies that ESPP can significantly reduce energy consumption of wireless networks by an average of 46.4% while guaranteeing timing constraints of periodic packets.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128054552","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-04-01DOI: 10.1109/PCCC.2007.358909
F. T. Johnsen, T. Hafsoe, C. Griwodz, P. Halvorsen
This paper focuses on design issues for multimedia distribution architectures and the impact workload characteristics have on architecture design. Our contribution is an analysis of server load and user behavior in a news-on-demand environment, with focus on access patterns, popularity modeling, and the formation of traffic peaks. Finally, we evaluate an existing synthetic workload generator, MediSyn, and suggest some enhancements which will improve its suitability for news-on-demand workload modeling.
{"title":"Workload Characterization for News-on-Demand Streaming Services","authors":"F. T. Johnsen, T. Hafsoe, C. Griwodz, P. Halvorsen","doi":"10.1109/PCCC.2007.358909","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358909","url":null,"abstract":"This paper focuses on design issues for multimedia distribution architectures and the impact workload characteristics have on architecture design. Our contribution is an analysis of server load and user behavior in a news-on-demand environment, with focus on access patterns, popularity modeling, and the formation of traffic peaks. Finally, we evaluate an existing synthetic workload generator, MediSyn, and suggest some enhancements which will improve its suitability for news-on-demand workload modeling.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128621847","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-04-01DOI: 10.1109/PCCC.2007.358942
F. Yu, Helen Tang, Victor C. M. Leung
The complementary characteristics of public safety radio networks and commercial cellular networks make it attractive to integrate these two wireless access technologies to provide first responders with a wide variety of advanced services (e.g., multimedia). In this integrated system, service availability is a critical quality of service (QoS) requirement. This paper formulates the QoS provisioning problem and proposes an algorithm for solving the problem. The QoS constraint can be guaranteed in the proposed scheme by reserving some bandwidth in cellular networks for first responders. Numerical examples illustrate that the proposed scheme can significantly improve the service availability QoS for first responders.
{"title":"QoS Provisioning in Public Safety Radio and Commercial Cellular Integrated Networks for First Responders and Critical Infrastructures","authors":"F. Yu, Helen Tang, Victor C. M. Leung","doi":"10.1109/PCCC.2007.358942","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358942","url":null,"abstract":"The complementary characteristics of public safety radio networks and commercial cellular networks make it attractive to integrate these two wireless access technologies to provide first responders with a wide variety of advanced services (e.g., multimedia). In this integrated system, service availability is a critical quality of service (QoS) requirement. This paper formulates the QoS provisioning problem and proposes an algorithm for solving the problem. The QoS constraint can be guaranteed in the proposed scheme by reserving some bandwidth in cellular networks for first responders. Numerical examples illustrate that the proposed scheme can significantly improve the service availability QoS for first responders.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123658837","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
扫码关注我们
求助内容：
应助结果提醒方式：