2013 Conference on Networked Systems最新文献

筛选
英文 中文
Challenging the Monopoly of Mobile Termination Charges with an Auction-Based Charging and User-Centric System (AbaCUS) 以拍卖收费及以用户为中心系统(AbaCUS)挑战流动终端收费垄断
2013 Conference on Networked Systems Pub Date : 2013-03-11 DOI: 10.1109/NetSys.2013.13
Christos Tsiaras, B. Stiller
{"title":"Challenging the Monopoly of Mobile Termination Charges with an Auction-Based Charging and User-Centric System (AbaCUS)","authors":"Christos Tsiaras, B. Stiller","doi":"10.1109/NetSys.2013.13","DOIUrl":"https://doi.org/10.1109/NetSys.2013.13","url":null,"abstract":"Nowadays, in mobile communication only the Mobile Network Operator (MNO) of the callee is able to terminate his calls. Thus, in the MNOs call-termination market there is only one player profiting from call-termination rates, in turn this market is considered to be a de facto monopoly since the early days of the introduction of commercial mobile communication services. Given this monopoly fact, the only solution against a potential speculation by MNOs was the regulation of termination rates. However, since the initiation of mobile communications, many issues on mobile terminal devices and network infrastructure have changed. Furthermore, today the mobile networks infrastructure does not support only voice services but data as well. In such an environment multiple MNOs could terminate a call. However, in this case the caller has to set only his final cost preference without any knowledge on MNOs termination rate charging policies. Therefore, this paper considers those changes and challenges the monopoly of the MNOs call-termination by proposing an Auction-based Charging and User-centric System called \"AbaCUS\", which overcomes the monopoly obstacle of this market. The key characteristic of the auction proposed for AbaCUS is the honest bid that participants are \"forced\" to make. Finally, this work is expected to show that MNOs will benefit by the existence of a call-termination-free market through the establishment of Quality-of-Service (QoS)-guaranteed services.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130501675","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}
引用次数: 6
Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables 在同构分布式哈希表中增加容量感知存储间接
2013 Conference on Networked Systems Pub Date : 2013-03-11 DOI: 10.1109/NetSys.2013.9
P. Wette, Kalman Graffi
{"title":"Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables","authors":"P. Wette, Kalman Graffi","doi":"10.1109/NetSys.2013.9","DOIUrl":"https://doi.org/10.1109/NetSys.2013.9","url":null,"abstract":"Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125255034","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
A Component System for Spontaneous Virtual Networks 自发虚拟网络的组成系统
2013 Conference on Networked Systems Pub Date : 2013-03-11 DOI: 10.1109/NetSys.2013.22
Philipp Schaber, W. Effelsberg
{"title":"A Component System for Spontaneous Virtual Networks","authors":"Philipp Schaber, W. Effelsberg","doi":"10.1109/NetSys.2013.22","DOIUrl":"https://doi.org/10.1109/NetSys.2013.22","url":null,"abstract":"In this paper, we propose a framework and a component system, which can be used to dynamically create modularized network services. A composer can automatically compose such services from a library of available components, taking into account dependencies among components and the possibility of sharing components by different services. In addition to group communication and publish/subscribe functionalities, which are implemented as components already, it is very easy to extend the library with third-party components or own implementations. The framework performs the calculation of a suitable service composition and its deployment among all participating nodes. Each composition can take into account different application requirements or incorporate new components without changing the host application. Since the system is also highly modularized itself, it allows to flexibly choose alternative composition or deployment algorithms, or develop new ones.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129164232","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 Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings d维Internet坐标嵌入上度有界图的贪心路由
2013 Conference on Networked Systems Pub Date : 2013-03-11 DOI: 10.1109/NetSys.2013.10
Marcus Autenrieth, Hannes Frey
{"title":"On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings","authors":"Marcus Autenrieth, Hannes Frey","doi":"10.1109/NetSys.2013.10","DOIUrl":"https://doi.org/10.1109/NetSys.2013.10","url":null,"abstract":"In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay networks. Our approach will use internet coordinates, embedded using the L-infinity-metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node's out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518101","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
Scalable Multipath Exploration in Ad-Hoc Networks Ad-Hoc网络中的可扩展多路径探索
2013 Conference on Networked Systems Pub Date : 2013-03-11 DOI: 10.1109/NetSys.2013.17
Mark K. Trapp, M. Rossberg, G. Schäfer
{"title":"Scalable Multipath Exploration in Ad-Hoc Networks","authors":"Mark K. Trapp, M. Rossberg, G. Schäfer","doi":"10.1109/NetSys.2013.17","DOIUrl":"https://doi.org/10.1109/NetSys.2013.17","url":null,"abstract":"Multipath routing allows for a reliable communication in ad-hoc networks, e.g., to transport VoIP calls in disaster scenarios. Due to the usage of different paths in conjunction with Forward Error Correction, failures can be tolerated without interrupting real-time transmissions. However, current multipath algorithms either depend on global topology information, perform an excessive message flooding, or require information of physical node positions. The situation becomes even worse if efficient broadcasts are impossible, e.g., due to some point-to-point links or if authentication is required and asymmetric signatures cannot be considered. Thus, this article introduces Scalable Multipath Exploration in Ad-Hoc Networks (SMEAN) as a method to discover, estimate, and select ad-hoc multipaths. SMEAN uses an overlay structure that is embedded into the transport network to discover overlay paths that utilize highly disjoint underlay paths. The low overhead allows for a reactive usage, e.g., when a VoIP is established. A simulative evaluation shows that SMEAN is able to set up suited multipath topologies with only a fraction of the messages needed by common ad-hoc routing algorithms.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"294 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133847417","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
Using Optimized Virtual Network Embedding for Network Dimensioning 基于优化虚拟网络嵌入的网络维数计算
2013 Conference on Networked Systems Pub Date : 2013-03-11 DOI: 10.1109/NETSYS.2013.8
Johannes Inführ, David Stezenbach, Matthias Hartmann, K. Tutschku, G. Raidl
{"title":"Using Optimized Virtual Network Embedding for Network Dimensioning","authors":"Johannes Inführ, David Stezenbach, Matthias Hartmann, K. Tutschku, G. Raidl","doi":"10.1109/NETSYS.2013.8","DOIUrl":"https://doi.org/10.1109/NETSYS.2013.8","url":null,"abstract":"Virtual Network Embedding will be one of the key concepts of the Future Internet. For an ISP it is important to know how many additional Virtual Networks (VNs) of a specific application (e.g. web, streaming, P2P, and VoIP) are mappable into the current resource substrate with a certain probability. In this work we calculate this probability with our embedding algorithm which enables us to consider side effects based on remapping of VNs (e.g. due to reduced link delay). Our results show that minimal extra resources can significantly increase embedding probability of additional VNs.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133778224","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
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学术官方微信