Pub Date : 2017-11-01DOI: 10.23919/CNSM.2017.8256044
Zheng Liu, Yuanyuan Qiao, Siyan Tao, Wenhui Lin, Jie Yang
Due to geographic and social constraints, human mobility shows a high degree of temporal and spatial regularity. More recently, emerging data tagged with geographical information can be used to study human mobility patterns. People usually spend most of their time at a few key important locations, such as home and work places. And for users with a certain social connection-co-workers or co-life, they often stay at the same locations. In this paper, firstly, we use an algorithm to identify important locations. After that, we find that the similarity between the two trajectories is closely related to their proximity in the location-based social network, where users having the same important locations are connected. In order to embody social contacts in mobility, for hourly variations in mobility similarity, we apply unsupervised clustering method to identify four categories of social ties. Finally, we further propose the unsupervised method and supervised method to predict which new links will develop in a social location-based network. We believe our finding can contribute to urban planning especially in areas of functional zone, transportation infrastructure deployment and mobile network facilities development.
{"title":"Analyzing human mobility and social relationships from cellular network data","authors":"Zheng Liu, Yuanyuan Qiao, Siyan Tao, Wenhui Lin, Jie Yang","doi":"10.23919/CNSM.2017.8256044","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256044","url":null,"abstract":"Due to geographic and social constraints, human mobility shows a high degree of temporal and spatial regularity. More recently, emerging data tagged with geographical information can be used to study human mobility patterns. People usually spend most of their time at a few key important locations, such as home and work places. And for users with a certain social connection-co-workers or co-life, they often stay at the same locations. In this paper, firstly, we use an algorithm to identify important locations. After that, we find that the similarity between the two trajectories is closely related to their proximity in the location-based social network, where users having the same important locations are connected. In order to embody social contacts in mobility, for hourly variations in mobility similarity, we apply unsupervised clustering method to identify four categories of social ties. Finally, we further propose the unsupervised method and supervised method to predict which new links will develop in a social location-based network. We believe our finding can contribute to urban planning especially in areas of functional zone, transportation infrastructure deployment and mobile network facilities development.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707721","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-11-01DOI: 10.23919/CNSM.2017.8256028
Hyundong Hwang, Young-Tak Kim
One of the challenges in QoS-aware realtime mobile multimedia service provisioning through WLANs is QoS-aware fast BSS (Basic Service Set) transition. Since most WiFi access points (APs) do not provide fast BSS transition (FT), changing currently connected AP to another takes several seconds during which mobile services are disrupted. In this paper, we propose an enhanced fast BSS transition scheme for seamless mobile broadband multimedia service provisioning and load balancing. The proposed scheme is based on i) cognitive management of WLAN ESS with SDN-based distribution system that allows checking for resource availability before selecting a candidate target AP, ii) QoS-aware roaming/handover with resource request over distribution system(DS), and iii) proactive forwarding table updates of SDN-based distribution system. The proposed scheme had been implemented and evaluated in a real IEEE 802.11n testbed environment, and the performance measurements showed enhanced QoS provisioning with minimized service disruption time and packet loss compared with existing approaches.1
{"title":"Enhanced fast BSS transition on enterprise WLAN with SDN-based distribution system","authors":"Hyundong Hwang, Young-Tak Kim","doi":"10.23919/CNSM.2017.8256028","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256028","url":null,"abstract":"One of the challenges in QoS-aware realtime mobile multimedia service provisioning through WLANs is QoS-aware fast BSS (Basic Service Set) transition. Since most WiFi access points (APs) do not provide fast BSS transition (FT), changing currently connected AP to another takes several seconds during which mobile services are disrupted. In this paper, we propose an enhanced fast BSS transition scheme for seamless mobile broadband multimedia service provisioning and load balancing. The proposed scheme is based on i) cognitive management of WLAN ESS with SDN-based distribution system that allows checking for resource availability before selecting a candidate target AP, ii) QoS-aware roaming/handover with resource request over distribution system(DS), and iii) proactive forwarding table updates of SDN-based distribution system. The proposed scheme had been implemented and evaluated in a real IEEE 802.11n testbed environment, and the performance measurements showed enhanced QoS provisioning with minimized service disruption time and packet loss compared with existing approaches.1","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125387397","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-11-01DOI: 10.23919/CNSM.2017.8255986
Ren Quinn, Zihui Ge, He Yan, J. Merwe
Networks, and the services they enable, are increasingly diverse and highly utilized. From DSL and fiber-to-the-home access networks, to cellular mobile networks, to contentdelivery networks; all require extensive monitoring in order to meet the increase of user expectations of the availability and quality of those services provided to them. The complexity of these networks and services require better management on the part of providers as the data resulting from service monitoring experiences an increase in dimensionality, making it difficult to fully interpret anomalies in the data. For example, anomaly detection generally says “I found an anomaly with mobile phone A in market Z”. But it is more useful to know what other phones and what other markets are also experiencing the same anomaly.
{"title":"AutoFocus: Automatically scoping the impact of anomalous service events","authors":"Ren Quinn, Zihui Ge, He Yan, J. Merwe","doi":"10.23919/CNSM.2017.8255986","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255986","url":null,"abstract":"Networks, and the services they enable, are increasingly diverse and highly utilized. From DSL and fiber-to-the-home access networks, to cellular mobile networks, to contentdelivery networks; all require extensive monitoring in order to meet the increase of user expectations of the availability and quality of those services provided to them. The complexity of these networks and services require better management on the part of providers as the data resulting from service monitoring experiences an increase in dimensionality, making it difficult to fully interpret anomalies in the data. For example, anomaly detection generally says “I found an anomaly with mobile phone A in market Z”. But it is more useful to know what other phones and what other markets are also experiencing the same anomaly.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133507332","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-09-18DOI: 10.23919/CNSM.2017.8256059
A. Azzouni, R. Boutaba, G. Pujolle
This paper introduces NeuRoute, a dynamic routing framework for Software Defined Networks (SDN) entirely based on machine learning, specifically, Neural Networks. Current SDN/OpenFlow controllers use a default routing based on Dijkstra's algorithm for shortest paths, and provide APIs to develop custom routing applications. NeuRoute is a controller-agnostic dynamic routing framework that (i) predicts traffic matrix in real time, (ii) uses a neural network to learn traffic characteristics and (iii) generates forwarding rules accordingly to optimize the network throughput. NeuRoute achieves the same results as the most efficient dynamic routing heuristic but in much less execution time.
{"title":"NeuRoute: Predictive dynamic routing for software-defined networks","authors":"A. Azzouni, R. Boutaba, G. Pujolle","doi":"10.23919/CNSM.2017.8256059","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256059","url":null,"abstract":"This paper introduces NeuRoute, a dynamic routing framework for Software Defined Networks (SDN) entirely based on machine learning, specifically, Neural Networks. Current SDN/OpenFlow controllers use a default routing based on Dijkstra's algorithm for shortest paths, and provide APIs to develop custom routing applications. NeuRoute is a controller-agnostic dynamic routing framework that (i) predicts traffic matrix in real time, (ii) uses a neural network to learn traffic characteristics and (iii) generates forwarding rules accordingly to optimize the network throughput. NeuRoute achieves the same results as the most efficient dynamic routing heuristic but in much less execution time.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116129414","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-07-01DOI: 10.23919/CNSM.2017.8256057
Xianwei Li, Bo Gu, Cheng Zhang, Zhi Liu, K. Yamori, Y. Tanaka
In this paper, we consider the problem of spectrum sharing in a Cognitive Radio Network (CRN) with spectrum holder, two secondary operators and secondary users (SUs). In the system model under consideration, the spectrum allocated to the two secondary operators can be shared by SUs, which means that secondary operators buy spectrum from spectrum holder and then sell spectrum access service to SUs. We model the relationship between secondary operators and SUs as a two-stage stackelberg game, where secondary operators make spectrum channel quality and price decisions in the first stage, and then the SUs make their spectrum demands decisions. The backward induction method is employed to solve the stackelberg game. Numerical results are performed to evaluate our analysis.
{"title":"Duopoly price competition in secondary spectrum markets","authors":"Xianwei Li, Bo Gu, Cheng Zhang, Zhi Liu, K. Yamori, Y. Tanaka","doi":"10.23919/CNSM.2017.8256057","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256057","url":null,"abstract":"In this paper, we consider the problem of spectrum sharing in a Cognitive Radio Network (CRN) with spectrum holder, two secondary operators and secondary users (SUs). In the system model under consideration, the spectrum allocated to the two secondary operators can be shared by SUs, which means that secondary operators buy spectrum from spectrum holder and then sell spectrum access service to SUs. We model the relationship between secondary operators and SUs as a two-stage stackelberg game, where secondary operators make spectrum channel quality and price decisions in the first stage, and then the SUs make their spectrum demands decisions. The backward induction method is employed to solve the stackelberg game. Numerical results are performed to evaluate our analysis.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127950171","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-07-01DOI: 10.23919/CNSM.2017.8256055
Cheng Zhang, Bo Gu, Zhi Liu, K. Yamori, Y. Tanaka
Nowadays, mobile network operators (MNOs) are trying to deploy wireless local area network (LAN) to offload mobile data from their cellular networks to complementary wireless LAN for congestion relief and cost savings. However, these network-centric methods do not take into consideration mobile user's (MU's) interests of monetary cost, energy consumption, and applications' deadlines. How the MU decides whether to offload their traffic to a complementary wireless LAN is non-trivial and important issue. Previous studies assume that MNO adopts usage-based pricing for mobile data, which only cares about how much a MU consumes data but not when a MU consumes data. In this paper, we study the MU's policy to minimize his monetary cost and energy consumption under time-dependent pricing (TDP). We formulate MU's wireless LAN offloading problem as a finite-horizon discrete-time Markov decision process (MDP) and establish an optimal policy by a dynamic programming based algorithm. Extensive simulations are conducted to validate our proposed offloading algorithm.
{"title":"Cost- and energy-aware multi-flow mobile data offloading under time dependent pricing","authors":"Cheng Zhang, Bo Gu, Zhi Liu, K. Yamori, Y. Tanaka","doi":"10.23919/CNSM.2017.8256055","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256055","url":null,"abstract":"Nowadays, mobile network operators (MNOs) are trying to deploy wireless local area network (LAN) to offload mobile data from their cellular networks to complementary wireless LAN for congestion relief and cost savings. However, these network-centric methods do not take into consideration mobile user's (MU's) interests of monetary cost, energy consumption, and applications' deadlines. How the MU decides whether to offload their traffic to a complementary wireless LAN is non-trivial and important issue. Previous studies assume that MNO adopts usage-based pricing for mobile data, which only cares about how much a MU consumes data but not when a MU consumes data. In this paper, we study the MU's policy to minimize his monetary cost and energy consumption under time-dependent pricing (TDP). We formulate MU's wireless LAN offloading problem as a finite-horizon discrete-time Markov decision process (MDP) and establish an optimal policy by a dynamic programming based algorithm. Extensive simulations are conducted to validate our proposed offloading algorithm.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122764491","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-07-01DOI: 10.23919/CNSM.2017.8255996
Cheng Zhang, Zhi Liu, Bo Gu, K. Yamori, Y. Tanaka
In order to improve the quality of service (QoS) for mobile users (MUs) and save investment cost for deploying new cellular base station, mobile network operators (MNOs) are deploying wireless local area network (LAN) access points (APs) to offload MU's traffic from cellular network to wireless LAN. However, offloading too much traffic from cellular network may impair MNO's profit since the cellular network price is higher than that of wireless LAN, whose price is low or even zero. Therefore, how to deploy wireless LAN APs to offload traffic without impairing MNO's profit is a critical problem for MNOs. As far as the authors understand, existing studies about deployment of wireless LAN APs do not consider MNO's profit and are usually in a heuristic manner. In this paper, we study the location-based advertising (LBA) leveraged wireless LAN deployment, where MNO may also collect revenue by selling LBA service in different locations to advertisers. We formulate MNO's profit maximization problem by considering different MU's demand in different locations, wireless LAN price for MUs, and revenue from LBA service. Extensive simulations are conducted to validate our analytical results.
{"title":"Wireless LAN access point deployment and pricing with location-based advertising","authors":"Cheng Zhang, Zhi Liu, Bo Gu, K. Yamori, Y. Tanaka","doi":"10.23919/CNSM.2017.8255996","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255996","url":null,"abstract":"In order to improve the quality of service (QoS) for mobile users (MUs) and save investment cost for deploying new cellular base station, mobile network operators (MNOs) are deploying wireless local area network (LAN) access points (APs) to offload MU's traffic from cellular network to wireless LAN. However, offloading too much traffic from cellular network may impair MNO's profit since the cellular network price is higher than that of wireless LAN, whose price is low or even zero. Therefore, how to deploy wireless LAN APs to offload traffic without impairing MNO's profit is a critical problem for MNOs. As far as the authors understand, existing studies about deployment of wireless LAN APs do not consider MNO's profit and are usually in a heuristic manner. In this paper, we study the location-based advertising (LBA) leveraged wireless LAN deployment, where MNO may also collect revenue by selling LBA service in different locations to advertisers. We formulate MNO's profit maximization problem by considering different MU's demand in different locations, wireless LAN price for MUs, and revenue from LBA service. Extensive simulations are conducted to validate our analytical results.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134524132","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-08DOI: 10.23919/CNSM.2017.8256018
Hiroki Kawai, S. Ata, N. Nakamura, I. Oka
Recently, variety of communication devices such as printers, IP telephones, network cameras are used widely, with the support of networking in consumer electronics. As a spread of IoT (Internet of Things), the number of embed devices are significantly increasing, however, such devices have lack of capability on security. It is therefore desirable that a network identifies these devices to take appropriate operations. In this paper, we propose an identification method of communication devices from monitoring patterns of traffic, here we use statistical metrics such as packet inter-arrival time or packet size, and we apply a machine learning for the identification. Through evaluations using real traffic, we show that our method can achieve over 90% of identification to 9 commiunication devices.
{"title":"Identification of communication devices from analysis of traffic patterns","authors":"Hiroki Kawai, S. Ata, N. Nakamura, I. Oka","doi":"10.23919/CNSM.2017.8256018","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256018","url":null,"abstract":"Recently, variety of communication devices such as printers, IP telephones, network cameras are used widely, with the support of networking in consumer electronics. As a spread of IoT (Internet of Things), the number of embed devices are significantly increasing, however, such devices have lack of capability on security. It is therefore desirable that a network identifies these devices to take appropriate operations. In this paper, we propose an identification method of communication devices from monitoring patterns of traffic, here we use statistical metrics such as packet inter-arrival time or packet size, and we apply a machine learning for the identification. Through evaluations using real traffic, we show that our method can achieve over 90% of identification to 9 commiunication devices.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126740645","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-04-10DOI: 10.23919/CNSM.2017.8255970
H. D. Nguyen, Chi-Dung Phung, Stefano Secci, Benevid Felix Silva, M. N. Lima
Multipath communications at the Internet scale have been a myth for a long time, with no actual protocol being deployed so that multiple paths could be taken by a same connection on the way towards an Internet destination. Recently, the Multipath Transmission Control Protocol (MPTCP) extension has been standardized and is undergoing rapid adoption in many different use-cases, from mobile to fixed access networks, from data-centers to core networks. Among its major benefits — i.e., reliability thanks to backup path rerouting, throughput increase thanks to link aggregation, and confidentiality being more difficult to intercept a full connection — the latter has attracted lower attention. How effective would be to use MPTCP to exploit multiple Internet-scale paths and decrease the probability of Man-in-the-Middle (MITM) attacks is a question which we try to answer. By analyzing the Autonomous System (AS) level graph, we identify which countries and regions show a higher level of robustness against MITM AS-level attacks, for example due to core cable tapping or route hijacking practices.
{"title":"Can MPTCP secure Internet communications from man-in-the-middle attacks?","authors":"H. D. Nguyen, Chi-Dung Phung, Stefano Secci, Benevid Felix Silva, M. N. Lima","doi":"10.23919/CNSM.2017.8255970","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255970","url":null,"abstract":"Multipath communications at the Internet scale have been a myth for a long time, with no actual protocol being deployed so that multiple paths could be taken by a same connection on the way towards an Internet destination. Recently, the Multipath Transmission Control Protocol (MPTCP) extension has been standardized and is undergoing rapid adoption in many different use-cases, from mobile to fixed access networks, from data-centers to core networks. Among its major benefits — i.e., reliability thanks to backup path rerouting, throughput increase thanks to link aggregation, and confidentiality being more difficult to intercept a full connection — the latter has attracted lower attention. How effective would be to use MPTCP to exploit multiple Internet-scale paths and decrease the probability of Man-in-the-Middle (MITM) attacks is a question which we try to answer. By analyzing the Autonomous System (AS) level graph, we identify which countries and regions show a higher level of robustness against MITM AS-level attacks, for example due to core cable tapping or route hijacking practices.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124689770","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 : 2016-04-20DOI: 10.23919/CNSM.2017.8255981
Y. Elkhatib, Gareth Tyson, G. Coulson
The strong divide between applications and the network control plane is desirable, but keeps the network in the dark regarding the ultimate purpose of applications and, as a result, is unable to optimize for these. An alternative approach is for applications to declare to the network their abstract desires; e.g. “I require group multicast”, or “I will run within a local domain and am latency sensitive”. Such an enriched semantic has the potential to enable the network to better fulfill application intent, while also helping optimize network resource usage across applications. We refer to this approach as intent driven networking (IDN). We sketch an incrementally-deployable design to serve as a stepping stone towards a practical realization of IDN within today's Internet.
{"title":"Charting an intent driven network","authors":"Y. Elkhatib, Gareth Tyson, G. Coulson","doi":"10.23919/CNSM.2017.8255981","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255981","url":null,"abstract":"The strong divide between applications and the network control plane is desirable, but keeps the network in the dark regarding the ultimate purpose of applications and, as a result, is unable to optimize for these. An alternative approach is for applications to declare to the network their abstract desires; e.g. “I require group multicast”, or “I will run within a local domain and am latency sensitive”. Such an enriched semantic has the potential to enable the network to better fulfill application intent, while also helping optimize network resource usage across applications. We refer to this approach as intent driven networking (IDN). We sketch an incrementally-deployable design to serve as a stepping stone towards a practical realization of IDN within today's Internet.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117290826","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
扫码关注我们
求助内容：
应助结果提醒方式：