Pub Date : 2017-06-01DOI: 10.23919/ConTEL.2017.8000052
Maja Stupalo, J. Ilic, Luka Humski, Z. Skocir, D. Pintar, M. Vranić
Online social networks (OSN) are one of the most widely adapted services of the Internet infrastructure, Facebook being one of the most popular among them. Facebook models connections between its users through the concept of “friendship”. However, the type and intensity of these connections between different people on Facebook vary significantly. In most cases, friends on Facebook correspond to mere acquaintances in real-life, with only a smaller subset representing actual close friends. The aim of research presented in this paper is to provide a method for estimating the intensity of Facebook friendships, i.e., to distinguish connections representing close friends from others. The study was performed by analyzing Facebook interactions between users (e.g. number of mutual likes, comments, shared photos, etc.) using supervised learning algorithms for binary classification of data. Among the chosen algorithms, the best results were gained by using random forest algorithm - accuracy of 84.73%.
{"title":"Applying the binary classification methods for discovering the best friends on an online social network","authors":"Maja Stupalo, J. Ilic, Luka Humski, Z. Skocir, D. Pintar, M. Vranić","doi":"10.23919/ConTEL.2017.8000052","DOIUrl":"https://doi.org/10.23919/ConTEL.2017.8000052","url":null,"abstract":"Online social networks (OSN) are one of the most widely adapted services of the Internet infrastructure, Facebook being one of the most popular among them. Facebook models connections between its users through the concept of “friendship”. However, the type and intensity of these connections between different people on Facebook vary significantly. In most cases, friends on Facebook correspond to mere acquaintances in real-life, with only a smaller subset representing actual close friends. The aim of research presented in this paper is to provide a method for estimating the intensity of Facebook friendships, i.e., to distinguish connections representing close friends from others. The study was performed by analyzing Facebook interactions between users (e.g. number of mutual likes, comments, shared photos, etc.) using supervised learning algorithms for binary classification of data. Among the chosen algorithms, the best results were gained by using random forest algorithm - accuracy of 84.73%.","PeriodicalId":410388,"journal":{"name":"2017 14th International Conference on Telecommunications (ConTEL)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123788698","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}
Pub Date : 2017-06-01DOI: 10.23919/ConTEL.2017.8000010
W. Kellerer
All areas of our information society depend on communication networks as a basic infrastructure. Emerging applications raise the need for dynamic changes of the required networking resources, for example, to react to social events or to shifts of demands over time. Providing the required flexibility to react to those changes and being cost efficient at the same time has recently become a huge challenge in research. With Software Defined Networking (SDN), Network Virtualization and Network Function Virtualization, three concepts for network softwareization have emerged in the networking research, which claim to increase flexibility in networking. However, a deeper understanding of the flexibility vs. cost trade-off is missing so far in networking research. This talk focuses on the challenges of flexible networking, proposes a definition for a flexibility measure, which allows to quantitatively compare different network designs, and will highlight selected solution concepts. Presented research topics include the placement of network functions and the dynamic placement of controllers as well as SDN network virtualization based on a new network hypervisor concept.
我们信息社会的所有领域都依赖通信网络作为基本的基础设施。新兴应用程序提高了对所需网络资源动态变化的需求，例如，对社会事件或随时间变化的需求作出反应。提供对这些变化作出反应所需的灵活性，同时保持成本效益，最近成为研究中的一个巨大挑战。随着软件定义网络(SDN)、网络虚拟化(Network Virtualization)和网络功能虚拟化(Network Function Virtualization)的出现，网络软件化在网络研究中出现了三个概念，它们都声称要增加网络的灵活性。然而，到目前为止，在网络研究中还缺乏对灵活性和成本权衡的更深入的理解。本次演讲的重点是灵活网络的挑战，提出了一个灵活性度量的定义，它允许定量地比较不同的网络设计，并将重点介绍选择的解决方案概念。提出的研究课题包括网络功能的布局和控制器的动态布局，以及基于新的网络管理程序概念的SDN网络虚拟化。
{"title":"Flexnets: Evaluating flexibility in softwarized communication networks","authors":"W. Kellerer","doi":"10.23919/ConTEL.2017.8000010","DOIUrl":"https://doi.org/10.23919/ConTEL.2017.8000010","url":null,"abstract":"All areas of our information society depend on communication networks as a basic infrastructure. Emerging applications raise the need for dynamic changes of the required networking resources, for example, to react to social events or to shifts of demands over time. Providing the required flexibility to react to those changes and being cost efficient at the same time has recently become a huge challenge in research. With Software Defined Networking (SDN), Network Virtualization and Network Function Virtualization, three concepts for network softwareization have emerged in the networking research, which claim to increase flexibility in networking. However, a deeper understanding of the flexibility vs. cost trade-off is missing so far in networking research. This talk focuses on the challenges of flexible networking, proposes a definition for a flexibility measure, which allows to quantitatively compare different network designs, and will highlight selected solution concepts. Presented research topics include the placement of network functions and the dynamic placement of controllers as well as SDN network virtualization based on a new network hypervisor concept.","PeriodicalId":410388,"journal":{"name":"2017 14th International Conference on Telecommunications (ConTEL)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129516132","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}
Pub Date : 2017-06-01DOI: 10.23919/ConTEL.2017.8000046
Martin Klapež, Carlo Augusto Grazia, M. Casoni
This paper discusses the role that resource pooling and cooperation may play in reducing the ever-growing power consumption of cellular networks. These two abstractions are often referred to as methods to enhance communication throughput and increase data transmission resilience. The goal of this work is to advocate and highlight that they can also represent effective directions to go through in order to save significant amounts of energy and consequently reduce the greenhouse gas emissions generated by cellular communications. To demonstrate their potential, this paper presents a network abstraction called Virtual Resource Pooling, that has been designed to enable transparent, network-aware, and massively multipath transmissions through a harmonious integration between the multi-homing capabilities of modern devices and their collaborative potential. In addition to a notional presentation, the paper includes network emulation results that lay out the potential improvements of the proposal to network efficiency. These indicate that the system can scale transmission performance linearly with the number of concurrently forwarding nodes, effectively allowing to harness the unused network resources, and enabling to decouple the network's energy consumption from the average QoE perceived by users.
{"title":"Reducing cellular networks power consumption: The role of resource pooling and cooperation","authors":"Martin Klapež, Carlo Augusto Grazia, M. Casoni","doi":"10.23919/ConTEL.2017.8000046","DOIUrl":"https://doi.org/10.23919/ConTEL.2017.8000046","url":null,"abstract":"This paper discusses the role that resource pooling and cooperation may play in reducing the ever-growing power consumption of cellular networks. These two abstractions are often referred to as methods to enhance communication throughput and increase data transmission resilience. The goal of this work is to advocate and highlight that they can also represent effective directions to go through in order to save significant amounts of energy and consequently reduce the greenhouse gas emissions generated by cellular communications. To demonstrate their potential, this paper presents a network abstraction called Virtual Resource Pooling, that has been designed to enable transparent, network-aware, and massively multipath transmissions through a harmonious integration between the multi-homing capabilities of modern devices and their collaborative potential. In addition to a notional presentation, the paper includes network emulation results that lay out the potential improvements of the proposal to network efficiency. These indicate that the system can scale transmission performance linearly with the number of concurrently forwarding nodes, effectively allowing to harness the unused network resources, and enabling to decouple the network's energy consumption from the average QoE perceived by users.","PeriodicalId":410388,"journal":{"name":"2017 14th International Conference on Telecommunications (ConTEL)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115017055","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}
Pub Date : 2017-06-01DOI: 10.23919/ConTEL.2017.8000038
J. Ebert, H. Schlemmer, Eral Türkyilmaz, J. Rivera-Castro, S. Cioni, W. Gappmair
In interactive satellite communication systems, adaptive coding and modulation is a suitable countermeasure to mitigate the high fade dynamics of frequency ranges like the Ka-band. Consequently, receivers that support operation at low and very low SNR are required. In this paper, we present such a receiver structure dedicated for burst reception in a MF-TDMA system, as it is typically adopted in the return link of satellite systems.
{"title":"An efficient receiver architecture for burst reception at very low SNR","authors":"J. Ebert, H. Schlemmer, Eral Türkyilmaz, J. Rivera-Castro, S. Cioni, W. Gappmair","doi":"10.23919/ConTEL.2017.8000038","DOIUrl":"https://doi.org/10.23919/ConTEL.2017.8000038","url":null,"abstract":"In interactive satellite communication systems, adaptive coding and modulation is a suitable countermeasure to mitigate the high fade dynamics of frequency ranges like the Ka-band. Consequently, receivers that support operation at low and very low SNR are required. In this paper, we present such a receiver structure dedicated for burst reception in a MF-TDMA system, as it is typically adopted in the return link of satellite systems.","PeriodicalId":410388,"journal":{"name":"2017 14th International Conference on Telecommunications (ConTEL)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781455","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：