Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210194
Yoichi Ishibashi, Shigehiko Watabe, M. Ito, T. Kogure, H. Hiki, Y. Tanno, Masaru Kawabata, H. Mishima, Chih-Chang Hsu, F. Hasegawa
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.
随着宽带网络的快速发展和数字广播的兴起，对数字内容生产环境的创造和内容分发系统的建立有着巨大的需求。山形视频档案研究中心(YRC)参与了大规模视频档案系统的技术开发，并通过各种验证测试参与了该系统适用操作的研究活动。我们采用MPEG-7描述方案构建检索关键字，以处理视频分发，并使YRC以外的用户能够方便地检索内容。此外，我们使用了由内容标识论坛(content ID Forum, CIDF)提出的水印唯一码(cid)系统来管理内容标识号。视频本身的一部分内容ID被打上了水印，从原始磁带中提取的时间代码被打上了水印，用于编辑目的，以在编辑后的视频流中保持MPEG图像质量。我们通过测试描述了从内容检索到内容分发的研究。
{"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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210176
Kazunori Matsumoto, S. Muramatsu, N. Inoue, H. Mori
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.
{"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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210145
T. Chown
We present an overview of the IPv6 activities of European National Research and Education Networks, both within the individual national programmes and in joint studies undertaken within the GEANT Task Force for Next Generation Networks working group. The group has an international testbed activity (GTPv6) under which many IPv6 aspects have been studied, including routing, interoperability, DNS, multicast, registries and addressing, firewalls, transition and IPv6 applications. We present a summary of initiatives, including the m6bone multicast IPv6 network, a successful attempt at the IPv6 Land Speed Record, and the migration of two NRENs - SURFnet and Funet - to dual-stack IPv6 operation.
{"title":"IPv6 initiatives within the European National Research and Education Networks (NRENs)","authors":"T. Chown","doi":"10.1109/SAINTW.2003.1210145","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210145","url":null,"abstract":"We present an overview of the IPv6 activities of European National Research and Education Networks, both within the individual national programmes and in joint studies undertaken within the GEANT Task Force for Next Generation Networks working group. The group has an international testbed activity (GTPv6) under which many IPv6 aspects have been studied, including routing, interoperability, DNS, multicast, registries and addressing, firewalls, transition and IPv6 applications. We present a summary of initiatives, including the m6bone multicast IPv6 network, a successful attempt at the IPv6 Land Speed Record, and the migration of two NRENs - SURFnet and Funet - to dual-stack IPv6 operation.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"299 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":"133579915","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210126
M. Nishida, K. Okawa, J. Murai
This paper describes the design and implementation of a data dissemination application for the satellite Internet using uni-directional links. The satellite network is suitable for multicasting, and uni-directional link routing (UDLR) technology allows ease of construction. However the conventional data sharing method is uncongenial to a UDLR network because this network has many receivers on a flat satellite segment, and the return terrestrial link is narrow and cannot be shared. In order to solve these problems, we proposed an application for multicast data dissemination. It is based on NACK and receiver-initiative. All required parameters and requested data are sent out by a sender and a receiver receives data according only to a set of specific parameters sent by the sender. NACKs received by the sender within a time period which is configured by the receiver are distributed. We applied and evaluated this system on a satellite network.
{"title":"The design and implementation of data dissemination application using multicast over a satellite network","authors":"M. Nishida, K. Okawa, J. Murai","doi":"10.1109/SAINTW.2003.1210126","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210126","url":null,"abstract":"This paper describes the design and implementation of a data dissemination application for the satellite Internet using uni-directional links. The satellite network is suitable for multicasting, and uni-directional link routing (UDLR) technology allows ease of construction. However the conventional data sharing method is uncongenial to a UDLR network because this network has many receivers on a flat satellite segment, and the return terrestrial link is narrow and cannot be shared. In order to solve these problems, we proposed an application for multicast data dissemination. It is based on NACK and receiver-initiative. All required parameters and requested data are sent out by a sender and a receiver receives data according only to a set of specific parameters sent by the sender. NACKs received by the sender within a time period which is configured by the receiver are distributed. We applied and evaluated this system on a satellite network.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"32 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":"114580798","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210173
H. Wettig, Jussi Lahtinen, T. Lepola, P. Myllymäki, H. Tirri
In this paper we address the problem of analyzing Web log data collected at a typical online newspaper site. We propose a two-way clustering technique based on probability theory. On one hand the suggested method clusters the readers of the online newspaper into user groups of similar browsing behaviour where the clusters are determined solely based on the click streams collected. On the other hand, the articles of the newspaper are clustered based on the reading behaviour of the users. The two-way clustering produces statistical user and page profiles that can be analyzed by domain experts for content personalization. In addition, the produced model can also be used for on-line prediction so that given the user cluster of a person entering the site, and the page cluster of an article of a newspaper one can infer whether or not the user will have a look at the page in question.
{"title":"Bayesian analysis of online newspaper log data","authors":"H. Wettig, Jussi Lahtinen, T. Lepola, P. Myllymäki, H. Tirri","doi":"10.1109/SAINTW.2003.1210173","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210173","url":null,"abstract":"In this paper we address the problem of analyzing Web log data collected at a typical online newspaper site. We propose a two-way clustering technique based on probability theory. On one hand the suggested method clusters the readers of the online newspaper into user groups of similar browsing behaviour where the clusters are determined solely based on the click streams collected. On the other hand, the articles of the newspaper are clustered based on the reading behaviour of the users. The two-way clustering produces statistical user and page profiles that can be analyzed by domain experts for content personalization. In addition, the produced model can also be used for on-line prediction so that given the user cluster of a person entering the site, and the page cluster of an article of a newspaper one can infer whether or not the user will have a look at the page in question.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"63 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":"123485604","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210128
Shoko Mikawa, K. Okawa, J. Murai
This paper proposes a higher education distance learning system using video, audio, and character-based communications via the Internet, to sites where for various reasons, sufficient network infrastructure using cables and fibers cannot be installed. The aim of this research is to create a way of delivering a lecture to those for whom it would otherwise be inaccessible. We succeeded in building a distance learning system with sufficient of video and audio quality based on Internet technology using satellite communication.
{"title":"Establishment of a lecture environment using Internet technology via satellite communication in Asian countries","authors":"Shoko Mikawa, K. Okawa, J. Murai","doi":"10.1109/SAINTW.2003.1210128","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210128","url":null,"abstract":"This paper proposes a higher education distance learning system using video, audio, and character-based communications via the Internet, to sites where for various reasons, sufficient network infrastructure using cables and fibers cannot be installed. The aim of this research is to create a way of delivering a lecture to those for whom it would otherwise be inaccessible. We succeeded in building a distance learning system with sufficient of video and audio quality based on Internet technology using satellite communication.","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":"128986114","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210157
A. Matsumoto, K. Fujikawa, Y. Okabe, F. Teraoka, M. Kunishi, M. Ohta, M. Ishiyama
We extend the mobile network architecture protocol "LIN6", to support multihoming, and design a new application program interface (API) that enables an application to support multihoming. The LIN6's addressing architecture makes it possible to support what we call end-to-end multihoming without any inconsistency. In end-to-end multihoming, a fault-tolerant connection can be achieved relying not on routers but on the pair of end-nodes only. The new APIs make it easy to write an application that supports multihoming and robust connections. The extension to the LIN6 protocol and the new APIs give the capability of multihoming to the LIN6 protocol.
{"title":"Multihoming support based on mobile node protocol LIN6","authors":"A. Matsumoto, K. Fujikawa, Y. Okabe, F. Teraoka, M. Kunishi, M. Ohta, M. Ishiyama","doi":"10.1109/SAINTW.2003.1210157","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210157","url":null,"abstract":"We extend the mobile network architecture protocol \"LIN6\", to support multihoming, and design a new application program interface (API) that enables an application to support multihoming. The LIN6's addressing architecture makes it possible to support what we call end-to-end multihoming without any inconsistency. In end-to-end multihoming, a fault-tolerant connection can be achieved relying not on routers but on the pair of end-nodes only. The new APIs make it easy to write an application that supports multihoming and robust connections. The extension to the LIN6 protocol and the new APIs give the capability of multihoming to the LIN6 protocol.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"11 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":"125360972","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210163
Yasuhiro Ohara, Manav Bhatia, Osamu Nakamura, J. Murai
Route flap is an undesirable phenomenon in the Internet and needs to be eliminated for more stable and robust networks. We present our observations of such persistent route flaps on OSPF in some detail. We show how flaps adversely affect OSPF routing and communication environment in general through our experiments. The current OSPF's implicit timer damping function is found inefficient as each flap may lead to a few seconds of lost connectivity. We implemented a scheme for damping the route flaps and show as to how this methodology can solve such problems in OSPE. Our implementation shows considerable improvement over the ones where none of such techniques were applied.
{"title":"Route flapping effects on OSPF","authors":"Yasuhiro Ohara, Manav Bhatia, Osamu Nakamura, J. Murai","doi":"10.1109/SAINTW.2003.1210163","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210163","url":null,"abstract":"Route flap is an undesirable phenomenon in the Internet and needs to be eliminated for more stable and robust networks. We present our observations of such persistent route flaps on OSPF in some detail. We show how flaps adversely affect OSPF routing and communication environment in general through our experiments. The current OSPF's implicit timer damping function is found inefficient as each flap may lead to a few seconds of lost connectivity. We implemented a scheme for damping the route flaps and show as to how this methodology can solve such problems in OSPE. Our implementation shows considerable improvement over the ones where none of such techniques were applied.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"55 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":"126221419","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}
Pub Date : 2003-01-27DOI: 10.1109/SAINTW.2003.1210134
V. D. Antonellis, M. Melchiori, P. Plebani
This paper proposes a model for compatibility analysis to support Web Services substitution within cooperative processes. In order to properly take into account both the syntactic and the semantic issues, this model is based on the use of service descriptors and on a software tool environment to perform the semantic analysis of descriptors.
{"title":"An approach to Web Service compatibility in cooperative processes","authors":"V. D. Antonellis, M. Melchiori, P. Plebani","doi":"10.1109/SAINTW.2003.1210134","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210134","url":null,"abstract":"This paper proposes a model for compatibility analysis to support Web Services substitution within cooperative processes. In order to properly take into account both the syntactic and the semantic issues, this model is based on the use of service descriptors and on a software tool environment to perform the semantic analysis of descriptors.","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":"125582429","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}
Pub Date : 1900-01-01DOI: 10.1109/SAINTW.2003.1210115
The following topics are dealt with: satellite Internet technologies; service oriented architectures, frameworks and models; service interaction and collaboration; e-business; IPv6; authentication; wireless security; intrusion protection; and metadata.
{"title":"Proceedings 2003 Symposium on Applications and the Internet Workshops (SAINT 2003 Workshps)","authors":"","doi":"10.1109/SAINTW.2003.1210115","DOIUrl":"https://doi.org/10.1109/SAINTW.2003.1210115","url":null,"abstract":"The following topics are dealt with: satellite Internet technologies; service oriented architectures, frameworks and models; service interaction and collaboration; e-business; IPv6; authentication; wireless security; intrusion protection; and metadata.","PeriodicalId":131526,"journal":{"name":"2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121445663","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：