{"title":"Simulation and analysis of PDU traffic bundled under packet alloying","authors":"Juan J. Vargas-Morales","doi":"10.1145/1384117.1384120","DOIUrl":"https://doi.org/10.1145/1384117.1384120","url":null,"abstract":"Packet Alloying, a technique for the optimized bundling of packets, is proposed. It produces aggregations that preserve the internal Protocol Data Unit (PDU) format, allowing the resulting packets to be subjected to further bundling or compression by conventional techniques. Using logs from vignettes simulated by the OneSAF Testbed Baseline (OTB), a simulator is used to analyze PDU traffic over a wireless flying Local Area Network aboard airplanes, including a satellite and a ground station. Applying Packet Alloying during the simulation of an example vignette, a reduction in the magnitude of negative slack time from -75 to -9 seconds for the worst spike was achieved.\u0000 Contributions of this research include the formalization of a selective PDU bundling scheme, and the study of different predictive algorithms for the next PDU. These results demonstrate the validity of packet optimizations for distributed simulation environments and other possible applications such as TCP/IP transmissions.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660614","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}
{"title":"Video quality assurance in multi-source streaming techniques","authors":"P. Rodríguez-Bocca, H. Cancela, G. Rubino","doi":"10.1145/1384117.1384129","DOIUrl":"https://doi.org/10.1145/1384117.1384129","url":null,"abstract":"In this paper we address the problem of designing a P2P system for distribution real-time video streams through the Internet. The main advantage of this approach is to use the available bandwidth unused by the set of machines connected to the network. The main difficulty is that these machines are typically highly dynamic, they continuously enter and leave the network. To deal with this problem, we explore a multi-source approach where the stream is decomposed into several flows sent by different peers to each client. To evaluate the impact of this approach on quality, we use PSQA, a recently proposed method that allows to obtain a good approximation of the quality as perceived by each client. In particular, we provide a variant of muti-source techniques using some redundancy in the signal, illustrating with real data how the methods allow to compensate efficiently the possible losses of frames due to peers leaving the system.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130167091","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}
{"title":"Implementing IPv6 at Central University of Venezuela","authors":"Eric Gamess, Neudith Morales","doi":"10.1145/1384117.1384124","DOIUrl":"https://doi.org/10.1145/1384117.1384124","url":null,"abstract":"Central University of Venezuela is the main university of Venezuela and has approximately 60,000 students and 16,000 staff members. In the last few years, the university network has been expanded and currently about 8,000 computers are connected to the network. As a consequence of this expansion, users were suffering low throughput and network administrators were facing the shortage of public IPv4 addresses. To address the latter problem, NAT (Network Address Translation) has been deployed for several years at the university. However, NAT is a partial solution since it does not offer true end-to-end connections and, some Internet services that need to initiate connections from the outside do not work. In this paper, we present a solution to the two problems. Traffic congestion was alleviated with an update of the connection between the university and the major ISP, and a more rigorous filtering policy. To reduce the problem generated by the lack of public IPv4 addresses, we propose to deploy the new version of the Internet Protocol (IPv6) at the university. The basic idea is to migrate to IPv6 which offers a large space of IPv6 addresses and many other improvements over IPv4.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117114062","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}
{"title":"Lifetime planning for TDMA-based proactive WSN with structured deployment","authors":"S. Galmés","doi":"10.1145/1384117.1384119","DOIUrl":"https://doi.org/10.1145/1384117.1384119","url":null,"abstract":"It is commonly accepted that the primary design goal in wireless sensor networks is the reduction of energy costs. Thus, the concept of lifetime planning is prioritized over capacity planning when dealing with such networks instead of the traditional ones. This paper offers a systematized treatment of the lifetime of TDMA-based proactive sensor networks with structured deployment. This is the case of many environmental networks, which are devoted to the regular monitoring of some physical or even chemical variables, for scientific study and/or for taking appropriate control actions. On the other hand, sensor nodes in structured deployments are located at strategic positions that may not be as close to each other as in random and massive deployments. Thus, in the second part of this paper, a cost-effective mechanism that consists of inserting pure switching nodes in some links is proposed, as a way of enhancing lifetime by alleviating the severe effects of the path loss exponent in the radio propagation model.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207218","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}
{"title":"Web prefetch performance evaluation in a real environment","authors":"B. D. L. Ossa, J. A. Gil, J. Sahuquillo, A. Pont","doi":"10.1145/1384117.1384127","DOIUrl":"https://doi.org/10.1145/1384117.1384127","url":null,"abstract":"Web prefetch is a technique aimed at reducing the user's perceived latency by downloading, during the navigation idle times, the web objects before the user asks for them. Despite different research efforts can be found in the literature about this subject there are few implementations for real environments. We proposed a real framework that provides web prefetching on current web client and server software working under the standard HTTP 1.1 protocol. This framework also provides detailed statistics which are very convenient for performance evaluation studies. In this paper we evaluate and compare the performance of different prediction algorithms in real conditions showing the usefulness of our proposal for this kind of environments.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121807306","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}
{"title":"Routing and wavelength assignment over WDM optical networks: a comparison between MOACOs and classical approaches","authors":"A. Arteta, B. Barán, D. Pinto","doi":"10.1145/1384117.1384126","DOIUrl":"https://doi.org/10.1145/1384117.1384126","url":null,"abstract":"The increasing demand of bandwidth has found an answer in Optical Transport Networks (OTN). To take advantage of the different resources that OTNs offer, several parameters need to be optimized to obtain good performance. Therefore, this work studies the Routing and Wavelength Assignment (RWA) problem in a multiobjective context. MultiObjective Ant Colony Optimization (MOACO) algorithms are implemented to simultaneously optimize the hop count and number of wavelength conversion for a set of unicast demands, considering wavelength conflicts. This way, a set of optimal solutions, known as Pareto Set, is calculated in one run of the proposed algorithm, without a priori restrictions on some objective. The proposed MOACO algorithms were compared to classical RWA heuristics using several performance metrics. Although, there is not a clear superiority, simulation results indicate that considering most of the performance metrics, MOACO algorithms obtain promising results when compared to the classical heuristics.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115265072","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}
{"title":"Optimal resource allocation for securing an enterprise information infrastructure","authors":"J. Duffany","doi":"10.1145/1384117.1384123","DOIUrl":"https://doi.org/10.1145/1384117.1384123","url":null,"abstract":"A model is developed for optimal resource allocation in terms of countermeasures to protect an enterprise information infrastructure. The model divides the information infrastructure into four parts: network, email, remote access and mobile computing. An economic model is developed and used to formulate an associated optimization problem which is then solved as a linear program to determine the optimal resource allocation.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123109303","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}
{"title":"Fast overflow probability estimation tool for MPLS networks","authors":"Dario Buschiazzo, Andrés Ferragut, A. Vázquez","doi":"10.1145/1168117.1168126","DOIUrl":"https://doi.org/10.1145/1168117.1168126","url":null,"abstract":"The constant growth of internet and the variety of services provided makes the estimation of QoS parameters a fundamental need for every Internet Service Provider. The present work introduces a software tool that calculates the overflow probability on the core links of a MPLS network. The calculation is based on the statistical properties of the arriving traffic and the routing on the network. The procedure uses the results of the large deviations theory and the work of Likhanov et al. [22] for small buffer. The results obtained show high degree of accuracy as well as very short processing times. This allows the user to determine the overflow status of the network without the need to use the traditional highly time consuming simulation techniques.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130665130","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}
{"title":"A multitree approach for multicast routing","authors":"Joel Prieto, B. Barán, J. Crichigno","doi":"10.1145/1168117.1168121","DOIUrl":"https://doi.org/10.1145/1168117.1168121","url":null,"abstract":"This paper presents a new traffic engineering multitree-multiobjective multicast routing algorithm (M-MMA). Multitree traffic engineering uses several trees to transmit one multicast demand between a source and a set of destinations. The purpose of the M-MMA is to balance the traffic load and optimize the utilization of the network resources. For the accomplishment of the optimization goal, M-MMA proposes a local optimization procedure that finds solutions that improve the relative amount of information to be transmitted through each tree.The approach of the M-MMA is inspired in the ideas of the well-known Strength Pareto Evolutionary Algorithm (SPEA). It simultaneously optimizes six objective functions: maximum link utilization, total bandwidth consumption, total cost, hops count, average delay and maximum delay. Simulations on several network topologies prove an enhanced performance when compared to previously published results as the Multiobjective Multicast Algorithm (MMA).","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115627754","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}
X. Hesselbach, R. Fabregat, B. Barán, Y. Donoso, F. S. Donado, M. Huerta
{"title":"Hashing based traffic partitioning in a multicast-multipath MPLS network model","authors":"X. Hesselbach, R. Fabregat, B. Barán, Y. Donoso, F. S. Donado, M. Huerta","doi":"10.1145/1168117.1168127","DOIUrl":"https://doi.org/10.1145/1168117.1168127","url":null,"abstract":"Load Balancing is a key mechanism in traffic engineering. One interesting strategy for load balancing enhancement is the multipath approach, in which data is transmitted through different paths. The use of effective hashing functions for load balancing optimizes the network utilization and reduces packet disordering and imbalance. This paper address the problem of packet ordering in multipath - multicast MPLS networks, studies the impact of the hashing function to effectively partition the traffic to implement the flow splitting values issued from an optimized model and analyzes the traffic allocation to the LSPs of the network and the mis-ordering problem at the egress node using buffer schemes. The buffer allocation levels are calculated according to end-to-end delays. Finally, the paper presents some experimental results from an optimized network.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127217687","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}