2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.最新文献

{"title":"An insight for consequences of e-business: possible case of cross border trading without using hard currency","authors":"Shiro Uesugi","doi":"10.1109/SAINTW.2003.1210143","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210143","url":null,"abstract":"E-business has entered into a new era, where new types of payment are present. The payments between the debtor and creditor are not necessarily carried out by traditional \"cash vs. goods\" style any more. The mechanism of credit enhancement has already been changing as direct settlements increase. In addition, new kind of money is emerging; money that is not issued by the government but the users. There are movements of new local currency systems in Japan. That is not particularly limited within Japan but increasing number can be counted all over the world. Many of those mechanisms utilize the features of electronic settlements. Recently, systems that propose the protocols for P2P settlement are gaining attention. This paper discusses the present evolution of such systems (ex. WAT-system) and foresees what comes next, that is to say, \"Local currency becomes global currency\" in cross border trading.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"17 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126962862","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":"SNMP in the IPv6 context","authors":"G. Keeni, D. Chakraborty, Kazuhide Koide, N. Shiratori","doi":"10.1109/SAINTW.2003.1210167","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210167","url":null,"abstract":"Monitoring networks is important for operations, management and security as well as for research and development, but with the rapid pace in which the network is evolving and newer protocols are emerging it is becoming a challenge to monitor new generation networks. We describe the protocol implementation and deployment issues that exist in monitoring IPv6 networks using the Internet management protocol SNMP and then discuss some of the measures taken to work around the issues.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116213332","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":"Secure link state routing for mobile ad hoc networks","authors":"Panos Papadimitratos, Z. Haas","doi":"10.1109/SAINTW.2003.1210190","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210190","url":null,"abstract":"Secure operation of the routing protocol is one of the major challenges to be met for the proliferation of the mobile ad hoc networking (MANET) paradigm. Nevertheless, security enhancements have been proposed mostly for reactive MANET protocols. The proposed secure link state routing protocol (SLSP) provides secure proactive topology discovery, which can be beneficial to network operation in a number of ways. SLSP can be employed as a stand-alone protocol, or fit naturally into a hybrid routing framework, when combined with a reactive protocol. SLSP is robust against individual attackers, is capable of adjusting its scope between local and network-wide topology discovery, and is capable of operating in networks of frequently changing topology and membership.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130341808","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":"XCAST6: eXplicit multicast on IPv6","authors":"Yuji Imai, H. Kishimoto, M. Shin, Young Han Kim","doi":"10.1109/SAINTW.2003.1210164","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210164","url":null,"abstract":"XCAST6: eXplicit Multicast on IPv6 is a new type of multicast datagram delivery system that enables multipoint visual communications, the killer-applications of the next-generation Internet. In the last decade, using the current scheme of group-address multicast, a good number of useful applications was developed and tested. However, the deployment of the multicast was very slow. XCAST6 solves these problems embedding an explicit list of destinations into the extension routing header of the IPv6 datagram. Intermediate routers may duplicate and forward the datagram only searching one's unicast routing tables. Moreover, using a semi-permeable capsule technique, users can ensure the reachability of the datagram. Deploying a very few number of XCAST6 routers, we could have operated the multi-point video conference trial on the academic IPv6 network among Japan, North America and Korea to prove employability and usefulness of XCAST6.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363014","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":"Toward secure key distribution in truly ad-hoc networks","authors":"A. Khalili, Jonathan Katz, W. Arbaugh","doi":"10.1109/SAINTW.2003.1210183","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210183","url":null,"abstract":"Ad-hoc networks - and in particular wireless mobile ad-hoc networks $have unique characteristics and constraints that make traditional cryptographic mechanisms and assumptions inappropriate. In particular it may not be warranted to assume pre-existing shared secrets between members of the network or the presence of a common PKI. Thus, the issue of key distribution in ad-hoc networks represents an important problem. Unfortunately, this issue has been largely ignored; as an example, most protocols for secure ad-hoc routing assume that key distribution has already taken place. Traditional key distribution schemes either do not apply in an ad-hoc scenario or are not efficient enough for small, resource-constrained devices. We propose to combine efficient techniques from identity-based (ID-based) and threshold cryptography to provide a mechanism that enables flexible and efficient key distribution while respecting the constraints of ad-hoc networks. We also discuss the available mechanisms and their suitability for the proposed task.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117147635","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":"Applying Kerberos to the communication environment for information appliances","authors":"S. Sakane, N. Okabe, K. Kamada, H. Esaki","doi":"10.1109/SAINTW.2003.1210159","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210159","url":null,"abstract":"When IPv6 deploys, each information appliance shall have a global IP address and communicate directly with each other. Some devices may have much lower processing performance than PCs have due to various limitations (e.g. cost, physical size, power consumption). Such devices must have a security function, that is confidentiality, integrity and access control, for provision of privacy even with a home networking environment. The information appliances shall move around the global network with the users. We assume these devices are used in the home and we describe the methodologies to achieve access control using Kerberos and to deal with changes of IP addresses using modified Kerberos. IPv6 has a security mechanism called \"IPsec\" for secure communication. In order to use the IPsec, peering communicating devices have to share a symmetric key to maintain the confidentiality and/or the integrity. We also describe a method so that these restricted devices can share a symmetric key securely.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115125847","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 overview of metadata for e-learning, focusing on the Gateway to Educational Materials and activities of the Dublin Core Education Working Group","authors":"N. Morgan","doi":"10.1109/SAINTW.2003.1210193","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210193","url":null,"abstract":"Summary form only given. Metadata for e-learning has existed for several years. Currently several widely implemented e-learning metadata standards exist including IEEE Learning Object Metadata (IEEE-LOM), SCORM, IMS, and GEM. The presentation will provide an overview of the major e-learning metadata initiatives, with a focus on the Gateway to Educational Materials, whose foundation is Dublin Core metadata, and the activities of the Dublin Core Education Working Group. GEM began in 1996 when the National Library of Education Task Force recommended using library and information science theory and technology to improve access to the large number of distributed collections of uncataloged education materials found on the Internet. GEM solved this resource discovery problem by extending and qualifying Dublin Core metadata so that it better describes education resources. GEM also developed many of the tools, such as a metadata generating and editing module and harvesting applications, needed to implement the project. Currently over 25,000 metadata records for GEM Consortium member resources are searchable through www.thegateway.org, providing educators with fast and efficient access to Internet-based educational resources. GEM metadata is also used by several organizations to organize and provide access to their education resources. GEM's research agenda includes metadata interoperability, registry services, OAI harvesting protocol, improving access to resources mapped to academic standards. Research partners included OCLC, Education Network Australia (EdNA), McREL, and the Center for Natural Language Processing at Syracuse University. GEM's next version of The Gateway will use RDF-XML metadata. GEM is sponsored by the U.S. Department of Education, and is located at the Information Institute of Syracuse at Syracuse University. In 1999, the Dublin Core Education Working Group was formed, with the objective to discuss and develop a proposal for the use of Dublin Core metadata in the description of education resources. The 2002-2003 workplan includes the development of an IEEE LTSC LOM and DCMI application profile, and vocabulary development.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116954695","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":"Degradation detection of wireless IP links based on local stationary binomial distribution models","authors":"Kazunori Matsumoto, S. Muramatsu, N. Inoue, H. Mori","doi":"10.1109/SAINTW.2003.1210176","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210176","url":null,"abstract":"A degradation detection problem of link quality in a long-distance 2.4 GHz wireless system is discussed. The time series to be monitored is periodic and non-stationary. The decision algorithm for degradation is difficult to define, and methods based on conventional traffic theory are not useful for IP link quality. Thus we should introduce some kind of intelligent data analysis technique. The authors propose to apply an AI-based method which solves a similar problem in a commercial switching telephone and ISDN network. The method partitions a target time-series into local stationary segments. Optimization of partitioning is based on the minimal Akaike (1974) information criterion principle. The technique called sequential probability ratio test is also applied to make efficient decisions about degradation. Thus experiments to apply our proposed method to this domain are conducted with wireless systems at a real field. The result shows the AI-based method is also effective for the degradation detection of wireless IP links.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125739442","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 video metadata application and its verification test using NIPEG-7 description and watermarked content ID","authors":"Yoichi Ishibashi, Shigehiko Watabe, M. Ito, T. Kogure, H. Hiki, Y. Tanno, Masaru Kawabata, H. Mishima, Chih-Chang Hsu, F. Hasegawa","doi":"10.1109/SAINTW.2003.1210194","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210194","url":null,"abstract":"Because of the rapid progress of broadband networks and the rise of digital broadcasting, there is a great demand for creation of an environment for digital content production and establishment of system for smooth content distribution. Yamagata Video Archive Research Center (YRC) has been involved in the development of technology for a large-scale video archive system and in research activities, through various verification tests, for applicable operation of the system. We adopt a MPEG-7 description scheme for constructing retrieval keywords in order to deal with video distribution and to achieve easy content retrieval for users outside of YRC In addition, we use a watermarked unique code (cid) system propounded by the Content ID Forum (CIDF) for managing the content identification number. A part of content ID is watermarked on video itself and a time code, which is extracted from an original tape, is watermarked for editing purposes to keep MPEG picture quality in an edited video stream. We describe the research through tests from content retrieval to content distribution.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125162880","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":"Metadata and new challenges","authors":"Ray S. Atarashi, J. Kishigami, S. Sugimoto","doi":"10.1109/SAINTW.2003.1210192","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210192","url":null,"abstract":"Metadata technologies and its standardizations have been developed in many fields such as library science, broadcasting, etc., and they are already in practical use. Content having metadata is easier to manage and discover resources than non-metadata contents. With the growth of the Internet, metadata has become a more important function in the efficient delivery of content to develop interoperability between each metadata set and associations with networks. We describe a few metadata-related activities. We also propose a metadata framework that will allow for the integration of metadata and networks.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114947280","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}