检索结果-内蒙古大学图书馆

9th IEEE International Conference on Cognitive Infocommunications (CogInfoCom)

作者： Sik, David Csorba, Kristof ekler, peter Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781538670941

In our previous research a Geographic Information System microservice was introduced as part of the SensorHUB framework and CV4SensorHUB framework. The main data sources and architectural background was presented. The purpose of the GIS microservice is also to serve as a research and development subsystem connecting the two frameworks. We implemented services to show the strength of the microservice architecture-based framework ecosystem. For this we also used the terminology of Industrial Data Space architecture model. In this paper we present case studies showing how it connects the frameworks, how the data flow can be controlled;or how it collects location-based data from smartphone environments. Another case study introduces a route planning service using current live data from different data sources. The paper also presents the possibilities of load-based, network traffic-based and code-based performance measurement in the system with the comparison of different data aggregation methods (Java-based and MapReduce-based implementation) towards the cognitive data analysis and human-machine interface.

关键词： GIS Data analysis Performance measurement MapReduce Big Data

来源：评论

学校读者我要写书评

暂无评论

Implementation of Network Coding with Recoding for Unequal-sized and Header Compressed Traffic

Implementation of Network Coding with Recoding for Unequal-s...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Taghouti, Maroua Tomoskozi, Mate Howeler, Malte Lucani, Daniel E. Fitzek, Frank H. P. Bouallegue, Ammar ekler, peter Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany Univ Carthage Tunisia Polytech Sch Tunis Tunisia Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary Aarhus Univ Dept Engn Aarhus Denmark

ISBN: (纸本)9781538676462

Coding techniques that are employed to resolve packet losses on wireless channels, such as Random Linear Network Coding (RLNC), market themselves with the advantage of requiring less signalling, as well as, retransmissions of missing packets to compensate for losses on unreliable links. However, as packet sizes of IP-based protocols can be distributed irregularly over the available maximum frame size and can vary considerably packet-by-packet, the current implementations of RLNC suffer from shifting header and/or payload lengths and lack a suitable way of compensation. The simplest solution adopted by most RLNC approaches is to pad the unequal packets with zeros to the maximum packet size, thus creating an unnecessary transmission overhead of 100 % or more. This paper presents a practical implementation of the new progressive shortening based RLNC for the first time. This scheme utilizes fixed-sized regions inside the packets to resolve the zero-padding overhead and generates unequal-sized coded packets. Furthermore, it introduces a recoding feature for this scheme, which is another advantage of RLNC over other coding techniques, and breaks with the point-to-point topology considered in previous works. Moreover, we combine this novel macro-symbol based coding scheme with Robust Header Compression version 2 (RoHCv2) to show the gain over traditional implementation of RLNC in a real-life application where varying packet lengths dominate during transmissions. Our implementations results, using the KODO network coding library, show that the encoding throughput is as good as the established RLNC methods, and the payload delivery efficiency can be enhanced by up to 20 %.

关键词： Encoding Decoding Network coding Protocols Redundancy Complexity theory Conferences

来源：评论

学校读者我要写书评

暂无评论

An analysis on the revoking mechanisms for JSON Web Tokens

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年第9期19卷 1-10页

作者： Janoky, Laszlo Viktor Levendovszky, Janos ekler, peter Budapest Univ Technol & Econ Dept Automat & Appl Informat Magyar Tudosok Krt 2 H-1117 Budapest Hungary Budapest Univ Technol & Econ Dept Telecommun & Media Informat Budapest Hungary

JSON Web Tokens provide a scalable solution with significant performance benefits for user access control in decentralized, large-scale distributed systems. Such examples would entail cloud-based, micro-services styled systems or typical Internet of Things solutions. One of the obstacles still preventing the wide-spread use of JSON Web Token-based access control is the problem of invalidating the issued tokens upon clients leaving the system. Token invalidation presently takes a considerable processing overhead or a drastically increased architectural complexity. Solving this problem without losing the main benefits of JSON Web Tokens still remains an open challenge which will be addressed in the article. We are going to propose some solutions to implement low-complexity token revocations and compare their characteristics in different environments with the traditional solutions. The proposed solutions have the benefit of preserving the advantages of JSON Web Tokens, while also adhering to stronger security constraints and possessing a finely tuneable performance cost.

关键词： JSON Web Tokens security access control distributed systems

来源：评论

学校读者我要写书评

暂无评论

Mobile Peer-to-Peer Assisted Coded Streaming

引用

IEEE ACCESS 2019年 7卷 159332-159346页

作者： Braun, Patrik J. Budai, Adam Levendovszky, Janos Sipos, Marton ekler, peter Fitzek, Frank H. P. Budapest Univ Technol & Econ Dept Automat & Appl Informat H-1111 Budapest Hungary Budapest Univ Technol & Econ Dept Networked Syst & Serv H-1111 Budapest Hungary Tech Univ Dresden Deutsch Telekom Chair Commun Networks D-01069 Dresden Germany Tech Univ Dresden Ctr Tactile Internet Human Loop CeTI D-01069 Dresden Germany

Current video streaming services use a conventional, client-server network topology that puts a heavy load on content servers. Previous work has shown that Peer-to-Peer (P2P) assisted streaming solutions can potentially reduce this load. However, implementing P2P-assisted streaming poses several challenges in modern networks. Users tend to stream videos on the go, using their mobile devices. This mobility makes the network difficult to orchestrate. Furthermore, peers have to contribute their storage to the network, which is challenging, since mobile devices have limited resources compared to desktop machines. In this paper, we introduce an analytical framework for mobile P2P-assisted streaming to estimate the server load that we define as the minimum required server upload rate. Using our framework, we evaluate four caching strategies: infinite cache as a baseline, first in first out (FIFO), random, and Random Linear Network Coded (RLNC) cache. We verify our analytical results with empirical data that was obtained by carrying out extensive measurements on our working P2P system. Our results show that when employing FIFO, random, and RLNC caching strategies, the server load converges to that of the infinite cache as the cache size increases. With a limit of 5 P2P connections per peer, we show that using the random caching, peers can store 40 fewer packets and still achieve the same benefit as with FIFO caching. When using the RLNC caching, it is enough to store 50 fewer packets to achieve the same benefit.

关键词： Servers Streaming media Peer-to-peer computing Protocols Mobile handsets Network coding Licenses Caching analysis network coding peer-to-peer system implementation video streaming

来源：评论

学校读者我要写书评

暂无评论

Gamification and driving decision support using the sensors of vehicles and smartphones

引用

INTELLIGENT DECISION TECHNOLOGIES-NETHERLANDS 2017年第4期11卷 423-430页

作者： Sik, David ekler, peter Lengyel, Laszlo Budapest Univ Technol & Econ Dept Automat & Appl Informat Magyar Tudosok Krt 2Bldg Q H-1117 Budapest Hungary

Vehicles are not just a means of transportation anymore, but they are also moving entities that collect and transmit a great amount of data, captured by sensors from the internals of the vehicle and from its environment as well. These data extended with smartphone sensors can be a stable base for smart car-based infocommunication systems. There are two main interfaces to extract the data from a vehicle: OBD-II (On-board Diagnostics) and CAN bus (Controller Area Network bus). This paper introduces an advanced measurement tool, called ObdCanCompare. The purpose of this tool is to provide an environment to compare these data streams in real time and conclude how and which interface can be used for derivation of driving decisions. It also enables creating business intelligence reports using the SensorHUB-based backend, which is our data collection and service development for sensor networks, smart devices and cloud-based backend environments. Results show that the OBD-II interface is quite accurate compared to CAN bus, in order to demonstrate this we have created the Social Driving application as a socio-cognitive ICT pilot application that displays vehicle data to users from OBD-II and enables to compare usage statistics of different drivers in the network as a socio-cognitive gamification.

关键词： OBD-II CAN SensorHUB VehicleICT driving decision gamification socio-cognitive ICT

来源：评论

学校读者我要写书评

暂无评论

The Analysis of Participatory Computing in Dynamic Web Environments 15

The Analysis of Participatory Computing in Dynamic Web Envir...

引用

15th IEEE International Symposium on Applied Machine Intelligence and Informatics (SAMI)

作者： Janoky, Laszlo Viktor ekler, peter Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781509056552

Participatory Computing is the concept of a group of computers contributing processing power and storage to form a larger, distributed computing system. Past experiences show that a system of this type can reach performance rivaling the fastest supercomputers in the world. In theory, any connected modern PC could participate and yet the prevalence of these systems is not comparable to their potential numbers. In this paper, we analyze the main barriers ahead the larger adaptation of participatory systems and propose solutions around them. Ultimately by applying these solutions we prove their workability by showing and evaluating a proof-of-concept system and measurements related to it. The proposed results can offer several advantages in the field of participatory computing where the new technologies are applied.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Implementation of a Geographic Information System with Big Data Environment on Common Data Model 8

Implementation of a Geographic Information System with Big D...

引用

8th IEEE International Conference on Cognitive Infocommunications (CogInfoCom)

作者： Sik, David Csorba, Kristof ekler, peter Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781538612644

We introduce an implementation of a GIS (Geographic Information System) research and development subsystem in the CV4SensorHUB (Computer Vision for SensorHUB) framework. The main concept is the usage and connection of open-access online databases such as OpenStreetMaps, Citybik. es, BKK Futar, MAV Elvira and others. These databases cover different fields in the geographic domain. By connecting these databases with MapReduce paradigm and implementing smart algorithms, we are about to create an online tool where users could parametrize their trips around the town, using the live information and then visualize them on a map. For example, with the OpenStreetMaps it is possible to extract the maps, streets, POIs (point of interest), then with the Citybik. es we can get the live data about public bicycle sharing system, and with the BKK Futar we can access the live public transportation data, vehicles, timetables. In this paper, we focus on the data sources, the architecture with its common data model, and the main implementation steps of the system.

关键词： GIS Geospatial MapReduce Big Data Common Data Model

来源：评论

学校读者我要写书评

暂无评论

Initial Concept of an Oracle-Structured Stream Compression Protocol for Arbitrary Network Flows

Initial Concept of an Oracle-Structured Stream Compression P...

引用

European Wireless Conference

作者： Mate Tomoskozi Mingchuan Luo Frank H. P. Fitzek peter ekler

ISBN: (纸本)9783800749485

Next generation use-cases of wireless networks require a great deal of flexibility in order to adopt to the constantly changing state of innovation and to accommodate future application requirements. Header compression has been an ever present solution since the advent of wireless networks and the most current version of it, Robust Header Compression (RoHC), has seen a widespread adoption in Long Term Evolution (LTE) cellular networks. Recent research has mostly focused on the integration and enhancement of RoHC, instead of advancing the core concept of the compression. In this paper we present for the first time a novel design that can tackle the compression of arbitrary packet streams regardless of the employed protocols and the transmitted data. We present our initial findings for an error-free scenario with various simulated and real-life packet streams and show that even with the absence of design time knowledge about the packet structures, one can compress a significant part of the streams, yielding compression gains for IP packets up to 90%, as an example.

关键词： Header compression Network flows Stream compression Adaptability Internet of things Machine learning Network function virtualisation

来源：评论

学校读者我要写书评

暂无评论

Header Compression in Opportunistic Routing

Header Compression in Opportunistic Routing

引用

European Wireless 2018;24th European Wireless Conference

作者： Mate Toemoeskoezi Ievgenii Tsokalo Sreekrishna Pandi Frank H.P. Fitzek peter ekler

Next generation use-cases of wireless mesh networks, especially the Massive Machine Type Communications and IoT applications require the capability to handle a large number of connections while maintaining a low-energy usage. In such cases, the transmissions between source and destination can employ multiple paths. The throughput in a scenario like this can be maximised with application of Opportunistic Routing (OpR). In high density networks, the OpR uses the diversity of the broadcast channel to increase the achievable data rates in comparison to traditional routing solutions. However, the header size of the routing messages increases when the density grows. The reduction of this overhead could potentially improve the overall throughput and decrease the battery usage of network heavy applications via diminished wireless interface activity. Normally, header compression is employed to minimise the overhead of IP-based cellular traffic between two connected peers. This paper presents for the first time the application of header compression concepts to an opportunistic routing protocol. We use a packet erasure channel simulator to employ these header compression techniques on the routing messages based on real world mesh network traces. We thereby decrease the size of the routing messages in these simulated topologies and find that they can reduce the size of transmission heavy header elements by at least 50 % and can be even as high as 85 % under certain conditions. This increases the potential of opportunistic routing in very large mesh networks, as the reduction in feedback message sizes would increase the maximum achievable data rates exponentially.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Applying Robust Header Compression version 2 for UDP and RTP Broadcasting with Field Constraints 85

Applying Robust Header Compression version 2 for UDP and RTP...

引用

IEEE 85th Vehicular Technology Conference (VTC Spring)

作者： Tomoskozi, Mate Seeling, Patrick ekler, peter Fitzek, Frank H. P. Acticom GmbH Berlin Germany Aalborg Univ Dept Elect Syst Aalborg Denmark Tech Univ Dresden Commun Networks Grp Dresden Germany Cent Michigan Univ Dept Comp Sci Mt Pleasant MI 48859 USA Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781509059324

Next generation applications of wireless IP networks face an ever increasing demand of real-time dissemination of sensory and similar data to nearby devices. During situations when the transmission capabilities become scarce due to overused bandwidth, such as vehicular and various IoT use-cases, limiting the number of transmitted bytes over the wireless interfaces could ease the network load considerably. One of the main potential approaches for reducing the traffic in such scenarios is broadcasting, which could be even more efficient when paired with compression approaches, such as header compression. Normally header compression is employed to minimise the overhead of IP-based cellular traffic between two directly connected peers. However, in broadcasting scenarios, the compression has to balance the trade-off between servicing the least reliable channels (i.e., robustness to losses) and performing at peak compression rates (generating smaller packet headers). In order to circumvent these limitations, we propose a constraint on various IP and RTP fields when employing the industry-standard Robust Header Compression version 2 (which was designed for direct links) in a broadcast scenario without modifications of the underlying mechanisms, i.e., with full RFC compliance. With this approach the compression becomes impervious to packet losses up to 50% and for UDP profile compression with IPv6 it is practically unaffected by the link quality. In turn the compression retains at least 50 % efficiency but can be as high as 90 %.

关键词： Robust header compression Mobile multimedia Cellular networks Bandwidth savings Broadcasting V2V IoT

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：