2010 IEEE Latin-American Conference on Communications最新文献

Cost-performance optimization of SSL-based secure distributed infrastructures 基于ssl的安全分布式基础设施的性价比优化

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-12-17 DOI: 10.1109/LATINCOM.2010.5669373

S. Bregni, P. Giacomazzi, A. Poli

{"title":"Cost-performance optimization of SSL-based secure distributed infrastructures","authors":"S. Bregni, P. Giacomazzi, A. Poli","doi":"10.1109/LATINCOM.2010.5669373","DOIUrl":"https://doi.org/10.1109/LATINCOM.2010.5669373","url":null,"abstract":"Business-to-Business and Business-to-Customer transactions in Internet require secure communication, especially for web applications. The Secure Socket Layer (SSL) protocol is one of the most viable solutions to provide the required level of confidentiality, message integrity and endpoint authentication. The two main alternatives for providing SSL security are the endto- end and the accelerated solutions, which enable different costperformance tradeoffs, where performance is intended as the overall delay that the customer experiences to complete the transaction. The accelerated solution is enabled by special devices (SSL acceleration cards) placed in network nodes. In this paper, we propose an optimization algorithm, which designs the ICT infrastructure minimizing the total cost, given a target performance objective defined as the end-to-end delay for the completion of the distributed application tasks. We apply this method to evaluate the efficiency of SSL acceleration versus end-to-end SSL, in order to determine in what conditions SSL acceleration is convenient. Our algorithm performs joint optimization of computing and communication resources, whilst in literature hardware and network are typically optimized separately.","PeriodicalId":308819,"journal":{"name":"2010 IEEE Latin-American Conference on Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124133326","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}

引用次数: 0

Time domain method for power line channel statistical identification 电力线信道统计识别的时域方法

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5641114

Martin Guzzo, Nicolas Amaya, R. Linares, H. Daniel Patiño

引用次数: 2

Performance analysis of scheduling algorithms in Next Generation Networks 下一代网络调度算法的性能分析

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5641004

J. C. Cuéllar, A. Navarro

引用次数: 1

Evaluation of the TCP TS-Prio protocol using Markovian models 用马尔可夫模型评价TCP TS-Prio协议

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5640974

Lincoln Herbert Teixeira, E. Wille, W. Godoy

引用次数: 0

Provision of local and mobile services in DVB-T networks 在DVB-T网络中提供本地及流动服务

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5640982

J. López-Sánchez, Carlos Romero Ruescas, D. Gómez-Barquero, N. Cardona

引用次数: 2

Energy reduction for centralized cognitive radio networks with distributed cognitive pilot channels 具有分布式认知导频信道的集中式认知无线网络的能量降低

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5640983

Nicolás Bolívar, J. Marzo

引用次数: 6

An optimal solution to the MCDS problem for topology construction in wireless sensor networks 无线传感器网络拓扑结构中MCDS问题的最优解

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5641018

P. Wightman, Aldo Fabregasy, Miguel A. Labradorz

{"title":"An optimal solution to the MCDS problem for topology construction in wireless sensor networks","authors":"P. Wightman, Aldo Fabregasy, Miguel A. Labradorz","doi":"10.1109/LATINCOM.2010.5641018","DOIUrl":"https://doi.org/10.1109/LATINCOM.2010.5641018","url":null,"abstract":"Topology Construction (TC) is a very well-known technique to save energy and extend the lifetime of wireless sensor networks. One common approach to implement TC is to select a small subset of nodes that can accomplish the global objective of the network and put the rest of the nodes in a low energy consumption mode to use their energy in the future. One way to select this subset of nodes is by solving the Minimum Connected Dominating Set problem (MCDS). This paper presents a Mixed Integer Programming (MIP) formulation that finds the optimal solution to this problem. The formulation is proposed as a benchmarking tool to compare the performance of existing and new heuristics that approximate the solution to the same problem. In fact, the paper compares the performance of three well-known CDS-based topology construction protocols versus the MIP-MCDS formulation. The results show that, in terms of the size of the CDS, the distance between the optimal and the approximate solutions increases with the communication radius and the number of nodes. In terms of the solution time, for low density and high node degree topologies the mathematical programming formulation is comparable, and sometimes better, to that of the heuristics. However, in topologies with low node degree and high node density the heuristic solutions outperform the mathematical programming solution.","PeriodicalId":308819,"journal":{"name":"2010 IEEE Latin-American Conference on Communications","volume":"4 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131611421","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}

引用次数: 6

Scalable and robust JPEG 2000 images and video transmission system for multiple wireless receivers 用于多个无线接收器的可扩展和鲁棒的JPEG 2000图像和视频传输系统

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5641128

Cristina Mairal, M. Agueh

引用次数: 4

Performance analysis of a new scheduler with call admission control (CAC) for IEEE 802.16 with delay bound guarantee 基于延迟绑定保证的ieee802.16新调度器的性能分析

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5641001

E. R. Dosciatti, W. Godoy, A. Foronda

{"title":"Performance analysis of a new scheduler with call admission control (CAC) for IEEE 802.16 with delay bound guarantee","authors":"E. R. Dosciatti, W. Godoy, A. Foronda","doi":"10.1109/LATINCOM.2010.5641001","DOIUrl":"https://doi.org/10.1109/LATINCOM.2010.5641001","url":null,"abstract":"WiMAX is a project developed by the Working Group of IEEE 802.16 standard for broadband wireless access networks in Metropolitan Area Network (MAN). One of the features of MAC layer, this standard, is that it is designed to differentiate service among traffic categories with different multimedia requirements. Based on these assumptions and considering that the standard does not specify a scheduling algorithm, a new scheduler with call admission control was proposed based on Latency-Rate (LR) server theory and system characteristics specified by the standard for systems using the WirelessMAN-OFDM (Orthogonal Frequency Division Multiplexing) air interface. The proposed scheduling algorithm calculates the time frame (TF) in order to maximize the number of stations allocated in the system while managing the delay required for each user. Properties of this proposal have been investigated theoretically and through simulations. A set of simulations is presented with both Constant Bit Rate (CBR) and Variable Bit Rate (VBR) and performance comparisons among with different delays and different TFs. The results show that the delay upper bound can be achieved for a large range of networks load with bandwidth optimization.","PeriodicalId":308819,"journal":{"name":"2010 IEEE Latin-American Conference on Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124025039","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}

引用次数: 1

Method for experimental model design of quality of services 服务质量实验模型设计方法

2010 IEEE Latin-American Conference on Communications Pub Date : 2010-11-18 DOI: 10.1109/LATINCOM.2010.5640995

Carolina Tamara, Josheff David, P. Sanmartín, José Márquez

引用次数: 0