{"title":"Defense against man-in-the-middle attack in client-server systems","authors":"D. Serpanos, R. Lipton","doi":"10.1109/ISCC.2001.935348","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935348","url":null,"abstract":"The deployment of several client-server applications over the Internet and emerging networks requires the establishment of the client's integrity. This is necessary for the protection of copyright of distributed material and, in general, for protection from loss of \"sensitive\" (secret) information. Clients are vulnerable to powerful man-in-the-middle attacks through viruses, which are undetectable by conventional anti-virus technology. We describe such powerful viruses and show their ability to lead to compromised clients, that cannot protect copyrighted or \"sensitive \" information. We introduce a methodology based on simple hardware devices, called \"spies\", which enables servers to establish client integrity, and leads to a successful defense against viruses that use man-in-the-middle attacks.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123297218","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 predictive end-to-end QoS scheme in a mobile environment","authors":"G. L. Grand, E. Horlait","doi":"10.1109/ISCC.2001.935426","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935426","url":null,"abstract":"Mobility is one of the new services that have been introduced due to the development and popularity of the Internet. However, the Internet currently lacks quality of service support. This article presents an end-to-end QoS architecture for roaming terminals. This architecture is based on mobile IP reservation protocol (MIR), hierarchical mobile IP (HMIP) and Diffserv. MIR operates within the wireless environment inside a HMIP domain while Diffserv mechanisms provide end-to-end QoS. MIR addresses the problem of bandwidth and reservation in order to provide users of a shared medium with a guaranteed bandwidth. Resources are reserved in the cells where mobile nodes are likely to go.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114064957","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":"Efficient routing with quality-of-service requirements","authors":"S. Vieira","doi":"10.1109/ISCC.2001.935394","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935394","url":null,"abstract":"We present an efficient routing algorithm for quality-of-service (QoS) connections requiring deterministic end-to-end delay bounds. Such routing selects paths with enough resources to accommodate the connections and satisfies their QoS. We assume that the connection scheduling, connection admissibility and state advertisement at every node is based on the rate-controlled static priority (RCSP) algorithm. We provide conditions to efficiently find a path that satisfies the QoS constraints. The performance of the QoS routing algorithm can be seriously degraded if the states are outdated and/or has high advertisement overhead. We propose conditions coupled to the RCSP algorithm that provide efficient state updates.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124519077","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":"Small packets aggregation in an IP domain","authors":"H. Tounsi, F. Kamoun, L. Toutain","doi":"10.1109/ISCC.2001.935453","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935453","url":null,"abstract":"With the emergence of new multimedia applications and the large standardization effort of packet telephony products, a large volume of small packet traffic flows in the network. It is expected to get worse with the popularity of VoIP applications. To mitigate the impact of small packets we propose the aggregation of packets present in the output queue and which have the same forwarding equivalence class, such as those which will leave a routing domain from the same node (an egress node). The set of aggregated packets will be subsequently treated as a single packet, thus requiring smaller processing overhead at intermediate routers. We report the results of several simulations that evaluate the performance benefits of aggregation. We note that aggregation keeps the same behavior as pure FIFO. Thus it doesn't disturb the aggregator router behavior. It saves CPU processing time and buffer space at intermediate routers, thus improving the overall network performance.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132920621","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":"CANIT: a new algorithm to improve the fairness of TCP congestion avoidance","authors":"H. Benaboud, N. Mikou","doi":"10.1109/ISCC.2001.935452","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935452","url":null,"abstract":"We propose a new policy for TCP congestion avoidance and we compare, by a queueing-simulation study, its performance to those of standard policy. This leads to unfair sharing of bandwidth when multiple connections, with different round trip times (RTTs), traverse the same bottleneck link with the long RTT connections obtaining only a small fraction of their fair share of the bandwidth. The new policy, which we refer to as \"CANIT\" (Congestion Avoidance with Normalized Interval of Time), allows TCP senders of all connections sharing the same network resource to accelerate their rates similarly during the congestion avoidance phase. Our first main result is that, using the \"CANIT\" algorithm, instead of the standard congestion avoidance one, improves the TCP fairness as well as the utilization of network resources. Our second main result is that, using the small values of the parameter \"NIT\" (Normalized Interval of Time) in our algorithm leads to a more efficient use of bandwidth and the fairness is more improved.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115503729","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":"Dynamics and evolution of Web sites: analysis, metrics and design issues","authors":"L. Cherkasova, M. Karlsson","doi":"10.1109/ISCC.2001.935356","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935356","url":null,"abstract":"Our goal is to develop a Web server log analysis tool that produces a Web site profile and its system resource usage in a way useful to service providers. Understanding the nature of traffic to the Web site is crucial in properly designing site support infrastructure, especially for large, busy sites. The main questions we address are the new access patterns of today's WWW, how to characterize dynamics or evolution of Web sites, and how to measure the rate of changes. We propose a set of new metrics to characterize the site dynamics, and we illustrate them with analysis of three different Web sites.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"1999 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121011614","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":"Service development and deployment in H.323 and SIP","authors":"J. Glasmann, W. Kellerer, Harald Müller","doi":"10.1109/ISCC.2001.935402","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935402","url":null,"abstract":"Among the different solutions providing multimedia teleconferencing services over IP networks, two approaches are of major importance: H.323 standardized by the ITU-T and SIP standardized by the IETF. Some comparisons on a system level have been published, but the service architectures have rarely been addressed in the literature. In the near future an important driver for multimedia business will be the services and the mechanisms for their fast and efficient service development and deployment. We provide a comparison of the methods to implement services in SIP and H.323 focusing on the service architectures and their capabilities regarding the implementation of new features. While H.323 is still the more mature standard-albeit SIP tends to keep up-the two protocols have basic differences in the supplementary services architectures. H.323/H.450 has been defined as a sophisticated enterprise solution and is well suited to support complex multimedia calls involving widely interoperable supplementary services. SIP on the other side represents a more universal approach. SIP uses more generic syntax and semantics regarding feature definition and session description, which carries the danger to cause interworking problems. The advantage of SIP is its general applicability for signaling non-VoIP sessions for example the establishment of a PSTN session as standardized in the PINT approach.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126960160","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":"CAC algorithm based on advanced round robin method for QoS networks","authors":"Tamás Marosits, S. Molnár, J. Sztrik","doi":"10.1109/ISCC.2001.935386","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935386","url":null,"abstract":"In this paper a new traffic control method called advanced round robin (ARR) is presented. It is shown that ARR can provide both worst case and statistical quality of service guarantees without coupling cell loss and delay requirements. A related connection admission control algorithm with performance study is also presented. A comparative performance analysis of ARR using simulation was performed in different real scenarios. Results are compared to a reference system and to the simple round robin method.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122370450","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 flow control approach for encoded video applications over ATM network","authors":"R. Djemal, B. Bouallegue, J. Diguet, R. Tourki","doi":"10.1109/ISCC.2001.935400","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935400","url":null,"abstract":"This paper addresses the problem of transmission of digital video communication over B-ISDN such as the ATM network. It provides the appropriate solution based on a good knowledge of both the video system interface design and broadband network capabilities. An interface between MPEG-2 and ATM network architecture is studied to improve the video visual quality. The presented approach try to overcome the difficulty imposed by traditional random cell discarding due to the bursty and variable bit rate transmission, nature of compressed video. The presented approach is guided by using a dynamic bandwidth management with the maximum flexibility via an appropriate scheduling algorithm and a new cell discarding scheme. In order to support these mechanisms, enhancement to the ATM adaptation layer is performed and a new MPEG-2 mapping strategy is also proposed. The performance evaluation have shown a significant minimization of losses ATM cells and a best video quality compared with the sequence transmitted without flow control.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"118 41","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113940270","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":"Integrated performance evaluating criteria for network traffic control","authors":"Yong Jiang, Chuang Lin, Jianping Wu, Xiaoxia Sun","doi":"10.1109/ISCC.2001.935412","DOIUrl":"https://doi.org/10.1109/ISCC.2001.935412","url":null,"abstract":"The performance-evaluating criterion is one of the most important issues for the design of network traffic control strategy and algorithms. The design will be varied with the evaluating criterion. Because the network traffic control strategy has multiple performance objects, how to reach multiple objects simultaneously is one difficult problem. This paper provides a set of integrated performance evaluating criteria from the network traffic control model, and the criteria integrates several objects, such as the network performance, user's QoS requirement and system fairness. Then it is discussed and analyzed in details. Moreover, the integrated performance evaluating criteria can be applied to performance evaluation and improvement in network traffic control strategy and algorithms.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"382 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134102507","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}