{"title":"Environmental monitoring (panel session)","authors":"Deoborah Estrin, S. Paton","doi":"10.1145/371626.371771","DOIUrl":"https://doi.org/10.1145/371626.371771","url":null,"abstract":"","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"61 28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132229075","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":"Large group causality (invited session): a message and multicast ordering for large-scale networks","authors":"José M. Piquer","doi":"10.1145/371626.371768","DOIUrl":"https://doi.org/10.1145/371626.371768","url":null,"abstract":"","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"31 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113976381","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 QoS service for low demand IP video applications over DTM","authors":"C. Abbas, A. Azcorra, J. I. Moreno","doi":"10.1145/371626.371784","DOIUrl":"https://doi.org/10.1145/371626.371784","url":null,"abstract":"The differential services model (DiffServ) provides a great flexibility in defining a variety of services through PHBs (Per Hop Behaviors) and traffic conditioners. It fits in well with the integrated services model (IntServ), jointly offering features such as: QoS signaling; admission control; channel management; assignment of resources (buffer and bandwidth); sorter configuration; and establishment of traffic agreements. With this integration you can have a scalable, flexible, and dynamic QoS environment in networks of the Internet core.\u0000This article describes and analyses the DGF (DTM Guaranteed Fowarding) services that guarantees a minimum rate of retransmission of packets, based on RSVP signaling and traffic agreements (SLA), as well as losses close to the error rate of the physical medium, which are ideal features for video applications on demand.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115180833","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":"An open approach for deploying programming nodes into communication networks","authors":"C. A. D. Rocha, Aécio Paiva Braga, J. Souza","doi":"10.1145/371626.371823","DOIUrl":"https://doi.org/10.1145/371626.371823","url":null,"abstract":"Nowadays, we are facing in the computer network reserach communication new challenges related to the concepts of programmable and active networks. Great efforts have been spent to make current data communication networks more flexible and dynamic. Unfortunately, such efforts are followed by complexity and, therefore, the process of deploying the mechanisms has been committed. In order to make this process simpler, this work presents an open approach for having programmable nodes that make computer networks more dynamic in terms of adding new services without increasing complexity. This approach presents SNPI (Simple Network Programmable Interface), which is group of skeletons and data structures resources that make possible to the programmers and developers a fast deployment of new services into the network. The mechanism presented allows that access to internal mechanisms of data flow processing in the network nodes.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121026924","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}
Alberto Cerpa, J. Elson, Michael Hamilton, Jerry Zhao, D. Estrin, Lewis Girod
{"title":"Habitat monitoring: application driver for wireless communications technology","authors":"Alberto Cerpa, J. Elson, Michael Hamilton, Jerry Zhao, D. Estrin, Lewis Girod","doi":"10.1145/371626.371720","DOIUrl":"https://doi.org/10.1145/371626.371720","url":null,"abstract":"As new fabrication and integration technologies reduce the cost and size of micro-sensors and wireless interfaces, it becomes feasible to deploy densely distributed wireless networks of sensors and actuators. These systems promise to revolutionize biological, earth, and environmental monitoring applications, providing data at granularities unrealizable by other means. In addition to the challenges of miniaturization, new system architectures and new network algorithms must be developed to transform the vast quantity of raw sensor data into a manageable stream of high-level data. To address this, we propose a tiered system architecture in which data collected at numerous, inexpensive sensor nodes is filtered by local processing on its way through to larger, more capable and more expensive nodes.\u0000We briefly Habitat monitoring as our motivating application and introduce initial system building blocks designed to support this application. The remainder of the paper presents details of our experimental platform.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129315129","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":"Lower than best effort: a design and implementation","authors":"K. Carlberg, Panos Gevros, J. Crowcroft","doi":"10.1145/371626.371813","DOIUrl":"https://doi.org/10.1145/371626.371813","url":null,"abstract":"In recent years, the Internet architecture has been augmented so that Better-than-Best-Effort (BBF) services, in the form of reserved resources for specific flows, can be provided by the network. To date, this has been realized through two different and sequentially developed efforts. The first is known as Integrated Services and focuses on specific bounds on bandwidth and/or delay for specific flows. The Differential Service model was later introduced, which presented a more aggregated and local perspective regarding the forwarding of traffic. A direction that is missing in today's work on service models is a defined schema used to purposely degrade certain traffic to various levels below that of Best Effort. In a sense, a new direction that provides a balancing effect in the deployment of BBE service. This is particularly evident with continual and parallel short transaction flows (like that used for web applications) over low bandwidth links that are not subject to any backoff penalty incurred by congestion because state does not persist. In a more indirect perspective, our model correlates degraded service with the application of usage and security policies — administrative decisions that can operate in tandem or disjointly from conditions of the network. This paper attempts to address these and other issues and presents the design and implementation of such a new degraded service model and queuing mechanism used to support it.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129746618","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":"Estimating the service time of web clients using server logs","authors":"Oscar Ardaiz-Villanueva, Felix Freig, L. Navarro","doi":"10.1145/371626.371772","DOIUrl":"https://doi.org/10.1145/371626.371772","url":null,"abstract":"This article proposes and evaluates measures for estimating the service time of a web client using server logs, only from the server side without introducing traffic into the network. The HTTP protocol is described as well as the different interactions between the web server, the communication components, and the web client application. The first measure is based on the time it takes for the web server application to deliver an object to its operating system, keeping in mind the buffer effect of the server network. The second measure also considers the inter-arrival times to the server application of the GET requests for the objects that are part of a web page. We propose formulas, validated experimentally, that relate the proposed measurements in the server with the different components that take part in a web transaction and the service time experienced by clients. We have carried out several experiments to evaluate the validity of the proposed measurements and the best measure estimates the service time of the client with an error below 20% for 90% of the requests. We observed a cyclic component in the measurements of the server that can simplify the estimation of future values. For this reason, the proposed measures may be used to know what is the service time the client perceives in each visit to a server. It can also be used by content distribution networks to choose between several replica located in different places in the Internet.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124533994","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":"Improved AntNet routing","authors":"B. Barán","doi":"10.1145/371626.371736","DOIUrl":"https://doi.org/10.1145/371626.371736","url":null,"abstract":"Abstract-AntNet is a new algorithm for packet routing in communication networks. In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables.\u0000 This work, based in a previous work of the author [3], analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commericial algorithms. Simulation results indicate a better throughput of the improved proposals. So, AntNet and its variant here proposed are promising options for routing in large public networks such as Interet.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131240827","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":"Critical path analysis of TCP transactions","authors":"BarfordPaul, CrovellaMark","doi":"10.1145/371626.371759","DOIUrl":"https://doi.org/10.1145/371626.371759","url":null,"abstract":"Improving the performance of data transfers in the Internet (such as Web transfers) requires a detailed understanding of when and how delays are introduced. Unfortunately, the complexity of data transfers like those using HTTP is great enough that identifying the precise causes of delays is difficult. In this paper we describe a method for pinpointing where delays are introduced into applications like HTTP by using critical path analysis. By constructing and profiling the critical path, it is possible to determine what fraction of total transfer latency is due to packet propagation, network variation (e.g., queuing at routers or route fluctuation). packet losses, and delays at the server and at the client. We have implemented our techique in a tool called tcpeval that automates critical path analysis for Web transactions. We show that our analysis method is robust enough to analyze traces taken for two different TCP implementations (Linux and FreeBSD). To demonstrate the utility of our approach, we present the results of critical path analysis for a set of Web transactions taken over 14 days under a variety of server and network conditions. The results show that critical path analysis can shed considerable light on the causes of delays in Web transfers, and can expose subtleties in the behavior of the entire end-to-end system.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130270281","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":"Review of traffic scheduler features on general purpose platforms","authors":"E. Magaña, Edurne Izkue, J. Villadangos","doi":"10.1145/371626.371748","DOIUrl":"https://doi.org/10.1145/371626.371748","url":null,"abstract":"In this study, we review the features of a traffic scheduler running on a general-purpose platform, specfically a PC with a Linux operating system. The traffic scheduler was configured to manage a CBQ (Class Based Queueing) queue discipline, and by means of a series of experiments, we proved that the limitations of the system are due to the accuracy of the clock. After we modified this factor, we reviewed the features of the scheduler again. We were able to prove that the features of the scheduler improve greatly at the expence of a very small increase (around 10%) in the use of the systems's CPU.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132947103","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}