发布求助
文献互助 智能选刊 最新文献

2015 IEEE Symposium on Computers and Communication (ISCC)最新文献

筛选
英文 中文
Digital signal processing for a sliceable transceiver for optical access networks 用于光接入网的可切片收发器的数字信号处理
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405561
Silvia Saldaña Cercós, C. Wagner, J. Olmos, A. M. Fagertun, I. Monroy
{"title":"Digital signal processing for a sliceable transceiver for optical access networks","authors":"Silvia Saldaña Cercós, C. Wagner, J. Olmos, A. M. Fagertun, I. Monroy","doi":"10.1109/ISCC.2015.7405561","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405561","url":null,"abstract":"Methods to upgrade the network infrastructure to cope with current traffic demands has attracted increasing research efforts. A promising alternative is signal slicing. Signal slicing aims at re-using low bandwidth equipment to satisfy high bandwidth traffic demands. This technique has been used also for implementing full signal path symmetry in real-time oscilloscopes to provide performance and signal fidelity (i.e. lower noise and jitter). In this paper the key digital signal processing (DSP) subsystems required to achieve signal slicing are surveyed. It also presents, for the first time, a comprehensive DSP power consumption analysis for both WDM and TDM systems at 1 Gbps and 10 Gbps, discussing latency penalties for each approach. For 1 Gbps WDM system 278 pJ per information bit for 4 slices is reported at 105 ns latency penalties, whereas 3898.4 pJ per information bit at 183.5 μs latency penalty is reported for 10 Gbps. Power savings of the order of hundreds of Watts can be obtained when using signal slicing as an alternative to 10 Gbps implemented access networks.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124398128","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
Equalizer placement and wavelength selective switch architecture for optical network security 用于光网络安全的均衡器放置和波长选择开关结构
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405631
K. Manousakis, G. Ellinas
{"title":"Equalizer placement and wavelength selective switch architecture for optical network security","authors":"K. Manousakis, G. Ellinas","doi":"10.1109/ISCC.2015.7405631","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405631","url":null,"abstract":"In this work, a node architecture based on wavelength selective switches with feedback loop attenuators that can be used as power equalizers, as well as an optimization algorithm are utilized in order to minimize the impact of physical layer jamming attacks in optical networks, while also minimizing the capital expenditure (Capex) of the network. Due to crosstalk-induced interactions among different connections, malicious high-power jamming signals can potentially spread widely in the network. Therefore, it is necessary to design an optical network in a way that the spread of an attack is minimized. This is achieved in this work by the design of appropriate power equalizer placement and attack-aware Routing and Wavelength Assignment (RWA) algorithms in the form of Integer Linear Program (ILP) formulations. Performance results indicate that the proposed algorithms minimize the number of required equalizers for zero lightpath interactions without the need of additional wavelength resources.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116684282","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}
引用次数: 10
Evaluating the impact of network I/O on ultra-low delay packet switching 评估网络I/O对超低延迟分组交换的影响
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405547
G. Baltas, G. Xylomenos
{"title":"Evaluating the impact of network I/O on ultra-low delay packet switching","authors":"G. Baltas, G. Xylomenos","doi":"10.1109/ISCC.2015.7405547","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405547","url":null,"abstract":"Low latency is a crucial requirement for demanding conferencing applications, such as Networked Music Performance (NMP), the collaboration of musicians in real time. Modern conferencing systems employ a Selective Forwarding Unit (SFU) to transparently duplicate and forward media streams between participants. Since an SFU does not process the media streams, so as to reduce delay, its latency is mainly determined by the underlying network I/O mechanism that moves packets to/from the network hardware and user space. Such mechanisms are usually based on POSIX sockets, which were not designed for high performance networking. We designed and implemented pktswitch, a minimal, socket-based SFU and measured its performance. We then modified pktswitch to employ netmap, a framework for fast packet I/O, to overcome the performance bottlenecks imposed by the socket-based design. The modified implementation handles packets in user space, with minimal kernel interaction. We describe and contrast the two implementations and then compare their performance in terms of packet processing overhead and delay. Our results show that the netmap-based implementation reduces packet processing overhead by 76% and delay by 89% compared to the socket-based implementation, thus allowing an SFU to host much higher loads (e.g. more users with more media streams and higher bit rates) without introducing delays.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121039853","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}
引用次数: 3
Estimating queue formation rate in Wireless Sensor Networks using a fluid dynamic model 利用流体动力学模型估计无线传感器网络中的队列形成速率
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405571
Charalambos Sergiou, V. Vassiliou, Aristodemos Paphitis
{"title":"Estimating queue formation rate in Wireless Sensor Networks using a fluid dynamic model","authors":"Charalambos Sergiou, V. Vassiliou, Aristodemos Paphitis","doi":"10.1109/ISCC.2015.7405571","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405571","url":null,"abstract":"Estimating the rate, with which the buffers of the nodes in a Wireless Sensor Network (WSN) fill-up, can contribute to the efficient operation of congestion control algorithms. In this paper we attempt, using a macroscopic fluid dynamic model, to estimate the rate with which the buffers of nodes fill-up, when congestion occurs in the network. This estimation can become a useful tool for the development of particular mechanisms, for congestion or overload control algorithms, that can improve their performance.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121109253","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
Two-phase load balancing of In-Memory Key-Value Storages through NFV and SDN 通过NFV和SDN实现内存中键值存储的两阶段负载均衡
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405549
Alex F. R. Trajano, M. Fernandez
{"title":"Two-phase load balancing of In-Memory Key-Value Storages through NFV and SDN","authors":"Alex F. R. Trajano, M. Fernandez","doi":"10.1109/ISCC.2015.7405549","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405549","url":null,"abstract":"Social networks and other clouding applications should require a fast response from datacenter's infrastructure. One of the techniques that has been widely used for achieving such requirements is the employment of In-Memory Key-Value Storage (IMKVS) as caching mechanisms in order to improve overall user experience. Memcached and Redis are applications that use IMKVS approach. Commonly IMKVS clients use Consistent Hashing to decide where to store an object, which may cause network load imbalance. Furthermore, these clients work only at the application layer, so network conditions are not considered to distribute user's accesses. This paper proposes a new cache architecture with two phases load balancing to improve IMKVS performance, which has adopted a Network Function Virtualization (NFV) architecture to manage the load balancing mechanism. The proposal was evaluated in the Mininet emulation environment and shows an improvement on load balancing giving best user experience.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116547456","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}
引用次数: 8
EDCA virtual collision performance evaluation and mobility modeling in V2I communications V2I通信中EDCA虚拟碰撞性能评估与移动性建模
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405558
Naila Bouchemal, R. Naja, Mahmoud Moubarak, S. Tohmé
{"title":"EDCA virtual collision performance evaluation and mobility modeling in V2I communications","authors":"Naila Bouchemal, R. Naja, Mahmoud Moubarak, S. Tohmé","doi":"10.1109/ISCC.2015.7405558","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405558","url":null,"abstract":"EDCA virtual collision management is a penalizing process that occurs in Intelligent Transportation Systems (ITS). It induces unfairness, priority inversion and quality of service degradation. This paper tackles the performance evaluation of the virtual collision management proposed by IEEE in vehicular environment and overviews the quality of service in presence of three ITS applications: Warning to a foggy zone, inter-distance measurement and road awareness. We perform a mathematical modelling based on a discrete Markov chain that tackles vehicles mobility. The objective of our study is to show the impact of virtual collision on vehicular network performance and dimension the RSU coverage area.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"5 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114130291","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}
引用次数: 4
Towards a performance characterization of a parallel file system over virtualized environments 在虚拟化环境中对并行文件系统进行性能表征
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405579
E. C. Inacio, M. Dantas, D. D. J. D. Macedo
{"title":"Towards a performance characterization of a parallel file system over virtualized environments","authors":"E. C. Inacio, M. Dantas, D. D. J. D. Macedo","doi":"10.1109/ISCC.2015.7405579","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405579","url":null,"abstract":"This research work investigates the performance impact of virtualizing parallel file systems' (PFS) environments. Through an extensive experimental analysis, using three distinct computing platforms and considering 11 factors with relevant impact on systems' performance, we demonstrate how PFSs' write throughput is affected by network and disk contentions on virtualized environments. Results indicate that on extreme cases, in which the whole PFS environment executes over a single host, performance losses of up to 93% are observed when the number of I/O and computing nodes increases. On a PFS's environment deployed over Microsoft Azure cloud infrastructure, where it is expected a more balanced resource sharing, network contention proved more critical causing performance losses of up to 80% with the increase of the number of I/O nodes. Disk contention in this environment, however, was not an issue, behaving more like an environment deployed over a dedicated cluster.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128768532","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}
引用次数: 5
Digital reconstruction stage of parallel FBD sigma delta ADC implementation based on programmable digital oscillator in SDR receiver 基于可编程数字振荡器的SDR接收机中并行FBD σ δ ADC的数字重构阶段实现
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405586
Rihab Lahouli, M. Ben-Romdhane, C. Rebai, D. Dallet
{"title":"Digital reconstruction stage of parallel FBD sigma delta ADC implementation based on programmable digital oscillator in SDR receiver","authors":"Rihab Lahouli, M. Ben-Romdhane, C. Rebai, D. Dallet","doi":"10.1109/ISCC.2015.7405586","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405586","url":null,"abstract":"This paper presents a programmable parallel frequency band decomposition (FBD) ADC which can be used in a software defined radio (SDR) receiver intended for wireless communication standards. The designed parallel ADC architecture is composed of 6 parallel branches based on discrete-time (DT) 4th order ΣΔ modulators using single-bit quantizers. This paper is focused essentially on the digital reconstruction stage of the designed FBD architecture. The FBD architecture with a demodulation-based digital reconstruction is digitally implemented on a field programmable gate array (FPGA) target from Xilinx Inc. The frequency conversions performed in the digital reconstruction stage are ensured by a digital oscillator which is carefully tuned to obtain the required frequencies and phases for demodulation and modulation operations. Technical choices and simulation results are discussed. For UMTS use case, the implemented FBD ADC architecture ensures a computed signal-to-noise-ratio (SNR) equal to 74.42 dB.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129013087","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
QoE-based radio resource allocation in LTE femtocell considering transport limitations 考虑传输限制的LTE飞基站基于qos的无线资源分配
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405553
Ming Li, P. N. Tran, Huseyin Kerem Tutuncuoglu, A. Timm‐Giel
{"title":"QoE-based radio resource allocation in LTE femtocell considering transport limitations","authors":"Ming Li, P. N. Tran, Huseyin Kerem Tutuncuoglu, A. Timm‐Giel","doi":"10.1109/ISCC.2015.7405553","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405553","url":null,"abstract":"In this paper, we study the QoE-based resource allocation problem for downlink direction in LTE femtocells, considering the transport network limitation. We first formulate the problem as a convex optimization problem, which maximizes the aggregated QoE of all users and solve it using Lagrangian relaxation method. This approach provides an ideal resource allocation solution but it is not practical, because the allocated bandwidth in the model is assumed to be a real value, while in practice, only an integer amount of Physical Resource Blocks (PRBs) can be assigned to a user. However, it is considered as a benchmark for our new developed algorithm. Then we propose an efficient heuristic, which can be applied in real LTE systems. The heuristic is mathematically proven to provide an optimal solution in case there is no limitation in the transport network. In case of transport network limitation, the simulation results show that it gives almost identical performance (ca. 1%) as the optimal solution in the investigated scenario.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124961616","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
Enhancing intelligence in inter-vehicle communications to detect and reduce congestion in urban centers 加强车际通信智能化，检测和减少城市中心拥堵
2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.8897528
R. Meneguette, G. P. R. Filho, L. Bittencourt, J. Ueyama, B. Krishnamachari, L. Villas
{"title":"Enhancing intelligence in inter-vehicle communications to detect and reduce congestion in urban centers","authors":"R. Meneguette, G. P. R. Filho, L. Bittencourt, J. Ueyama, B. Krishnamachari, L. Villas","doi":"10.1109/ISCC.2015.8897528","DOIUrl":"https://doi.org/10.1109/ISCC.2015.8897528","url":null,"abstract":"Cities with a large number of people are currently facing urban mobility problems, especially the problem of traffic congestions. This not only has an adverse effect on the economy of the city, but also impairs the quality of life of its citizens. One measure that can be adopted to mitigate these problems is the use of systems that help identify, reduce, and/or avoid these traffic jams, such as intelligent transport systems. In this context, we propose an intelligent traffic information system called UCONDES, which is based on inter-vehicle communications and can be applied to detect and reduce congestion in urban centers. Simulation results shows that, when compared to original vehicular mobility trace, our solution reduces the average trip time, and the overall CO2 emission and fuel consumption. More specifically, the average travel time for drivers was reduced by approximately 26%, resulting in a reduction of fuel consumption by 23% and the CO2 emission by 25%.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130595620","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}
引用次数: 26
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书