{"title":"Analysis of circuit-switched networks under long-range dependent traffic","authors":"G. Min, M. Ould-Khaoua","doi":"10.1109/ISCC.2002.1021677","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021677","url":null,"abstract":"Many recent studies on a wide range of networks by means of high quality, high time-resolution measurements have indicated that traffic burstiness and correlations among inter-arrival intervals are present over many time scales, which can be modelled using the long-range dependent (LRD) process. A LRD process is characterised by a hyperbolically decaying correlation function. However, interconnection networks used in current multicomputers have been mainly designed and analysed under the assumption that traffic follows the traditional short-range dependent process (e.g., the Poisson arrival process). In an effort to reevaluate network performance, this paper presents a new analytical model for circuit-switched interconnection networks under LRD traffic. Simulation experiments reveal that the model exhibits a good degree of accuracy under various operating conditions.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128821222","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":"Intermediaries for the World-Wide Web: overview and classification","authors":"M. Dikaiakos","doi":"10.1109/ISCC.2002.1021684","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021684","url":null,"abstract":"Intermediaries are software entities deployed on Internet hosts of the wireline and wireless Web that intervene in the flow of information from clients to origin servers at the application level of the WWW. Intermediary systems fall under the general term of \"middleware\". Intermediaries represent a useful abstraction for the design and study of emerging software infrastructures for \"next-generation\" Web services. Their importance is increasing with the increasing demand for personalization, localization, and support for ubiquitous access over different physical media and protocols. We present an overview of a wide range of systems that can be described as intermediaries, classifying them in a number of broad categories according to their basic functionalities. Going beyond simple WWW proxies, we examine the requirements arising from the need to support personalization, mobility and ubiquity under high loads. We identify and refine a set of important properties and characteristics of intermediary systems. Based on these properties, we introduce a detailed taxonomy of characteristic systems and identify a number of key components of emerging intermediary infrastructures.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115615258","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":"Code division multiple access with adaptable reservation: a new paradigm for CDMA-based multimedia wireless networks","authors":"C. Yeh, Dali Zhang, R. Iltis, Hua Lee","doi":"10.1109/ISCC.2002.1021766","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021766","url":null,"abstract":"An advantage of CDMA-based protocols is that packets can be transmitted immediately without prior channel access or resource reservation. In this paper, however, we propose to incorporate a reservation mechanism into CDMA-based protocols for next-generation wireless networks with data, voice, and multimedia applications. The resultant paradigm is called code division multiple access with adaptable reservation (CDMA/AR). The motivations for this change include that QoS guarantees can continue to be provisioned in CDMA/AR-based systems even when many handoff mobile stations enter an already heavily utilized cell. Our simulation results and mathematical analysis show that the adaptable reservation and differentiated admission control mechanisms of CDMA/AR can considerably reduce the handoff-rejection and call-blocking rates for higher-priority traffic to very small values, while achieving throughput close to 100% at the same time.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125640440","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":"Security as services in active networks","authors":"Zhaoyu Liu, R. Campbell, M. D. Mickunas","doi":"10.1109/ISCC.2002.1021777","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021777","url":null,"abstract":"This paper discusses the design and implementation for supporting customized security services in active networks using active networking principles. The customized security services support is based on a secure node architecture that includes an active node operating system security API, an active security guardian, and quality of protection provisions. The support of highly customized security services permits active nodes to satisfy the application-specific dynamic security and protection requirements. It associates quality of protection with network software and application security. Applications can dynamically select the suitable security configurations and services at each active routing node, based on their security and performance requirements. The secure node architecture, together with the support of dynamically customized security services, can provide a fundamental base for securing the active network infrastructure and active applications.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126624052","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 intelligent agent-based model for security management","authors":"K. Boudaoud, C. McCathieNevile","doi":"10.1109/ISCC.2002.1021776","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021776","url":null,"abstract":"Networks are evolving continuously in terms of number of users and services offered. This evolution makes them more complex and consequently more vulnerable to various kinds of attacks. Therefore, security management of these networks requires more intelligent and sophisticated models. Multi-agent systems and intelligent agent technology provide a powerful paradigm for the modeling and development of complex systems. So, to adapt to networks' evolution and complexity, we propose an intelligent agent-based security management model. In this paper, we describe our model of security management of networks, which is based on security policies, security events and BDI concepts.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125861933","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":"Rate-based active queue management with priority classes for better video transmission","authors":"J. Chung, M. Claypool","doi":"10.1109/ISCC.2002.1021664","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021664","url":null,"abstract":"Video streaming on the Internet often suffers from high frame loss rates due to fragmentation of large frames and inter-frame dependencies needed for high compression. We propose adding lightweight, priority-based queue management to Internet routers to significantly improve performance of video streaming. We extend a Rate-Based RED approach to support three priority classes and apply it to MPEG. The performance of the mechanism on video streams is measured, analyzed and compared with Drop-Tail and RED in terms of transport layer throughput, system fairness, application layer throughput and goodput, and video stream quality. Extensive simulation shows that our approach improves MPEG video stream quality and network system fairness over traditional RED under a variety of workloads.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121876653","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":"Exploitation of different types of locality for Web caches","authors":"George Karakostas, D. Serpanos","doi":"10.1109/ISCC.2002.1021680","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021680","url":null,"abstract":"Object access distribution in the Web is governed by Zipf's law, in general. This property leads to effective Web caches, which store the most popular objects and typically employ the LFU replacement policy, which achieves high, and often the highest, cache hit rates. However, Web cache design based only on Zipf's law has two main disadvantages: (i) it does not exploit the temporal and spatial locality of user accesses on a per session basis, and (ii) LFU implementation is costly and impractical in many environments, because it requires statistics on all objects accessed since the beginning of a cache's operation. We consider all parameters of locality of references in the Web (temporal, spatial and popularity) and draw an analogy with processor caches. Given cache replacement policies that address different locality characteristics, we argue that there exist replacement algorithms that combine these characteristics and achieve high performance at a low cost. We describe the Window-LFU (W-LFU), a policy that combines LFU and LRU and achieves better performance than LFU at lower cost. W-LFU exploits both Zipf's law, and temporal locality by using the accesses in a recent time-window. Simulations with actual traces indicate that W-LFU provides better results than theoretically expected.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121525872","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":"Design of a multicast file transfer tool on top of ALC","authors":"V. Roca, Benoît Mordelet","doi":"10.1109/ISCC.2002.1021787","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021787","url":null,"abstract":"This work describes several techniques that we used to design a multicast file transfer tool on top of the asynchronous layered coding protocol proposed by the RMT IETF WG. Their goal is to improve the overall performance of that tool. More specifically we analyze several object and symbol ordering schemes that improve transmission efficiency and we see how the application level framing paradigm can help to reduce memory requirements and enable processing to be hidden behind communications.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116579632","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 hierarchical distributed protocol for MPLS path creation","authors":"M. El-Darieby, D. Petriu, J. Rolia","doi":"10.1109/ISCC.2002.1021782","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021782","url":null,"abstract":"Network service provisioning involves the control of network resources through signaling, routing and management protocols that achieve quality of service and traffic engineering objectives. Network service providers are typically faced with scalability problems due to the explosion in network size and demand. In this paper we propose a new hierarchical distributed protocol for the provisioning of MPLS-based tunnels. The protocol encapsulates the required signaling and routing. The protocol alleviates the scalability problem through extending the current two-tier architecture of the Internet to a multi-level hierarchical one. It enables mechanisms for quality of service, and intra- and inter-domain traffic engineering. Analytical analysis and simulation results show that the protocol exploits parallelism in routing computation to reduce the setup time of an MPLS path. This comes at the expense of an increased message complexity relative to other hierarchical protocols.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120961789","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":"On synthetic criteria for evaluation of network traffic control policies","authors":"Chuang Lin, D. Marinescu, Y. Ji, G. Marinescu","doi":"10.1109/ISCC.2002.1021659","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021659","url":null,"abstract":"The network traffic control strategies and algorithms are part of the feedback loop that allows such a complex system to operate at an optimal or near-optimal functioning point. Effective performance criteria are an important element for providing the feedback regarding the current state of the system; thus, they represent a key aspect of the design of network traffic control strategies and algorithms. We introduce three synthetic factors of merit regarding the quality of service, the quantity of service and the ratio of the two. The figures of merit may take into account multiple QoS attributes. Each of these figures of merit can be calculated either for individual flows, the flows with a common characteristic, e.g., belonging to the same class, or crossing the same router, or for all the flows in a network. We also define a coefficient of fairness among the flows with a common characteristic, as the ratio of the variance to the expected value of a factor of merit.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121139619","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}