{"title":"Generalized fairness in QoS scheduling","authors":"J. Cobb","doi":"10.1109/ICON.2013.6781972","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781972","url":null,"abstract":"Many scheduling protocols have been developed that provide both rate and fairness guarantees. That is, flows can take advantage of unused capacity without incurring any penalty at the scheduler. The manner in which unused capacity is distributed among the active flows varies significantly between protocols. Some are partial to flows that have a larger reserved rate, while others are partial to flows with a lesser reserved rate. We present a generalization of all of these behaviors under a single common framework, which we refer to as generalized fairness. We present a scheduling protocol that provides generalized fairness, and we prove upper bounds on the exit times of packets from the scheduler. These bounds apply to earlier protocols as well, since they are specific instances of the general framework. In addition, the protocol also supports flows that transmit at a fixed rate but have tight delay requirements.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121446651","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}
{"title":"DCF and EDCA throughput improvement using Selective Anomalous Slot Avoidance (SASA)","authors":"Teuku Yuliar Arif, R. F. Sari","doi":"10.1109/ICON.2013.6781982","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781982","url":null,"abstract":"In DCF and EDCA schemes, the number of collisions increased caused the number of anomalous slots also increased. These conditions caused the average duration of collision will be much longer and result in a decreased network throughput. In this paper we have proposed SASA scheme to avoid anomalous slot after the collision. Simulation results show SASA scheme produces higher throughput compare to DCF and EDCA schemes.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114987634","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}
{"title":"Security testing in Android networks - A practical case study","authors":"R. Hunt","doi":"10.1109/ICON.2013.6781950","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781950","url":null,"abstract":"Android is a new generation of an open operating system directed at mobile devices that are carried every day. The openness of this architecture is leading to new applications and opportunities including a host of multimedia services, new interfaces and browsers, multitasking including support for wireless local, personal and wide area networking services. Security with mobility and wireless connectivity thus becomes even more important with all these exciting developments. Vital security issues such as leakage of private information, file stealing and spambots abound in networks in practice and Android networks continue to be subject to these same families of vulnerabilities. This paper provides a demonstration of such vulnerabilities in spite of the best efforts of designers and implementers. In particular it describes examples of data leakage and file stealing (address books, contact lists, SMS messages, pictures) as well as demonstrating how Android devices can create spambots.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128063490","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}