{"title":"Symbiotic streaming of elastic traffic on interactive transport","authors":"J. Khan, R. Zaghal, Qiong Gu","doi":"10.1109/ISCC.2003.1214314","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214314","url":null,"abstract":"Interactivity in transport protocol can greatly benefit transport friendly applications. We envision if a transport mechanism, which is interactive and can provide event notification about network state to the subscriber of its communication service, than a wide range of solution to many of today's hard network problem can be instituted. Recently we have implemented this concept system as a new TCP kernel on FreeBSD called TCP interactive and a novel symbiotic MPEG-2 full logic transcoder. In this paper we share the results of the TCP interactive performance experiment and show potential dramatic improvement in time-bounded video delivery.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"111 3S 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123478216","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 scalable distributed VoIP conferencing using SIP","authors":"R. V. Prasad, R. Hurni, H. Jamadagni","doi":"10.1109/ISCC.2003.1214185","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214185","url":null,"abstract":"Session initiation protocol seems to be proffered standard for voice-over-IP. In this paper, we consider the limitations of existing SIP conferencing methods and propose a distributed architecture using controllers (SIP proxy servers) and conference servers which facilitate the control and media handling of a VoIP conference. The conference servers are designed on the basis of H.323's multipoint processors and handle the audio part of the conference. We provide conferencing messages on SIP that bring these controllers and conference servers together along with the clients for scalable conference on the Internet. The schematic of the proxy server and conference server is presented to aid in implementation. We also explain the mechanism we use to improve the quality of mixed output speech by selecting the streams at the clients.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122836627","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 application of efficient certificate status handling methods to high traffic authentication services","authors":"E. Faldella, M. Prandini","doi":"10.1109/ISCC.2003.1214219","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214219","url":null,"abstract":"Most organizations show a strong interest in digital signature technology as a means for secure and authenticated document exchange, hoping that it helps reduce the paper-based transactions. The main problem posed by this technology is with the necessary public-key infrastructure, and in particular with certificate status handling. Rather than addressing the revocation problem in general, a specific but interesting aspect is discussed here: secure identification of a large number of users (like citizens for a public administration) accessing a wide pool of services. This paper describes the definition and deployment of a web-based environment suitable for offering administrative services to citizens and for accepting authenticated documents from citizens. The best features of two different certificate status handling schemes, the standard CRL and a novel on-line scheme, have been exploited within this environment to obtain a good balance between security, timeliness and efficiency.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"103 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124178702","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 and performance evaluation of a flexible and efficient server assisted signature protocol","authors":"K. Bicakci, N. Baykal","doi":"10.1109/ISCC.2003.1214284","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214284","url":null,"abstract":"One method to reduce the computational costs of generating public key signatures on constrained devices is to get help from a verifiable server. In this paper, we propose a (verifiable) server assisted signature protocol, which is the first one that totally eliminates public key operations for the ordinary user. Our protocol is also more efficient and flexible in terms of storage since unlike previous ones the user does not need to save the server's signature to prove it's cheating.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125110850","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":"Extracting significant repeating figures in music by using quantized melody contour","authors":"Chuan-Wang Chang, H. C. Jiau","doi":"10.1109/ISCC.2003.1214255","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214255","url":null,"abstract":"To extract music features from the raw data of music object and organize them as the music indices is important for music retrieval. A repeating pattern is a series of notes which appear more than once. Most of the repeating patterns are themes or tones for people to remember easily. A figure is defined as a melody contour of a musical segment. A sequence pattern is a melody segment that has the same figure with other melody segments. In this paper, we use the idea of interval between two adjacent notes to form quantized melody contour for representing music objects. This representation differs from existing methods that use notes to form a melody string. We also propose a method to find significant repeating figures. These figures could cover most of the repeating patterns that are in a noted melody string. In addition, the number of repeating figures found in samples of music is less than that of repeating patterns. As a result, the total execution time and memory space can be dramatically decreased.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126224516","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 analytical RED function design guaranteeing stable system behavior","authors":"E. Plasser, T. Ziegler","doi":"10.1109/ISCC.2003.1214248","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214248","url":null,"abstract":"This paper introduces the procedure for an analytical derivation of the drop probability function for the random early detection queue management mechanism. The procedure is based on a model of the TCP window system stability with methods of control theory. The term stability refers to the oscillation amplitude of the steady state queue size. The outcome is a polynomial function of the queue size, which can be approximated with a power function of the queue size. Besides the goal of achieving low oscillations for the whole load range, this derived function shows yet other advantages. There are no parameters to adjust, which extends the applicability of RED to a wide range of load situations applying the derived function. Additionally, the under-utilization at low loads, as often experienced with the original RED function, is avoided automatically. Simulations show clear evidence that the derived function outperforms the original linear RED function.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128504890","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":"Analysis of admission control mechanisms using non-linear control theory","authors":"M. Kihl, A. Robertsson, B. Wittenmark","doi":"10.1109/ISCC.2003.1214294","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214294","url":null,"abstract":"All service control nodes can be modelled as a server system with one or more servers processing incoming requests. In this paper we show how non-linear control theory may be used when analyzing admission control mechanisms for server systems. Two models are developed, one linear and one non-linear. We show that, due to the non-linearities appearing in a real server system, linear control theory is sufficient when designing controllers for these systems. With non-linear analysis, however, the dynamics of a server system may be analysed and taken care of by choosing the controller parameters appropriately.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127905651","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":"Registration frameworks for IP mobility agents hierarchies","authors":"A. Abdel-Hamid, H. Abdel-Wahab","doi":"10.1109/ISCC.2003.1214312","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214312","url":null,"abstract":"Mobile IP is a network layer solution to the wide-area mobility problem in the Internet. Mobility agents' hierarchies and regional registrations have been introduced in the foreign domain as a local-area mobility solution. In this paper, we critique the current regional registration proposal identifying some drawbacks with its registration mechanisms signaling design. In addition, we introduce novel registration frameworks for regional and home registrations associated with intra-hierarchy handoffs. We attempt to emphasize the local handoff aspect and benefit from the presence of a mobility support overlay network in the form of an agents' hierarchy. Performance evaluation results through network simulation demonstrate the effectiveness of the proposed techniques in reducing UDP packet loss, and maintaining better TCP throughput versus base mobile IP, in the case of a distant home agent.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122198824","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 evaluation of public-key cryptosystem operations in WTLS protocol","authors":"A. Levi, E. Savaş","doi":"10.1109/ISCC.2003.1214285","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214285","url":null,"abstract":"WTLS (wireless transport layer security) is an important standard protocol for secure wireless access to Internet services. WTLS employs public-key cryptosystems during the handshake between mobile client and WAP gateway (server). Several cryptosystems at different key strengths can be used in WTLS. The trade-off is security versus processing and transmission time. In this paper, an analytical performance model for public-key cryptosystem operations in WTLS protocol is developed. Different handshake protocols, different cryptosystems and key sizes are considered. Public-key cryptosystems are implemented using state-of-the-art performance improvement techniques, yielding actual performance figures for individual cryptosystems. These figures and the analytical model are used to calculate the cost of using public-key cryptosystems in WTLS. Results for different cryptosystems and handshake protocols are comparatively depicted and interpreted. It has been observed that ECC (elliptic curve cryptography) performs better than its rival RSA cryptosystem in WTLS. Performance of some stronger ECC curves, which are not considered in WTLS standard, is also analyzed. Results showed that some of those curves could be used in WTLS for high security applications with an acceptable degradation in performance.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130387251","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":"WAF: wireless-adaptive fair scheduling for multimedia stream in time division multiplexed packet cellular systems","authors":"Young-June Choi, S. Bahk","doi":"10.1109/ISCC.2003.1214259","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214259","url":null,"abstract":"Cellular systems are designed to support voice service over the wireless channel but nowadays data-only networks such as cdma2000 1x EV-DO and high speed downlink packet access (HSDPA) are being deployed in the midst of evolution to the next generation wireless networks. Such systems become important because data services are essential in future wireless networks that are supposed to adopt the concept of all-IP to support integrated services. To increase the data transmission rate at downlink in cdma2000 1x EV-DO and HSDPA, the base station (BS) uses only a channel multiplexed by time division, not by code division. These systems use proportional fair scheduling to maximize throughput. While it is useful for non real time traffic, it does not provide appropriate QoS for real time services such as voice and video. Therefore we need to incorporate the multimedia QoS requirements into the design of a new scheduling algorithm. Our proposed wireless-adaptive fair scheduling (WAF) tries to allocate time slots with fair share according to the stream requirements considering the varying channel conditions to achieve good throughput. The simulation results show that our scheme can guarantee fair service and increase throughput by up to 41% compared to the purely fair (PF) scheduling scheme.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131759556","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}