Pub Date : 2007-05-15DOI: 10.1109/PCCC.2007.358926
E. Bertino, Ashish Kamra, James P. Early
Countering threats to an organization's internal databases from database applications is an important area of research. In this paper, we propose a novel framework based on anomaly detection techniques, to detect malicious behaviour of database application programs. Specifically, we create a fingerprint of an application program based on SQL queries submitted by it to a database. We then use association rule mining techniques on this fingerprint to extract useful rules. These rules succinctly represent the normal behaviour of the database application. We then apply an anomaly detection algorithm to detect queries that do not conform to these rules. We further demonstrate how this model can be used to detect SQL Injection attacks on databases. We show the validity and usefulness of our approach on synthetically generated datasets and SQL Injected queries. Experimental results show that our techniques are effective in addressing various types of SQL Injection threat scenarios.
{"title":"Profiling Database Application to Detect SQL Injection Attacks","authors":"E. Bertino, Ashish Kamra, James P. Early","doi":"10.1109/PCCC.2007.358926","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358926","url":null,"abstract":"Countering threats to an organization's internal databases from database applications is an important area of research. In this paper, we propose a novel framework based on anomaly detection techniques, to detect malicious behaviour of database application programs. Specifically, we create a fingerprint of an application program based on SQL queries submitted by it to a database. We then use association rule mining techniques on this fingerprint to extract useful rules. These rules succinctly represent the normal behaviour of the database application. We then apply an anomaly detection algorithm to detect queries that do not conform to these rules. We further demonstrate how this model can be used to detect SQL Injection attacks on databases. We show the validity and usefulness of our approach on synthetically generated datasets and SQL Injected queries. Experimental results show that our techniques are effective in addressing various types of SQL Injection threat scenarios.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124977990","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.358908
Lijuan Cao, T. Dahlberg, Yang Wang
Energy aware routing protocols are consistently cited as efficient solutions for ad hoc and sensor networks routing and data management. However, there is not a consistent approach to define the energy related cost metrics that are used to guide the routing protocol performance. This paper provides a survey and analysis of energy related metrics used for ad hoc routing. First, the most common energy efficient routing protocols are classified into four categories based on the energy cost metrics employed. Then, the results of our simulation-based analysis are presented. We conducted a complete set of simulations to compare and contrast the performance of various energy-related metrics. Our analysis provides a comparison of the performance of energy cost metrics used within AODV-based ad hoc routing protocols.
{"title":"Performance Evaluation of Energy Efficient Ad Hoc Routing Protocols","authors":"Lijuan Cao, T. Dahlberg, Yang Wang","doi":"10.1109/PCCC.2007.358908","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358908","url":null,"abstract":"Energy aware routing protocols are consistently cited as efficient solutions for ad hoc and sensor networks routing and data management. However, there is not a consistent approach to define the energy related cost metrics that are used to guide the routing protocol performance. This paper provides a survey and analysis of energy related metrics used for ad hoc routing. First, the most common energy efficient routing protocols are classified into four categories based on the energy cost metrics employed. Then, the results of our simulation-based analysis are presented. We conducted a complete set of simulations to compare and contrast the performance of various energy-related metrics. Our analysis provides a comparison of the performance of energy cost metrics used within AODV-based ad hoc routing protocols.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"15 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":"122161337","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.358914
Jie Hu, R. Klefstad
We present a novel algorithm to schedule divisible loads using multi-round installment load distribution. This algorithm considers additional real-world factors, such as task initialization overhead and arbitrary processor release times. We analyze this algorithm's properties and demonstrate its behaviors through multiple illustrative examples. The analysis provides both a deeper understanding of the divisible load scheduling difficulties when considering more real-world factors and allows us to design more efficient algorithms. We show that this algorithm generate better solutions for practical applications.
{"title":"Scheduling Divisible Loads on Bus Networks with Arbitrary Processor Release Time and Start-Up Costs: XRMI","authors":"Jie Hu, R. Klefstad","doi":"10.1109/PCCC.2007.358914","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358914","url":null,"abstract":"We present a novel algorithm to schedule divisible loads using multi-round installment load distribution. This algorithm considers additional real-world factors, such as task initialization overhead and arbitrary processor release times. We analyze this algorithm's properties and demonstrate its behaviors through multiple illustrative examples. The analysis provides both a deeper understanding of the divisible load scheduling difficulties when considering more real-world factors and allows us to design more efficient algorithms. We show that this algorithm generate better solutions for practical applications.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"5 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":"115888320","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.358943
S. Rizvi, S. Olariu, M. Rizvi, Michele C. Weigle
This paper proposes an efficient chaos-reducing information dissemination approach for spatiotemporal traffic information related to first responders and planned evacuation scenarios using vehicular ad hoc networks (VANETs). VANETs have recently been proposed as one of the promising ad-hoc networking techniques that can be used to provide a safe and enjoyable driving experience. In our approach, we provide an emergency vehicle path clearing technique, and real-time resource (e.g. shelter) availability information. Therefore, traffic confusion and chaos is lowered on evacuation and emergency vehicle routes. Simulation results show that our approach works efficiently without fully relying on any message relaying infrastructure.
{"title":"A Traffic Chaos Reduction Approach for Emergency Scenarios","authors":"S. Rizvi, S. Olariu, M. Rizvi, Michele C. Weigle","doi":"10.1109/PCCC.2007.358943","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358943","url":null,"abstract":"This paper proposes an efficient chaos-reducing information dissemination approach for spatiotemporal traffic information related to first responders and planned evacuation scenarios using vehicular ad hoc networks (VANETs). VANETs have recently been proposed as one of the promising ad-hoc networking techniques that can be used to provide a safe and enjoyable driving experience. In our approach, we provide an emergency vehicle path clearing technique, and real-time resource (e.g. shelter) availability information. Therefore, traffic confusion and chaos is lowered on evacuation and emergency vehicle routes. Simulation results show that our approach works efficiently without fully relying on any message relaying infrastructure.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"15 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":"132130993","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.358947
Michele C. Weigle, S. Olariu
Disasters, natural and man-made alike, pose a serious threat to the nation by taking a heavy toll in human lives, destroying the public infrastructure and production capacity, interrupting supply lines, and stalling economic activity. One of the time-honored strategies for dealing with predictable natural disasters is a planned evacuation of the population from the afflicted area. Thus, evacuation strategies and supporting infrastructure are of the highest importance for mitigating the effects of such events. The main contribution of this work is to propose an intelligent highway infrastructure in support of planned evacuations. Specifically, we show that the recently-proposed architecture for the notification of traffic incidents and congestion (NOTICE) can be enhanced to support the needs of large-scale evacuations.
{"title":"Intelligent Highway Infrastructure for Planned Evacuations","authors":"Michele C. Weigle, S. Olariu","doi":"10.1109/PCCC.2007.358947","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358947","url":null,"abstract":"Disasters, natural and man-made alike, pose a serious threat to the nation by taking a heavy toll in human lives, destroying the public infrastructure and production capacity, interrupting supply lines, and stalling economic activity. One of the time-honored strategies for dealing with predictable natural disasters is a planned evacuation of the population from the afflicted area. Thus, evacuation strategies and supporting infrastructure are of the highest importance for mitigating the effects of such events. The main contribution of this work is to propose an intelligent highway infrastructure in support of planned evacuations. Specifically, we show that the recently-proposed architecture for the notification of traffic incidents and congestion (NOTICE) can be enhanced to support the needs of large-scale evacuations.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"17 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":"131861132","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.358907
Noun Choi, Subbarayan Venkatesan
Carrier sense multiple access (CSMA) is a media access scheme used in multi-hop wireless networks. Because a node is unable to detect a collision while it transmits signals, reducing the collision rate is important to increase the network performance. Since the advent of MACA, it has been believed that RTS/CTS exchange in multi-hop wireless networks prevents collisions caused by hidden terminals in most situations. Recently, several research papers presented cases where the RTS/CTS exchange fails to prevent collisions caused by hidden terminals. In this paper, we show by simulations that RTS/CTS exchange under contemporary physical layer technologies actually has limited effect on fast collision inference and on resolving the hidden terminal problem. We also present a situation where an ACK packet causes a collision and show that this type of collisions has a significant effect on the performance of multi-hop wireless networks. We also present a modified media access scheme that reduces the number of collisions caused by ACK and compare the proposed scheme with basic access mode and RTS/CTS exchange mode of IEEE 802.11.
{"title":"On Frugality of Control Packets in Multi-Hop Wireless Networks","authors":"Noun Choi, Subbarayan Venkatesan","doi":"10.1109/PCCC.2007.358907","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358907","url":null,"abstract":"Carrier sense multiple access (CSMA) is a media access scheme used in multi-hop wireless networks. Because a node is unable to detect a collision while it transmits signals, reducing the collision rate is important to increase the network performance. Since the advent of MACA, it has been believed that RTS/CTS exchange in multi-hop wireless networks prevents collisions caused by hidden terminals in most situations. Recently, several research papers presented cases where the RTS/CTS exchange fails to prevent collisions caused by hidden terminals. In this paper, we show by simulations that RTS/CTS exchange under contemporary physical layer technologies actually has limited effect on fast collision inference and on resolving the hidden terminal problem. We also present a situation where an ACK packet causes a collision and show that this type of collisions has a significant effect on the performance of multi-hop wireless networks. We also present a modified media access scheme that reduces the number of collisions caused by ACK and compare the proposed scheme with basic access mode and RTS/CTS exchange mode of IEEE 802.11.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"41 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":"124868416","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.358881
Joel C. Wu, Bo Hong, S. Brandt
Dynamic storage tiering (DST) is the concept of grouping storage devices into tiers based on their characteristics, and relocating files dynamically to leverage on the heterogeneity of the underlying devices. An important usage of DST is activity-based file relocation, where less active files can be stored on less expensive devices without affecting the overall perceived quality of the storage system. In activity-based file relocation, improper choices on how much activity a file should have before it is relocated introduce the potential for overcommitting the performance capability of the preferred tier. We present an approach to prevent performance degradation caused by excessive skewing of loads. Our approach enables the delineation of periods when performance requirements are different. We consider the load pattern of files and limit the total amount of loads to be placed on the preferred tier during the periods when fast response time is desirable, and increase the load limit in other periods when throughput is more important. Considering the variation of performance requirements in time enables the finer attainment of QoS goals.
{"title":"Ensuring Performance in Activity-Based File Relocation","authors":"Joel C. Wu, Bo Hong, S. Brandt","doi":"10.1109/PCCC.2007.358881","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358881","url":null,"abstract":"Dynamic storage tiering (DST) is the concept of grouping storage devices into tiers based on their characteristics, and relocating files dynamically to leverage on the heterogeneity of the underlying devices. An important usage of DST is activity-based file relocation, where less active files can be stored on less expensive devices without affecting the overall perceived quality of the storage system. In activity-based file relocation, improper choices on how much activity a file should have before it is relocated introduce the potential for overcommitting the performance capability of the preferred tier. We present an approach to prevent performance degradation caused by excessive skewing of loads. Our approach enables the delineation of periods when performance requirements are different. We consider the load pattern of files and limit the total amount of loads to be placed on the preferred tier during the periods when fast response time is desirable, and increase the load limit in other periods when throughput is more important. Considering the variation of performance requirements in time enables the finer attainment of QoS goals.","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":"130081866","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.358883
Haiming Yang, B. Sikdar
LEACH (low energy adaptive clustering hierarchy) (W. Heinzelman et al., 2000) is one of the popular cluster-based structures, which has been widely proposed in wireless sensor networks. LEACH uses a TDMA based MAC protocol, and in order to maintain a balanced energy consumption, suggests that each node probabilistically become a cluster head. To reduce the energy consumption and to avoid the strict synchronization requirements of TDMA, we first apply a sleep-wakeup based decentralized MAC protocol to LEACH, then we present an analytic framework for obtaining the optimal probability with which a node becomes a cluster head in order to minimize the network's energy consumption. The analysis is first presented for small networks, under the assumption of identical expected distance of all cluster heads from the sink. Then the analysis is extended for large networks to consider the case when the distances of various sections of the network from the sink may be different, since nodes further away have to spend greater energy in order to reach the sink. Our simulation results show that using this optimal probability results in much more efficient energy consumption and compared with the current LEACH, our proposal consumes significantly less power.
LEACH (low energy adaptive clustering hierarchy，低能量自适应聚类结构)(W. Heinzelman et al.， 2000)是一种流行的基于聚类的结构，在无线传感器网络中被广泛提出。LEACH使用基于TDMA的MAC协议，为了保持均衡的能量消耗，建议每个节点概率地成为簇头。为了降低能耗和避免TDMA严格的同步要求，我们首先将一个基于睡眠-唤醒的去中心化MAC协议应用到LEACH中，然后我们提出了一个分析框架来获得节点成为簇头的最佳概率，以最小化网络的能耗。首先对小型网络进行了分析，假设所有簇头到汇聚点的期望距离相同。然后将分析扩展到大型网络，以考虑网络的各个部分与接收器的距离可能不同的情况，因为更远的节点必须花费更多的能量才能到达接收器。我们的仿真结果表明，使用此最优概率可以获得更有效的能源消耗，并且与当前的LEACH相比，我们的建议消耗的功率显着降低。
{"title":"Optimal Cluster Head Selection in the LEACH Architecture","authors":"Haiming Yang, B. Sikdar","doi":"10.1109/PCCC.2007.358883","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358883","url":null,"abstract":"LEACH (low energy adaptive clustering hierarchy) (W. Heinzelman et al., 2000) is one of the popular cluster-based structures, which has been widely proposed in wireless sensor networks. LEACH uses a TDMA based MAC protocol, and in order to maintain a balanced energy consumption, suggests that each node probabilistically become a cluster head. To reduce the energy consumption and to avoid the strict synchronization requirements of TDMA, we first apply a sleep-wakeup based decentralized MAC protocol to LEACH, then we present an analytic framework for obtaining the optimal probability with which a node becomes a cluster head in order to minimize the network's energy consumption. The analysis is first presented for small networks, under the assumption of identical expected distance of all cluster heads from the sink. Then the analysis is extended for large networks to consider the case when the distances of various sections of the network from the sink may be different, since nodes further away have to spend greater energy in order to reach the sink. Our simulation results show that using this optimal probability results in much more efficient energy consumption and compared with the current LEACH, our proposal consumes significantly less power.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"3 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":"127989402","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.358941
T. Kawai, N. Wakamiya, M. Murata
The wireless sensor network (WSN) is one of the most promising technologies which helps making our society safe, secure, and comfortable. A WSN as a social infrastructure must transmit critical information faster and more reliable than other information. In this paper, we propose an autonomous and distributed mechanism, called an "assured corridor" mechanism (ACM), for fast and reliable transmission for urgent information in WSNs. In ACM, a self-organizing corridor consists of nodes surrounding the path from the source node to the base station and nodes in the path. The former refrains from transmitting non-urgent information to avoid collisions with emergency packets, and the latter suspends their sleep schedule and keeps awake to avoid delay caused by sleeping. We conducted simulation experiments with a tree-based and broadcast-based network. It was shown that ACM improved the delivery ratio and the delay of emergency packets.
{"title":"ACM: A Transmission Mechanism for Urgent Sensor Information","authors":"T. Kawai, N. Wakamiya, M. Murata","doi":"10.1109/PCCC.2007.358941","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358941","url":null,"abstract":"The wireless sensor network (WSN) is one of the most promising technologies which helps making our society safe, secure, and comfortable. A WSN as a social infrastructure must transmit critical information faster and more reliable than other information. In this paper, we propose an autonomous and distributed mechanism, called an \"assured corridor\" mechanism (ACM), for fast and reliable transmission for urgent information in WSNs. In ACM, a self-organizing corridor consists of nodes surrounding the path from the source node to the base station and nodes in the path. The former refrains from transmitting non-urgent information to avoid collisions with emergency packets, and the latter suspends their sleep schedule and keeps awake to avoid delay caused by sleeping. We conducted simulation experiments with a tree-based and broadcast-based network. It was shown that ACM improved the delivery ratio and the delay of emergency packets.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"24 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":"115957896","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.358878
J. Chung, M. Claypool, R. Kinicki
As use of non-TCP applications such as streaming media and network games increases, the potential for unfair, misbehaving flows and the threat of congestion collapse also increases. This paper introduces a statistical traffic filtering technique, stochastic fairness guardian (SFG), that effectively regulates misbehaving flows with minimal traffic state information. SFG can be used in conjunction with an active queue management (AQM) mechanism to improve both network protection and efficiency. Simulations are used to evaluated SFG and the integration of SFG with a proportional-integral (PI) controller in comparison with other similar statistical flow management mechanisms including RED-PD, SFB and CHOKe. The SFG-PI combination outperforms other mechanisms in terms of fairness, queuing delay, stability and TCP performance over a wide range of realistic traffic loads and conditions.
{"title":"Stochastic Fair Traffic Management for Efficient and Robust IP Networking","authors":"J. Chung, M. Claypool, R. Kinicki","doi":"10.1109/PCCC.2007.358878","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358878","url":null,"abstract":"As use of non-TCP applications such as streaming media and network games increases, the potential for unfair, misbehaving flows and the threat of congestion collapse also increases. This paper introduces a statistical traffic filtering technique, stochastic fairness guardian (SFG), that effectively regulates misbehaving flows with minimal traffic state information. SFG can be used in conjunction with an active queue management (AQM) mechanism to improve both network protection and efficiency. Simulations are used to evaluated SFG and the integration of SFG with a proportional-integral (PI) controller in comparison with other similar statistical flow management mechanisms including RED-PD, SFB and CHOKe. The SFG-PI combination outperforms other mechanisms in terms of fairness, queuing delay, stability and TCP performance over a wide range of realistic traffic loads and conditions.","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":"121184930","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
扫码关注我们
求助内容：
应助结果提醒方式：