Pub Date : 2004-03-29DOI: 10.1504/IJHPCN.2005.009422
Y. M. Asem, A. Kara
In this paper, we propose a group rekeying method for changing the multicast group key: matrix-mask based group rekeying "MMGR". In MMGR, the group controller constructs the rekeying message using a numerical matrix and the group members apply secret bit masks on the matrix to get the group key. MMGR does not need computationally expensive encryption of the group key before transmission and hence eliminates the need to decrypt it after receiving the rekeying message. In MMGR, the computational cost for group rekeying is constant with respect to the number of group members up to the capacity of the matrix used, and the rekeying message construction and the group key retrieval processes require simple logical operations.
{"title":"A scalable group rekeying scheme using secret mask patterns","authors":"Y. M. Asem, A. Kara","doi":"10.1504/IJHPCN.2005.009422","DOIUrl":"https://doi.org/10.1504/IJHPCN.2005.009422","url":null,"abstract":"In this paper, we propose a group rekeying method for changing the multicast group key: matrix-mask based group rekeying \"MMGR\". In MMGR, the group controller constructs the rekeying message using a numerical matrix and the group members apply secret bit masks on the matrix to get the group key. MMGR does not need computationally expensive encryption of the group key before transmission and hence eliminates the need to decrypt it after receiving the rekeying message. In MMGR, the computational cost for group rekeying is constant with respect to the number of group members up to the capacity of the matrix used, and the rekeying message construction and the group key retrieval processes require simple logical operations.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124600882","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283786
K. Kalapriya, S. Nandy, K. V. Babu
Streaming live video over peers in the Internet is gaining popularity since it has the advantage of reducing the load on the server and enable the server to perform other specialized services more effectively. It also helps reduce the server bandwidth and is therefore no more a limiting factor for the number of clients served. We propose a architecture for 'streaming stored video' over peer-to-peer network. While a given peer continues to receive segments of the stream, simultaneously caching these segments locally renders this peer to inturn act as a source for other peers. These peers are highly transient in nature and the exit of a peer from the network results in loss of video segments. We overcome this in our architecture by exploiting the inherent redundancy of FEC encoding of video streams. Through simulations we establish the novelty of our architecture and show that our proposed solution incurs minimum overhead on the peers and does not increase the playback latency much more than the jitter buffer latency.
{"title":"Can streaming of stored playback video be supported on peer to peer infrastructure?","authors":"K. Kalapriya, S. Nandy, K. V. Babu","doi":"10.1109/AINA.2004.1283786","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283786","url":null,"abstract":"Streaming live video over peers in the Internet is gaining popularity since it has the advantage of reducing the load on the server and enable the server to perform other specialized services more effectively. It also helps reduce the server bandwidth and is therefore no more a limiting factor for the number of clients served. We propose a architecture for 'streaming stored video' over peer-to-peer network. While a given peer continues to receive segments of the stream, simultaneously caching these segments locally renders this peer to inturn act as a source for other peers. These peers are highly transient in nature and the exit of a peer from the network results in loss of video segments. We overcome this in our architecture by exploiting the inherent redundancy of FEC encoding of video streams. Through simulations we establish the novelty of our architecture and show that our proposed solution incurs minimum overhead on the peers and does not increase the playback latency much more than the jitter buffer latency.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120955193","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 : 2004-03-29DOI: 10.1142/S0219265904001179
Juan Li, S. Vuong
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some serious challenges. In this paper, we propose an efficient clustered super-peer P2P architecture (ECSP) to overcome the scalability and efficiency problems of existing unstructured P2P system. With ECSP, peers are grouped into clusters according to their topological proximity, and super-peers are selected from regular peers to act as cluster leaders and service providers. These super-peers are also connected to each other, forming a backbone overlay network operating as a distinct, yet integrated, application. To maintain the dynamically adaptive overlay network and to manage the routing on it, we propose an application level broadcasting protocol: Efa. Applying only a small amount of information about the topology of a network, Efa is as simple as flooding, a conventional method used in unstructured P2P systems. By eliminating many duplicated messages, Efa is much more efficient and scalable than flooding, and furthermore, it is completely decentralized and self-organized. Our experimental results prove that ESCP architecture, combined with the super-peer backbone protocol, can generate impressive levels of performance and scalability.
{"title":"An efficient clustered architecture for P2P networks","authors":"Juan Li, S. Vuong","doi":"10.1142/S0219265904001179","DOIUrl":"https://doi.org/10.1142/S0219265904001179","url":null,"abstract":"Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some serious challenges. In this paper, we propose an efficient clustered super-peer P2P architecture (ECSP) to overcome the scalability and efficiency problems of existing unstructured P2P system. With ECSP, peers are grouped into clusters according to their topological proximity, and super-peers are selected from regular peers to act as cluster leaders and service providers. These super-peers are also connected to each other, forming a backbone overlay network operating as a distinct, yet integrated, application. To maintain the dynamically adaptive overlay network and to manage the routing on it, we propose an application level broadcasting protocol: Efa. Applying only a small amount of information about the topology of a network, Efa is as simple as flooding, a conventional method used in unstructured P2P systems. By eliminating many duplicated messages, Efa is much more efficient and scalable than flooding, and furthermore, it is completely decentralized and self-organized. Our experimental results prove that ESCP architecture, combined with the super-peer backbone protocol, can generate impressive levels of performance and scalability.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120961122","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283929
Ching-Te Wang, Chu-Hsing Lin, Chinchen Chang
A key agreement protocol is utilized in a network system such that two users are able to establish a commonly shared secret key. Entities within the same security level can communicate securely with each other by using the session key. In this paper, we will propose an approach to solve the problem of supervising secure communication in a level-based hierarchy. In the proposed scheme, any two users with the same security level can efficiently establish a session key and both of them can apply it to encrypt (or decrypt) the communication messages. Accordingly, a user with higher security level can conveniently derive the session key and supervise the communication. The security of the proposed scheme is based on Diffie-Hellman's key agreement and RSA's scheme. To reveal the session key, a malicious user has to solve the factorization and the discrete logarithm problems.
{"title":"Supervising secret-key agreements in a level-based hierarchy","authors":"Ching-Te Wang, Chu-Hsing Lin, Chinchen Chang","doi":"10.1109/AINA.2004.1283929","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283929","url":null,"abstract":"A key agreement protocol is utilized in a network system such that two users are able to establish a commonly shared secret key. Entities within the same security level can communicate securely with each other by using the session key. In this paper, we will propose an approach to solve the problem of supervising secure communication in a level-based hierarchy. In the proposed scheme, any two users with the same security level can efficiently establish a session key and both of them can apply it to encrypt (or decrypt) the communication messages. Accordingly, a user with higher security level can conveniently derive the session key and supervise the communication. The security of the proposed scheme is based on Diffie-Hellman's key agreement and RSA's scheme. To reveal the session key, a malicious user has to solve the factorization and the discrete logarithm problems.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121047093","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283944
V. Paruchuri, A. Durresi, R. Kannan, S. Iyengar
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet making the defense against distributed denial of service attacks one of the hardest problems on the Internet today. Previous solutions for this problem try to traceback to the exact origin of the attack by requiring every router's participation. For many reasons this requirement is impractical and the victim ends up with an approximate location of the attacker. Reconstruction of the whole path is also very difficult owing to the sheer size of the Internet. This paper presents lightweight schemes for tracing back to the attack-originating AS instead to the exact origin itself. Once the attack-originating AS is determined, all further routers in the path to the attacker are within that AS and under the control of a single entity; which can presumably monitor local traffic in a more direct way than a generalized, Internet scale, packet marking scheme can. We also provide a scheme to prevent compromised routers from forging markings.
{"title":"Authenticated autonomous system traceback","authors":"V. Paruchuri, A. Durresi, R. Kannan, S. Iyengar","doi":"10.1109/AINA.2004.1283944","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283944","url":null,"abstract":"The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet making the defense against distributed denial of service attacks one of the hardest problems on the Internet today. Previous solutions for this problem try to traceback to the exact origin of the attack by requiring every router's participation. For many reasons this requirement is impractical and the victim ends up with an approximate location of the attacker. Reconstruction of the whole path is also very difficult owing to the sheer size of the Internet. This paper presents lightweight schemes for tracing back to the attack-originating AS instead to the exact origin itself. Once the attack-originating AS is determined, all further routers in the path to the attacker are within that AS and under the control of a single entity; which can presumably monitor local traffic in a more direct way than a generalized, Internet scale, packet marking scheme can. We also provide a scheme to prevent compromised routers from forging markings.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115603524","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283866
Masato Shiraishi, M. Yokota
Development of robots for practical use has brought the need for more-human friendly intelligent systems. Such an intelligent system should be equipped with a certain model of human mind in order to realize comprehensible communication with humans. Mental image directed semantic theory (MIDST) has proposed a methodology for integrated multimedia information understanding, for example, cross-media translation. This paper describes a multiagent model of human mind based on MIDST and its computer implementation.
{"title":"A multi-agent model of human mind based on mental image directed semantic theory for comprehensible communication between humans and robots","authors":"Masato Shiraishi, M. Yokota","doi":"10.1109/AINA.2004.1283866","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283866","url":null,"abstract":"Development of robots for practical use has brought the need for more-human friendly intelligent systems. Such an intelligent system should be equipped with a certain model of human mind in order to realize comprehensible communication with humans. Mental image directed semantic theory (MIDST) has proposed a methodology for integrated multimedia information understanding, for example, cross-media translation. This paper describes a multiagent model of human mind based on MIDST and its computer implementation.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115869254","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283893
M. Takizawa, H. Aida, M. Saito, Y. Tobe, H. Tokuda
This paper presents a novel effective scheme of configuring wireless personal area networks (WPANs), called master-driven connection control (MaCC). WPANs are based on a new wireless technology, which enables portable and mobile computing devices, and consumer electronic appliances to communicate with each other. Assuming that WPANs operate in a master-slave style, we exploit the information about master-slave relationships for identifying a network topology in an ad hoc fashion. Specifically, MaCC supports routing, providing the minimum-hop paths that cannot be obtained by flooding algorithms. In addition, it constructs the optimal topology on demand along the minimum-hop paths dynamically, because the performance of routing is dependent on network topologies. These functions need only a few control messages to achieve, and so can avoid excessive message propagation by flooding causing frame collisions in the WPANs. MaCC has several prominent features: self-direction of every node, adaptive formation of networks, and minimization of hop counts for routing control. In this paper, we describe the details of MaCC and analyze its overhead about initialization, routing discovery, and reconfiguration. The results show control messages propagated in a MaCC network at route discovery are reduced to less than one half of those in a network utilizing pure flooding.
{"title":"MaCC: supporting network formation and routing in wireless personal area networks","authors":"M. Takizawa, H. Aida, M. Saito, Y. Tobe, H. Tokuda","doi":"10.1109/AINA.2004.1283893","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283893","url":null,"abstract":"This paper presents a novel effective scheme of configuring wireless personal area networks (WPANs), called master-driven connection control (MaCC). WPANs are based on a new wireless technology, which enables portable and mobile computing devices, and consumer electronic appliances to communicate with each other. Assuming that WPANs operate in a master-slave style, we exploit the information about master-slave relationships for identifying a network topology in an ad hoc fashion. Specifically, MaCC supports routing, providing the minimum-hop paths that cannot be obtained by flooding algorithms. In addition, it constructs the optimal topology on demand along the minimum-hop paths dynamically, because the performance of routing is dependent on network topologies. These functions need only a few control messages to achieve, and so can avoid excessive message propagation by flooding causing frame collisions in the WPANs. MaCC has several prominent features: self-direction of every node, adaptive formation of networks, and minimization of hop counts for routing control. In this paper, we describe the details of MaCC and analyze its overhead about initialization, routing discovery, and reconfiguration. The results show control messages propagated in a MaCC network at route discovery are reduced to less than one half of those in a network utilizing pure flooding.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824991","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283759
S. Oikawa, K. Hashimoto, Y. Shibata
Recently many communication systems based on three dimensional spaces have been proposed. In those systems, in order to support many users in the same space, the QoS control function based on the distance between avatars has mainly been applied. For this reason, computing and network resources in the communication systems are wasted. We suggest a new QOS control to take account of a user's interest and status information in addition to the distance between avatars. Using this method, unnecessary communication and resources can be reduced and more useful communication can be attained with higher priority in the large communication space.
{"title":"QoS control function based on user's information on the 3D virtual shared space","authors":"S. Oikawa, K. Hashimoto, Y. Shibata","doi":"10.1109/AINA.2004.1283759","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283759","url":null,"abstract":"Recently many communication systems based on three dimensional spaces have been proposed. In those systems, in order to support many users in the same space, the QoS control function based on the distance between avatars has mainly been applied. For this reason, computing and network resources in the communication systems are wasted. We suggest a new QOS control to take account of a user's interest and status information in addition to the distance between avatars. Using this method, unnecessary communication and resources can be reduced and more useful communication can be attained with higher priority in the large communication space.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123755392","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283760
Hung-Huan Liu
Wireless mobile multimedia networks trend to adopt micro/picocellular architectures in order to earn higher spectral efficiency and support higher data rate than that of macrocellular systems. Using small cell size architecture results in an increase of call handoffs. The guard-channel strategies are adopted to reduce the force terminating probability of handoff calls. Meanwhile, in mobile multimedia networks, guard channels are also used to guarantee the QoS of data service. However, reserving too many guard channels, on the other hand, results in bandwidth inefficiency. The number of guard channels is reduced to increase the bandwidth utilization. We proposed that parts of voice guard channels share with data traffic but the voice traffic has higher priority in an integrated voice/data mobile network. This scheme keeps the QoS of both on the voice and data service and increase the bandwidth utilization.
{"title":"Guard channel sharing strategies in integrated voice/data mobile networks","authors":"Hung-Huan Liu","doi":"10.1109/AINA.2004.1283760","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283760","url":null,"abstract":"Wireless mobile multimedia networks trend to adopt micro/picocellular architectures in order to earn higher spectral efficiency and support higher data rate than that of macrocellular systems. Using small cell size architecture results in an increase of call handoffs. The guard-channel strategies are adopted to reduce the force terminating probability of handoff calls. Meanwhile, in mobile multimedia networks, guard channels are also used to guarantee the QoS of data service. However, reserving too many guard channels, on the other hand, results in bandwidth inefficiency. The number of guard channels is reduced to increase the bandwidth utilization. We proposed that parts of voice guard channels share with data traffic but the voice traffic has higher priority in an integrated voice/data mobile network. This scheme keeps the QoS of both on the voice and data service and increase the bandwidth utilization.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123176940","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283950
H. Suzuki, Runhe Huang
This paper presents a virtual real-time 3D objects sharing system. There are many potential applications that include housing design, car design, and computer art design. Moreover, it can be used for supporting distance education and training of young/junior designers. This paper describes functionality and implementation of the system with underlying considerations: avoiding the bottleneck network problem and avoiding collisions of operations shared objects.
{"title":"Virtual real-time 3D object sharing for supporting distance education and training","authors":"H. Suzuki, Runhe Huang","doi":"10.1109/AINA.2004.1283950","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283950","url":null,"abstract":"This paper presents a virtual real-time 3D objects sharing system. There are many potential applications that include housing design, car design, and computer art design. Moreover, it can be used for supporting distance education and training of young/junior designers. This paper describes functionality and implementation of the system with underlying considerations: avoiding the bottleneck network problem and avoiding collisions of operations shared objects.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124632259","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
扫码关注我们
求助内容：
应助结果提醒方式：