{"title":"Building functional patterns for implementing distributed applications","authors":"V. M. Gulías, Alberto Valderruten, C. Abalde","doi":"10.1145/1035662.1035670","DOIUrl":"https://doi.org/10.1145/1035662.1035670","url":null,"abstract":"Combining the use of design patterns and distributed functional programming is pointed out as a key factor to produce correct distributed systems running on a cluster of computers. A high degree of adaptability, fault tolerance and scalability are obtained at low development costs. Patterns of recurrent distributed design problems are presented and implemented using the distributed functional language Erlang. The design patterns discussed involve coordination mechanisms of concurrent threads such as guarded suspension or scheduling abstractions. The paper includes some applications of the presented patterns and a small experiment with a clustered XSLT engine.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127129518","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":"Effects of traffic aggregation on quality of service parameters","authors":"C. Watagodakumbura, A. Jennings, N. Shenoy","doi":"10.1145/1035662.1035677","DOIUrl":"https://doi.org/10.1145/1035662.1035677","url":null,"abstract":"Differentiated Services (DiffServ) Architecture is based on aggregation of traffic as opposed to per flow traffic. When DiffServ is used in real time traffic environment it is important to study the effects of traffic aggregation on quality of service parameters. One-way delay and instantaneous packet delay variation (IPDV) are the most commonly used quality of service parameters for real time traffic. In this paper we study how one-way delay and IPDV are affected by traffic aggregation. We discover through our simulations and analytical models that IPDV increases with traffic aggregations while one-way delay is not affected purely due to aggregation. We used a priority queue scheduler for our simulation where the real time traffic was served with highest priority.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132401511","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":"Performance modelling of computer networks","authors":"R. Puigjaner","doi":"10.1145/1035662.1035672","DOIUrl":"https://doi.org/10.1145/1035662.1035672","url":null,"abstract":"This paper intends to present an overview of the main problems that appear when we wish to estimate the performance of a non existing system or a future situation of an existing system. The main techniques used for representing the workload and the system performance will be also presented. It will start with a definition of the main problems existing in this field, then present the main techniques used for modelling computer networks and their workload and the methods used to obtain solutions from them. Finally a simple example will show the use of all of these techniques and methods.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132975977","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":"MPLS backbones and QOS enabled networks interoperation","authors":"Fernando Manchini Serenato, Juergen Rochol","doi":"10.1145/1035662.1035667","DOIUrl":"https://doi.org/10.1145/1035662.1035667","url":null,"abstract":"It is believed that in the future the telecommunication and data networks will be integrated into one single network, based on IP switching. One of the technologies that certainly will be adopted in the core of this new network is MPLS. Together with MPLS, other QoS architectures, such as IntServ and DiffServ will be used. As a result of this, a framework that allows the interoperability of the different existing architectures is needed. In this paper, an integration model based on MPLS and DiffServ is presented. The model was tested in the ns2 simulator and the results certify its applicability as the presented model showed better performance in all analyzed QoS parameters: delay, jitter, packet loss and bandwidth.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123574585","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":"Predictive call admission control for all-IP wireless and mobile networks","authors":"K. Dias, S. Fernandes, D. Sadok","doi":"10.1145/1035662.1035674","DOIUrl":"https://doi.org/10.1145/1035662.1035674","url":null,"abstract":"This paper proposes a novel call admission control (CAC) scheme for wireless and mobile networks. Our proposal avoids per-user reservation signaling overhead and takes into account the expected bandwidth to be used by calls handed off from neighboring cells based only on local information stored into the current cell where user is seeking admission. To this end, we propose the use of two time series-based models for predicting handoff load: the Trigg and Leach (TL), which is an adaptive exponential smoothing technique, and ARIMA (Autoregressive Integrated Moving Average) that uses the Box & Jenkins methodology. These methods are executed locally by each base station or access router and forecast how much bandwidth should be reserved on a periodic time window basis. The two prediction methods are compared through simulations in terms of new call blocking probability and handoff dropping probability. Despite the TL method simplicity, it can achieve similar levels of call blocking probability and handoff dropping probability than those of the computational demanding ARIMA models. In addition, depending on the schemes settings, the prediction methods can grant an upper bound on handoff dropping probability even under very high load scenarios.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121127321","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":"The least semantically related cache replacement algorithm","authors":"A. Calsavara","doi":"10.1145/1035662.1035665","DOIUrl":"https://doi.org/10.1145/1035662.1035665","url":null,"abstract":"This article presents the Web cache replacement algorithm named Least Semantically Related (LSR), as an alternative to well-known and widely employed replacement policies, such as SIZE, LFU and LRU, which are based on physical properties of objects (documents). LSR is based on the semantics of the information contained within objects: LSR tends to evict objects which are less related to the last object to enter the cache with respect to their semantics, therefore preserving objects of more interest to clients. A detailed algorithm and a data structure for LSR where objects are classified according to a previously established taxonomy were designed and implemented for the purposes of validation and comparison with other replacement policies. Besides, a framework for simulation was designed and verified, including the data preparation process. The initial experimental results show that LSR out-performs traditional policies in terms of hit rate, in most cases.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123618592","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":"Adaptation of IP multicast for optically switched networks: an analysis of mirrors","authors":"A. Abelém, M. Stanton","doi":"10.1145/1035662.1035669","DOIUrl":"https://doi.org/10.1145/1035662.1035669","url":null,"abstract":"New research perspectives opened up by the combination of IP and WDM technologies present an excellent opportunity for reformulating certain aspects of multicast transmission, bringing them more in line with the needs of future generations of IP internetworking. This paper analyses MIRRORS, which proposes modifications to traditional IP Multicast in order to improve its scalability as a function of the number of simultaneously active groups, as well as making it more appropriate for use in optically switched networks. In this analysis, MIRRORS is compared with other major multicast alternatives, using such parameters as: information state requirements, control overhead, cost of packet forwarding and cost of the multicast distribution tree.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124858504","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":"Throughput guarantees for elastic flows using end-to-end admission control","authors":"Lluís Fàbrega, T. Jové, Y. Donoso","doi":"10.1145/1035662.1035676","DOIUrl":"https://doi.org/10.1145/1035662.1035676","url":null,"abstract":"Internet applications such as web or ftp will be satisfactorily supported by a guaranteed minimum throughput service. We propose to build this service in a core-stateless network such as Differentiated Services with an Admission Control (AC) method based on end-to-end measurements, using the first packets of the flow. The whole scheme uses a small set of packet classes (with different discarding priorities), and is therefore simple and scalable. We evaluate the scheme through simulations in several scenarios using TCP flows. Finally, we propose an extension of the method aimed at improving its performance.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123254422","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":"Intelligent management of network devices aided by a strategy and a tool","authors":"Calebe P. Bianchini","doi":"10.1145/1035662.1035675","DOIUrl":"https://doi.org/10.1145/1035662.1035675","url":null,"abstract":"The increasing decentralization of computational resources and the need for distributed and heterogeneous systems management have motivated the development of strategies and tools to assist network administrators in a great part of their tasks through automatic monitoring of devices. Combining the ideas of pervasive computing and software agents, this work presents a tool for monitoring devices distributed in a network and guided by a well-defined strategy. The tool uses intelligent software agents as the main monitoring mechanism.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124756705","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":"Application-level graphic streaming channel","authors":"P. Inostroza, J. Lemordant","doi":"10.1145/1035662.1035671","DOIUrl":"https://doi.org/10.1145/1035662.1035671","url":null,"abstract":"Scene Graph APIs are used to interact at the application level with a 2D or 3D scene. Examples of such APIs are the External Authoring Interface for VRML scenes or the MPEG-J scene graph API for MPEG-4 scenes. In theory, a remote or local application could interact with the scene using these APIs. But in practice, the application is running in the scene player as a java applet or MPEGlet. This paper shows how a remote scene graph API can be implemented by defining a new graphic streaming channel at the application level. We describe a simple and compact communication protocol corresponding to this streaming channel and give some results of use of this channel. A comparison between EAI and MPEG-J scene graph is also presented.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133760787","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}