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

International Conference of Future Internet最新文献

筛选
英文 中文
Preparing experiments with media-oriented service composition for future internet 为面向未来互联网的媒体型服务组合实验做准备
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853099
Sangwoo Han, JongWon Kim
{"title":"Preparing experiments with media-oriented service composition for future internet","authors":"Sangwoo Han, JongWon Kim","doi":"10.1145/1853079.1853099","DOIUrl":"https://doi.org/10.1145/1853079.1853099","url":null,"abstract":"Service composition provides feasible ways to flexibly build m edia applications employing widely dispersed media contents and tools. There have been several attempts to enable media-oriented service composition based on service over-lay networks (SONs). To enhance the flexibility of media-oriented service composition for Future Internet, we introduce an ongoing effort to design a balanced service composition approaches for media-oriented service composition. By differentiating different profiles and levels of service composition, the proposed balanced approach targets improved cooperation among computing and networking services over virtualized Future Internet infrastructure. We also present an early prototype of experiment control software, OMX (Open Media eXperiment for service composition), to support a basic level of service composition experiments and verify its possibility via HD media delivery experiments.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131192303","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
Opportunistic shortest path forwarding in delay tolerant networks 时延容忍网络中的机会最短路径转发
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853085
Jaeseong Jeong, Kyunghan Lee, Yung Yi, I. Rhee, S. Chong
{"title":"Opportunistic shortest path forwarding in delay tolerant networks","authors":"Jaeseong Jeong, Kyunghan Lee, Yung Yi, I. Rhee, S. Chong","doi":"10.1145/1853079.1853085","DOIUrl":"https://doi.org/10.1145/1853079.1853085","url":null,"abstract":"Delay Tolerant Networks (DTNs) are characterized by probabilistic links formed among mobile nodes indicating their probabilistic encounters. Prior work on DTN routing uses expected delays as a routing metric to decide the next hop relay node for packet delivery to the destination. However, they measure the expected delays by taking the minimum of the expected delays over all possible paths from a candidate relay. This metric, denoted by MinEx, does not account for the opportunity gain enabled by having multiple paths to the destination through encountering multiple future neighbors. Since DTN routing uses as the relay the first encountered node satisfying given routing criteria, the random delays to multiple relay nodes should be aggregated. Thus, the true expected delays can be measured by taking the expectation of the minimum delays, denoted as ExMin, over all possible probabilistic paths from the candidate.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134191917","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
On the pricing of femtocell services 关于移动电话服务的定价
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853081
Seyoung Yun, Yung Yi, D. Cho, Jeonghoon Mo
{"title":"On the pricing of femtocell services","authors":"Seyoung Yun, Yung Yi, D. Cho, Jeonghoon Mo","doi":"10.1145/1853079.1853081","DOIUrl":"https://doi.org/10.1145/1853079.1853081","url":null,"abstract":"The femtocell is an enabling technology to handle exponentially increasing wireless data traffic. In this paper, we study economic aspects of femtocell deployment with a game theoretic model between a provider and users. The provider provides differentiated service of macro only, or macro plus femto services and users select one, whichever maximizes their net-utilities. Femto users also decide whether to share their femto APs with other users given economic incentive. We answer the optimal pricing of providers and the optimal incentives.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127739887","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
Decentralized and autonomous content overlay networking (DACON) with WiFi access points 带有WiFi接入点的分散和自主内容覆盖网络(DACON)
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853086
Diko Ko, Kideok Cho, Munyoung Lee, Hyunchul Kim, T. Kwon, Yanghee Choi
{"title":"Decentralized and autonomous content overlay networking (DACON) with WiFi access points","authors":"Diko Ko, Kideok Cho, Munyoung Lee, Hyunchul Kim, T. Kwon, Yanghee Choi","doi":"10.1145/1853079.1853086","DOIUrl":"https://doi.org/10.1145/1853079.1853086","url":null,"abstract":"Accessing contents from mobile devices becomes more and more proliferated and hence the need for the content distribution in the pervasive environment is growing. However, distributing contents in such environments taxes wireless network operators substantially. To provide the content distribution service in a reasonable cost, we pay attention to user-deployable WiFi access points (APs). In this paper, we propose a decentralized and autonomous content overlay networking (DACON) architecture for the pervasive content distribution services, which is the overlay network architecture comprised of public WiFi APs. We identify and answer major challenges in realizing the content distribution service in the pervasive environment by exploiting the overlay network of public WiFi APs.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123375371","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
Frequency-aware reconstruction of forwarding tables in name-based routing 基于名称路由的转发表频率感知重构
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853093
Haesung Hwang, S. Ata, M. Murata
{"title":"Frequency-aware reconstruction of forwarding tables in name-based routing","authors":"Haesung Hwang, S. Ata, M. Murata","doi":"10.1145/1853079.1853093","DOIUrl":"https://doi.org/10.1145/1853079.1853093","url":null,"abstract":"In the future Internet, routing on contents or resources is anticipated as the post-Internet Protocol (IP) routing. The final goal of our research is to realize routing based on the name of a resource in the network layer. Towards this purpose, we use the 'name' for routing, particularly the 'fully qualified domain name (FQDN)' to show the feasibility of name-based routing and to generalize it to resource-based routing. When writing the routing information of hierarchically structured FQDN into a hierarchical virtual topology, mismatch between the virtual topology and physical topology can occur if the virtual topology lacks the physical topology's information. In addition, routing tables should be reorganized to reflect the different access frequency among the FQDNs. In this paper, we propose an algorithm for reconstructing routing tables to better map a virtual topology to the physical topology. As a result, we show that using the access frequency and physical topology's information increases the efficiency for searching FQDN.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970993","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}
引用次数: 2
Host-oblivious security for content-based networks 基于内容的网络的主机无关安全性
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853090
Jongmin Jeong, T. Kwon, Yanghee Choi
{"title":"Host-oblivious security for content-based networks","authors":"Jongmin Jeong, T. Kwon, Yanghee Choi","doi":"10.1145/1853079.1853090","DOIUrl":"https://doi.org/10.1145/1853079.1853090","url":null,"abstract":"Network-level security systems rely significantly on network operations. This reliance has led to conventional network-level security systems based on a host-centric architecture because the network operations themselves are based on hosts. However, host-dependent network security schemes are no longer applicable in content-based networks.\u0000 In this paper, a host-oblivious network security paradigm for content-based networks is introduced, and then a comprehensive security procedure focusing on generating and sharing diverse secret keys is proposed. Then the proposed scheme, which provides not only essential security functions but also diverse security levels, is discussed. Finally, how this multiple security-level approach helps reducing inevitable performance overhead caused by implementing security functions is demonstrated.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114703742","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}
引用次数: 7
Credit based network management by discriminate analysis 基于信用的网络管理的判别分析
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853100
Qin Yan, Fei Wang, Jilong Wang
{"title":"Credit based network management by discriminate analysis","authors":"Qin Yan, Fei Wang, Jilong Wang","doi":"10.1145/1853079.1853100","DOIUrl":"https://doi.org/10.1145/1853079.1853100","url":null,"abstract":"Nowadays network management becomes a more and more challenging issue and is no longer limited to the routine maintenance of software and hardware. This paper proposes a primitive credit scoring system for the network management. The database contains the records of the abnormal events on a campus network for the past two years, which has been sorted by [1]. Records are analyzed and divided into two classes according to their different probabilities of abnormal behavior by applying Principle Component Analysis (PCA) to obtain the weight of each attribute. Five-fold method is employed to train the Support Vector Machine (SVM) classifier. The result indicates that SVM classifier is effective and the system performs well. The credit scoring system can then give various starting credit scores according to the class the user belongs to. We hope to have finer classification of users to enhance the credit scoring system in future work.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132431472","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}
引用次数: 2
First-class access for developing-world environments 一流的发展中国家环境
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853089
Vivek S. Pai, Anirudh Badam, Sunghwan Ihm, KyoungSoo Park
{"title":"First-class access for developing-world environments","authors":"Vivek S. Pai, Anirudh Badam, Sunghwan Ihm, KyoungSoo Park","doi":"10.1145/1853079.1853089","DOIUrl":"https://doi.org/10.1145/1853079.1853089","url":null,"abstract":"Improvements in connectivity and the cost of laptops will soon enable widely-available Internet access in parts of the world where access ranged from rare to unavailable. While such steps represent tremendous progress, we believe that the next barrier to adoption will be to convince providers that the gap between \"good enough\" access and first-class access, while quite large, is possible to bridge. This paper presents our views for the creation of a networking software stack tailored toward developing-world usage. With this stack, we believe that developing-world users will have a participatory Internet experience, similar to that of users in the US and Europe. The stack is also geared toward a low resource footprint, making it deployable in cost-sensitive environments. We have completed some portions of the stack, and believe that the total system represents a three to five year effort.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126748625","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
Alleviating intra-flow interference by inter-arrival based packet dropping in wireless multi-hop networks 无线多跳网络中基于到达间的丢包缓解流内干扰
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853087
Taewoon Kim, Wooyeol Choi, Hyuk Lim
{"title":"Alleviating intra-flow interference by inter-arrival based packet dropping in wireless multi-hop networks","authors":"Taewoon Kim, Wooyeol Choi, Hyuk Lim","doi":"10.1145/1853079.1853087","DOIUrl":"https://doi.org/10.1145/1853079.1853087","url":null,"abstract":"In CSMA-based wireless multi-hop networks, consecutive packets on a single multi-hop path interfere with each other, causing hidden/exposed terminal problems and frequent contention. This phenomenon is called intra-flow interference and is considered as one of the principal factors degrading the throughput performance, since it increases the number of collisions as well as backoff intervals. Here, we propose a probabilistic packet dropping algorithm that mitigates the intra-flow interference on wireless multi-hop networks. In the proposed algorithm, a wireless node classifies all flows into several 1-hop forwarding domains, which are determined by the next relay node. For this classification, each node regards the flows that will pass the same 1-hop neighbor as ones belonging to the same forwarding domain. Each node probabilistically drops incoming packets if the inter-arrival time of incoming packets belonging to the same forwarding domain is so short as to make intra-flow interference. Through extensive simulation studies, we show that the proposed algorithm effectively reduce the intra-flow interference, and increases the overall throughput as well as fairness on wireless multi-hop networks.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131969663","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
Design and implementation of application based routing using OpenFlow 基于OpenFlow的应用程序路由的设计与实现
International Conference of Future Internet Pub Date : 2010-06-16 DOI: 10.1145/1853079.1853096
O. Othman, K. Okamura
{"title":"Design and implementation of application based routing using OpenFlow","authors":"O. Othman, K. Okamura","doi":"10.1145/1853079.1853096","DOIUrl":"https://doi.org/10.1145/1853079.1853096","url":null,"abstract":"In this paper, we show our design and implementation method of application based routing using OpenFlow that is a promising future internet enabling technology. This method provides more flexible and dynamic redirection because of OpenFlow's new potential abilities and thus giving new opportunities to the future internet that are currently not available. This method relies on three important ideas which are; the content based networking, decision making by the network in a similar manner to anycast and the participation of user clients in providing the service. All this is done using the newly invented OpenFlow. It is done through slight modification to the content server and client, thus imposing small changes to the application layer.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128290937","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}
引用次数: 20
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信