International Latin American Networking Conference最新文献

GNUWiNetwork, a software framework to build wireless networks GNUWiNetwork，一个构建无线网络的软件框架

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684087

V. González-Barbone, G. Sena, P. Belzarena

{"title":"GNUWiNetwork, a software framework to build wireless networks","authors":"V. González-Barbone, G. Sena, P. Belzarena","doi":"10.1145/2684083.2684087","DOIUrl":"https://doi.org/10.1145/2684083.2684087","url":null,"abstract":"The spread of wireless communications has led electronic equipment to include one or more wireless interfaces. If it were possible to use some generic hardware and implement those different interfaces in software, design and cost would be drastically reduced. This is the idea behind Software Defined Radio (SDR). Cognitive radio attempts to make a more efficient use of a crowded specturm by using licensed bands when licensees are idle. SDR and cognitive radio triggered the research work reported in this paper: to provide a fully functional SDR-based wireless network, developed on top of an open source framework, and able to provide data link and upper layers functionalities. This framework was called GNUWiNetwork, is licensed under GNU, and can be extended by others. Prototyping balanced by architectural design led this framework to be structured as a library of independent blocks which implement different functionalities. These blocks can be interconnected to implement existing or experimental protocols. Blocks interchange different types of events, and act accordingly. A graphical user interface makes it easy to put the blocks together, set the required parameters, and make the set run either in simulation mode or through some simple wireless device controlled by GNU Radio. Several types of blocks have been coded and tried in simulation mode. Some real wireless connection were established between two computers equiped with USRP devices, over which remote sessions such as SSH were successfully established. Work done and the results obtained so far show this framework very valuable for teaching and experimenting, but also promising for industrial prototype testing.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129936411","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

1-to-N and N-to-1 Communication for Optical Networks 光网络的1对n和n对1通信

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684093

Tuan Le, M. Gerla

引用次数: 0

On the Stability of an Un-Coordinated Solution for Channel Allocation in Dense Wireless Networks 密集无线网络中信道分配非协调解的稳定性研究

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684091

Guillermo Apollonia, J. Baliosian

{"title":"On the Stability of an Un-Coordinated Solution for Channel Allocation in Dense Wireless Networks","authors":"Guillermo Apollonia, J. Baliosian","doi":"10.1145/2684083.2684091","DOIUrl":"https://doi.org/10.1145/2684083.2684091","url":null,"abstract":"The popularity of IEEE 802.11 wireless networks, its simplicity of deployment and affordability has leaded to the existence of high density networks with many APs, owned and configured by the same or different providers, covering the same physical space and potentially interfering with each other. The interference caused by the co-channel and adjacent channel interference driven by co-located devices is one of the main issues to address to improve network performance. It is natural to think of solving this problem letting the APs to sense the medium and change the working radio channel accordingly to reduce interference. However, if this approach is used in an uncoordinated manner can cause to an unstable network re-configuration process. This paper briefly presents an un-coordinated solution to optimize channel configuration between participating Access Points and shows how the channel configuration oscillates. Then, we study the problem from a control-theoretical point of view and provide a feedback control-based solution to bound the oscillations of the solution. Finally, we present a simulation-based evaluation that shows how the proposed mechanism behaves.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115658480","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

ES-Aware: Energy and Stability Support for P2P Video Streaming on Mobile Devices ES-Aware:移动设备上P2P视频流的能量和稳定性支持

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684086

J. A. Macedo, Guilherme Tebaldi Meira, Roberta Lima-Gomes, M. Martinello, A. Vieira

引用次数: 0

Buffer Management in Opportunistic Networking 机会网络中的缓冲管理

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684085

J. Visca, Matías Richart, Juan Saavedra, J. Baliosian, E. Grampín

引用次数: 2

Plan Ceibal's Wireless Network for the Implementation of the 1:1 Educational Model 规划Ceibal的无线网络，以实施1:1的教育模式

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684092

G. Capdehourat, Gonzalo Marín, Ana Inés Rodríguez

引用次数: 5

All packets are equal, but some are more equal than others 所有包都是相等的，但有些包比其他包更相等

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684088

Javier Bustos-Jiménez, C. Fuenzalida

引用次数: 9

First-Price Auctions with Reimbursement in NSP Alliances with Asymmetric Buyers 非对称买家NSP联盟中带有补偿的首价拍卖

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684084

Isabel Amigo, Sandrine Vaton, P. Belzarena

{"title":"First-Price Auctions with Reimbursement in NSP Alliances with Asymmetric Buyers","authors":"Isabel Amigo, Sandrine Vaton, P. Belzarena","doi":"10.1145/2684083.2684084","DOIUrl":"https://doi.org/10.1145/2684083.2684084","url":null,"abstract":"The emergence of Network Service Provider Alliances (NSPs) to provide end-to-end, quality-assured services, promises new business and service opportunities for NSPs and customers respectively. This new marketplace requires a suitable pricing mechanism that allows price fixation, control access and customer trust in the new -and thus without reputation-seller. To work in this scenario, we propose a pricing scheme based on First-price auctions and where a pre-announced percentage of the price paid for the service is reimbursed if the quality is not satisfied. An optimal percentage of reimbursement can be analytically computed in simplified scenarios, where all buyers are equally modelled [1]. In more realistic scenarios, customers and services are asymmetric, e.g. buyers value the service on sale in a different way, and no analytical results can be derived. As a remedy, we propose a simulative approach in order to approximate buyers' willingness to pay, and subsequently compute the optimal percentage of reimbursement. We apply our simulator to different case studies, finding in all of them that the optimal percentage of reimbursement is 100% and this value prevents problems such as the market for lemons.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128679394","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

Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs 直径约束可靠性:弱图的复杂性、分解和精确计算

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684095

E. Canale, J. Piccini, F. Robledo, P. Romero

{"title":"Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs","authors":"E. Canale, J. Piccini, F. Robledo, P. Romero","doi":"10.1145/2684083.2684095","DOIUrl":"https://doi.org/10.1145/2684083.2684095","url":null,"abstract":"In this paper we address a problem from the field of network reliability, called diameter-constrained reliability. Specifically, we are given a simple graph G = (V, E) with [V] = n nodes and [E] = m links, a subset K ⊆ V of terminals, a vector p = (p1,...,pm) &epsis; [0, 1]m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities qi = 1 --- pi. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by RdK,G(p).\u0000 The general DCR computation is inside the class of NP-Hard problems, since is subsumes the complexity that a random graph is connected. In this paper the computational complexity of DCR-subproblems is discussed in terms of the number of terminal nodes k = [K] and diameter d. A factorization formula for exact DCR computation is provided, that runs in exponential time in the worst case. Finally, a revision of graph-classes that accept DCR computation in polynomial time is then included. In this class we have graphs with bounded co-rank, graphs with bounded genus, planar graphs, and, in particular, Monma graphs, which are relevant in robust network design. We extend this class adding arborescence graphs. A discussion of trends for future work is offered in the conclusions.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125474230","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}

引用次数: 4

Drop Less Known strategy for buffer management in DTN Nodes DTN节点缓冲区管理的Drop Less Known策略

International Latin American Networking Conference Pub Date : 2014-09-18 DOI: 10.1145/2684083.2684089

C. Souza, Edjair Mota, L. Galvao, P. Manzoni, Juan-Carlos Cano

引用次数: 9