Pinar Sarisaray, Gürkan Gür, S. Baydere, A. E. Harmanci
{"title":"Performance Comparison of Error Compensation Techniques with Multipath Transmission in Wireless Multimedia Sensor Networks","authors":"Pinar Sarisaray, Gürkan Gür, S. Baydere, A. E. Harmanci","doi":"10.1109/MASCOTS.2007.50","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.50","url":null,"abstract":"Due to the proliferation of the multimedia applications over unreliable medium like wireless networks, robust image and video communication have become more important. In this paper, we consider the transmission distortions on the multimedia data due to both channel impairments and instant node failures for Wireless Multimedia Sensor Networks (WMSN). Two techniques are investigated to compensate the multimedia distortions at the expense of incurring additional delays and/or wasting bandwidth resources. First technique is an error concealment technique utilizing discrete wavelet transform for embedding downsized replicas of original image into itself, thereby mitigating degradations in a backward-compatible scheme. The other is Reed-Solomon coding utilizing additional information bits to correct bit/symbol errors. Two techniques are also integrated with multipath transmission to provide fault tolerance. Performance results show that error concealment with multipath transmission technique (ECMF) is more promising to compensate for losses due to unreliable channels and instant node failures than Reed-Solomon coding with multipath transmission technique (RSMF) in WMSN.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131359464","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":"Performance Analysis of Wireless MAC Protocols Using a Search Based Framework","authors":"S. Begum, S. Gupta, A. Helmy","doi":"10.1109/MASCOTS.2007.49","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.49","url":null,"abstract":"Previously, we have developed a framework to perform systematic analysis of CSMA/CA based wireless MAC protocols. The framework first identifies protocol states that meet our study objective of minimizing a given performance metric. It then applies search techniques and heuristics to construct sequences of protocol events in a given topology that satisfy our objective. In this paper, we demonstrate that our framework can easily be extended to evaluate performance of new protocols by evaluating two completely different variants, namely MAC protocols for (i) quality of service (QoS), and (ii) power control. In each case, we identify previously unknown problems with the protocol. In particular, we generate scenarios where throughput of a lower priority class can be as high as 5 times compared to the throughput of a higher priority class, thus contradicting the basic notion of QoS. Traditional performance evaluation approaches typically evaluate average performance but do not capture the worst cases, nor do they expose the protocol breaking points. Thus this paper demonstrates the usefulness of a systematic approach in evaluating the protocol breaking points.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103334","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":"Reducing Hybrid Disk Write Latency with Flash-Backed I/O Requests","authors":"Timothy Bisson, S. Brandt","doi":"10.1109/MASCOTS.2007.57","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.57","url":null,"abstract":"One of the biggest bottlenecks in desktop-based computing is the hard disk with I/O write latency being a key contributor. I/O write latency stems from the mechanical nature of hard disks, with seek and rotational delays the major components. Hybrid disk drives place a small amount of flash memory (NVCache) on the drive itself which can be leveraged by the host and has the potential to increase I/O performance and reduce hard disk power consumption. We present an I/O scheduling algorithm, \"Flash-Backed I/O Requests\", which leverages the on-board flash to reduce write latency. Since flash memory and rotating media have different I/O characteristics, predominantly in random access context, an I/O scheduler can decide which media will most efficiently service I/O requests. Our results show that with Flash-Backed I/O requests, overall write latency can be reduced by up to 70%.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129405826","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}
H. T. Marques-Neto, Virgílio A. F. Almeida, J. Almeida
{"title":"Pricing Broadband Internet Adaptive Services","authors":"H. T. Marques-Neto, Virgílio A. F. Almeida, J. Almeida","doi":"10.1109/MASCOTS.2007.53","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.53","url":null,"abstract":"Broadband Internet pricing scheme should charge users based on their consumption pattern. It could avoid resource wasting because light users will not have to subsidize heavy users. Furthermore, a fair pricing scheme could save bandwidth during hours of day, which would improve broadband carriers capacity management and planning efforts. This paper presents a fair broadband pricing scheme where users' adaptive applications are configured to adjust their demand in accordance with several parameters, such as user's budget, estimated future needs, and usage price defined and published by the service provider. We simulate our pricing scheme and three others schemes using real data from a broadband Internet Service Provider (ISP) in order to analyze bandwidth saving and utility obtained by users. We show that in the proposed pricing scheme 15% of users have positive payoff, 1% have negative, and for the rest of the users the payoff is zero. We also present the re-distribution of the workload curves along the time-of-day and show that bandwidth saving happens in almost 60% of all hours of the day. We compare our pricing scheme with others reported in the literature and the simulation results show the potential of our proposal.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128582183","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":"Model-free Adaptive Hysteresis for Dynamic Bandwidth Reservation","authors":"N. Akar","doi":"10.1109/MASCOTS.2007.37","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.37","url":null,"abstract":"Dynamic bandwidth reservation refers to the process of dynamically updating the bandwidth allocation to a connection between two network end points on the basis of actual aggregate traffic demand of the connection. We assume a scenario in which bandwidth updates for the connection should not be performed too frequently and the frequency of updates are thus limited to a so-called desired update rate. We propose an asynchronous model-free adaptive hysteresis algorithm for dynamic bandwidth reservations with such update frequency constraints. We validate the effectiveness of the proposed approach by comparing its bandwidth efficiency with that of a synchronous model-based dynamic bandwidth reservation mechanism from the existing literature.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125449444","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":"Improving the Efficiency of Spam Filtering through Cache Architecture","authors":"Ashok Khanal, B. S. Motlagh, T. Koçak","doi":"10.1109/MASCOTS.2007.27","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.27","url":null,"abstract":"Blacklists (BLs), also called domain name system-based blackhole list (DNSBLs) are the databases of known internet addresses used by the spammers to send out the spam mails. Mail servers use these lists to filter out the e-mails coming from different spam sources. In contrary, Whitelists (WLs) are the explicit list of senders from whom e-mail can be accepted or delivered. Mail transport agent (MTA) is usually configured to reject, challenge or flag the messages which have been sent from the sources listed on one or more DNSBLs and to allow the messages from the sources listed on the WLs. In this paper, we are demonstrating how the bandwidth (the overall requests and responses that need to go over the network) performance is improved by using local caches for BLs and WLs. The actual sender's IP addresses are extracted from the e-mail log. These are then compared with the list in the local caches to find out if they should be accepted or not, before they are checked against the global DNSBLs by running 'DNSBL queries' (if required). Around three quarters of the e-mail sources have been observed to be filtered locally through caches with this method. Provision of local control over the lists and lower search (filtering) time are the other related benefits.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131883017","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":"Nine months in the life of EGEE: a look from the South","authors":"Georges Da Costa, M. Dikaiakos, S. Orlando","doi":"10.1109/MASCOTS.2007.43","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.43","url":null,"abstract":"Grids have emerged as wide-scale, distributed infrastructures providing enough resources for always more demanding scientific experiments. EGEE is one of the largest scientific grids in production operation today, with over 220 sites and more than 30,000 CPU all over the world. A further evolution of EGEE needs to be based on knowledge of deficiencies and bottleneck of the current infrastructure and software. To provide this knowledge we analyzed nine months of job submissions on the south-east federation of EGEE. We provide information on how users submit their jobs: throughput, bursts, requirements, VO. We study the current behavior of EGEE middleware too, by evaluating its performance and the retry policy. We finally show that even if the middleware provides advanced functionality, most submissions are still embarrassingly parallel jobs.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134464639","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":"Joint-State Modeling for Open Queuing Networks with Breakdowns, Repairs and Finite Buffers","authors":"R. Chakka, E. Ever, O. Gemikonakli","doi":"10.1109/MASCOTS.2007.29","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.29","url":null,"abstract":"Networks of queues are extensively used in modelling transaction processing systems and nodes in communication networks. Today, many practical queuing systems with finite queuing capacity are widely used in communication and computing. In such systems, servers are prone to failures. In this paper, the performance modelling of a multi-node system, with finite capacity heterogeneous nodes, serving internal and external arrivals of jobs is considered. An analytical model has been developed, and solved for performability measures. Joint-state modelling approach is used for this purpose. In an attempt to improve accuracy in performability evaluation, assumptions made have been minimised and a series of computations have been performed for open queuing networks with breakdowns, repairs, and finite queuing capacity. Results obtained from the analytical model are presented comparatively with simulation results and IPP modelling.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122506664","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":"Network Performance Analysis based on Histogram Workload Models","authors":"Enrique Hernández-Orallo, Joan Vila i Carbó","doi":"10.1109/MASCOTS.2007.42","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.42","url":null,"abstract":"Network performance analysis relies mainly on two models: a workload model and a performance model. This paper proposes to use histograms for characterising the arrival workloads and a performance model based on a stochastic process. This new stochastic process works directly with histograms using a set of specific operators. The result is the buffer occupancy distribution. The loss rate and network delay distribution can be obtaining using this distribution. Three traffic models are proposed: the first model (the HD model) is a basic histogram model that is compact and short-range dependent, the second (HD(m) model) is based on obtaining several histograms using different time scales and the third (the HD(H) model) is based on the Hurst parameter and it is long-range dependent.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116947059","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":"Average Network Blocking Probabilities for TDM WDM Optical Networks with OTSIs and without WC","authors":"Cheah Huei Yoong, Pung Hung Keng, N. Krivulin","doi":"10.1109/MASCOTS.2007.12","DOIUrl":"https://doi.org/10.1109/MASCOTS.2007.12","url":null,"abstract":"Previous works have considered analytical models of TDM wavelength networks to evaluate the blocking performance, but they differ in their underlying assumptions and have varying computation complexities. In this paper, we present an analytical model of TDM WDM optical networks with optical time-slot interchangers and without wavelength converter for minimum fixed hop routing. In order to make the analysis tractable, we proposed an algorithm that works for any number of partition patterns regardless of numbers of links, wavelengths in each link, and time-slots in each wavelength. Our analytical model provides good accuracies in average network blocking probabilities when compared with the simulation results.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125431538","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}