Pub Date : 2003-03-27DOI: 10.1109/AINA.2003.1193009
Zhen Chen, Zengji Liu, Z. Qiu
We propose a deadlock-free wormhole routing scheme called Zigzag routing for the pan-Mesh, which generalizes the mesh topology. Accordingly, we prove that only two virtual channels are needed for deadlock-freeness on every physical channel by using Zigzag routing.
{"title":"A deadlock-free wormhole routing scheme in the pan-Mesh","authors":"Zhen Chen, Zengji Liu, Z. Qiu","doi":"10.1109/AINA.2003.1193009","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193009","url":null,"abstract":"We propose a deadlock-free wormhole routing scheme called Zigzag routing for the pan-Mesh, which generalizes the mesh topology. Accordingly, we prove that only two virtual channels are needed for deadlock-freeness on every physical channel by using Zigzag routing.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126129653","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-03-27DOI: 10.1109/AINA.2003.1192947
Tsung-Chuan Huang, Chu-Sing Yang, Sheng-Wen Bai, Szu-Hsuan Wang
With the development of mobile devices, people can execute many applications on their personal devices. However, many limitations of the mobile devices, e.g., CPU, memory, power supply, etc., make them impossible to be completely the same as the desktop PCs. In this paper we present an integrated management architecture for thin-client purpose called Agent and Profile Management System (APMS). The users only need to download a simple service agent to their mobile device and install it, and then the service agent will connect to the corresponding service provider send a request to the back-end server After receiving the request, the back-end server will execute appropriate processes and return a response to the mobile device. Most of the procedures are accomplished on the server side. Therefore, the workload of mobile devices is relatively low and the cost of mobile devices can be effectively reduced.
{"title":"An Agent and Profile Management System for mobile users and service providers","authors":"Tsung-Chuan Huang, Chu-Sing Yang, Sheng-Wen Bai, Szu-Hsuan Wang","doi":"10.1109/AINA.2003.1192947","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192947","url":null,"abstract":"With the development of mobile devices, people can execute many applications on their personal devices. However, many limitations of the mobile devices, e.g., CPU, memory, power supply, etc., make them impossible to be completely the same as the desktop PCs. In this paper we present an integrated management architecture for thin-client purpose called Agent and Profile Management System (APMS). The users only need to download a simple service agent to their mobile device and install it, and then the service agent will connect to the corresponding service provider send a request to the back-end server After receiving the request, the back-end server will execute appropriate processes and return a response to the mobile device. Most of the procedures are accomplished on the server side. Therefore, the workload of mobile devices is relatively low and the cost of mobile devices can be effectively reduced.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128171397","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-03-27DOI: 10.1109/AINA.2003.1192883
L. Junzhe, Z. Hailin, Liu Zengji
In OFDM (Orthogonal Frequency Division Multiplexing) system, if the length of its cyclic prefix is larger than the delay spread of channel, we can get a simple frequency equalizer to demodulate OFDM signal. However, the use of cyclic prefix degrades the efficiency of transmission greatly. So, we give a new equalizing structure, which improve the efficiency of transmission of OFDM system.
{"title":"A high efficiency equalization used in OFDM","authors":"L. Junzhe, Z. Hailin, Liu Zengji","doi":"10.1109/AINA.2003.1192883","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192883","url":null,"abstract":"In OFDM (Orthogonal Frequency Division Multiplexing) system, if the length of its cyclic prefix is larger than the delay spread of channel, we can get a simple frequency equalizer to demodulate OFDM signal. However, the use of cyclic prefix degrades the efficiency of transmission greatly. So, we give a new equalizing structure, which improve the efficiency of transmission of OFDM system.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124347562","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-03-27DOI: 10.1109/AINA.2003.1192839
C. Bouras, A. Sevasti
The increased need for quality of service (QoS) in today's networks has concentrated a lot of research and implementation efforts. Particular interest exists for the exploitation of the DiffServ framework towards the provision of qualitative services in MAN and WAN worldwide. Although individual mechanisms have been widely investigated, not many references to studies combining all levels of priority and QoS provisioning exist. This work aims at presenting a thorough and unified approach to the dimensioning and provisioning of a high priority service for high-quality demanding traffic over a MAN/WAN environment. Our approach anticipates for bounds in specific quality metrics and is demonstrated by the experimental case-study of a high-priority service over a MAN topology.
{"title":"Deployment of a DiffServ-based priority service in a MAN/WAN environment","authors":"C. Bouras, A. Sevasti","doi":"10.1109/AINA.2003.1192839","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192839","url":null,"abstract":"The increased need for quality of service (QoS) in today's networks has concentrated a lot of research and implementation efforts. Particular interest exists for the exploitation of the DiffServ framework towards the provision of qualitative services in MAN and WAN worldwide. Although individual mechanisms have been widely investigated, not many references to studies combining all levels of priority and QoS provisioning exist. This work aims at presenting a thorough and unified approach to the dimensioning and provisioning of a high priority service for high-quality demanding traffic over a MAN/WAN environment. Our approach anticipates for bounds in specific quality metrics and is demonstrated by the experimental case-study of a high-priority service over a MAN topology.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122165445","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-03-27DOI: 10.1109/AINA.2003.1192884
P. Yi, Yuguo Dong, Yuntao Li, Yunfei Guo
While several analytical studies of parallel packet switch (PPS) are presented, the findings publicized can not be considered final. In this paper, the necessary and sufficient conditions of the stability for parallel packet switch with bufferless input de-multiplexers are analyzed. We firstly introduce a reference switch and inventory theory, and based upon aggravating no congestion of the switch structure, a definition of PPS stability is proposed. Then the necessary and sufficient conditions of the stability for the PPS and algorithms for traffic dispatch are analyzed. The minimum of the PPS layers and speedup are also given.
{"title":"Stability analysis of the PPS with bufferless in input de-multiplexers","authors":"P. Yi, Yuguo Dong, Yuntao Li, Yunfei Guo","doi":"10.1109/AINA.2003.1192884","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192884","url":null,"abstract":"While several analytical studies of parallel packet switch (PPS) are presented, the findings publicized can not be considered final. In this paper, the necessary and sufficient conditions of the stability for parallel packet switch with bufferless input de-multiplexers are analyzed. We firstly introduce a reference switch and inventory theory, and based upon aggravating no congestion of the switch structure, a definition of PPS stability is proposed. Then the necessary and sufficient conditions of the stability for the PPS and algorithms for traffic dispatch are analyzed. The minimum of the PPS layers and speedup are also given.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123206228","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-03-27DOI: 10.1109/AINA.2003.1192938
Atsutoshi Imai, S. Yukita
In this paper we propose a new metadata type "relational metadata" that contains the relational information for retrieving Web contents. It is based on XML and using the ER (entity-relationship) model of the relational database (RDBMS). Relational metadata is compatible with resource description framework (RDF) through a translator program that can convert relational metadata to RDF. The goal of relational metadata is to provide the Web content creators with easy control over metadata and with automatic RDB integration. Using relational metadata, the user can search target information with RDB easily and efficiently. Its retrieval functions are easily customized according to the personal profile.
{"title":"RDF model and relational metadata","authors":"Atsutoshi Imai, S. Yukita","doi":"10.1109/AINA.2003.1192938","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192938","url":null,"abstract":"In this paper we propose a new metadata type \"relational metadata\" that contains the relational information for retrieving Web contents. It is based on XML and using the ER (entity-relationship) model of the relational database (RDBMS). Relational metadata is compatible with resource description framework (RDF) through a translator program that can convert relational metadata to RDF. The goal of relational metadata is to provide the Web content creators with easy control over metadata and with automatic RDB integration. Using relational metadata, the user can search target information with RDB easily and efficiently. Its retrieval functions are easily customized according to the personal profile.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131461587","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-03-27DOI: 10.1109/AINA.2003.1192944
Xiaofeng Chen, Fei Feng, Yumin Wang
XTR is a novel public key system based on a method to represent elements of a subgroup of a multiplicative group of a finite field. It integrates most of the advantages of RSA and ECC without any of their limitations. Recently, Lenstra et al. (2000) described an improved while conceptually more complicated method for XTR key representation and present two excellent formulas. In this paper, an original and fundamental method for XTR public key reduction is introduced. The formulas we present seem a little more complicated than those of Lenstra et al., however, the computation is almost the same as that of the previous method, which takes only a small number of operations in the finite field. Meanwhile, we present a fast algorithm for computing the trace, which can be used to construct XTR blind signature schemes.
{"title":"New key improvements and its application to XTR system","authors":"Xiaofeng Chen, Fei Feng, Yumin Wang","doi":"10.1109/AINA.2003.1192944","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192944","url":null,"abstract":"XTR is a novel public key system based on a method to represent elements of a subgroup of a multiplicative group of a finite field. It integrates most of the advantages of RSA and ECC without any of their limitations. Recently, Lenstra et al. (2000) described an improved while conceptually more complicated method for XTR key representation and present two excellent formulas. In this paper, an original and fundamental method for XTR public key reduction is introduced. The formulas we present seem a little more complicated than those of Lenstra et al., however, the computation is almost the same as that of the previous method, which takes only a small number of operations in the finite field. Meanwhile, we present a fast algorithm for computing the trace, which can be used to construct XTR blind signature schemes.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131270281","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-03-27DOI: 10.1109/AINA.2003.1192918
Z. Choukair
The set up of virtual bunches of telecommunication services seems to be a promising answer to the challenges in a competitive telecommunications environment. Those challenges are expected, in addition to the transportation of voice, data and video according to the expected quality, to boost new competitiveness factors: customization of bunches of services according to users' preferences and adding values to the service. This paper focuses upon dynamic composition of virtual bunches of services and the adjunction of behaviors to these services. The profiles and preferences of the users are also considered. This paper describes our CoCTelS (Composition and Customization of Telecommunication Services) model which provides a support for the clients to compose their own cocktail of telecommunication services and set up their own bouquet of services.
{"title":"Composition and customization of multimedia telecoms services","authors":"Z. Choukair","doi":"10.1109/AINA.2003.1192918","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192918","url":null,"abstract":"The set up of virtual bunches of telecommunication services seems to be a promising answer to the challenges in a competitive telecommunications environment. Those challenges are expected, in addition to the transportation of voice, data and video according to the expected quality, to boost new competitiveness factors: customization of bunches of services according to users' preferences and adding values to the service. This paper focuses upon dynamic composition of virtual bunches of services and the adjunction of behaviors to these services. The profiles and preferences of the users are also considered. This paper describes our CoCTelS (Composition and Customization of Telecommunication Services) model which provides a support for the clients to compose their own cocktail of telecommunication services and set up their own bouquet of services.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133935308","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-03-27DOI: 10.1109/AINA.2003.1192953
Juan Carlos Leonardo, Takaichi Yoshida, K. Oda
To enhance reliability of distributed systems, replication techniques are used. We propose an adaptable replication scheme that enables an object to adapt itself to provide a replicated service, and a replicated object to choose the replication strategy that best fits to achieve its requirements. What kind of replication strategy should be used depends on an execution environment as well as an application. The adaptable replication scheme permits replacement of down replicas, or change of the number of replicas when partial failures occur and chooses the most adequate consistency protocol for the current configuration. Clients to the recently adapted objects for replication should take actions that enables then to obtain a thorough service of the replicated object. The adaptable replication scheme is being designed as part of the Juice system. The Juice object model allows objects to change its behavior on the fly by replacing some components in a modular way.
{"title":"An adaptable replication scheme for reliable distributed object-oriented computing","authors":"Juan Carlos Leonardo, Takaichi Yoshida, K. Oda","doi":"10.1109/AINA.2003.1192953","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192953","url":null,"abstract":"To enhance reliability of distributed systems, replication techniques are used. We propose an adaptable replication scheme that enables an object to adapt itself to provide a replicated service, and a replicated object to choose the replication strategy that best fits to achieve its requirements. What kind of replication strategy should be used depends on an execution environment as well as an application. The adaptable replication scheme permits replacement of down replicas, or change of the number of replicas when partial failures occur and chooses the most adequate consistency protocol for the current configuration. Clients to the recently adapted objects for replication should take actions that enables then to obtain a thorough service of the replicated object. The adaptable replication scheme is being designed as part of the Juice system. The Juice object model allows objects to change its behavior on the fly by replacing some components in a modular way.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134073125","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-03-27DOI: 10.1109/AINA.2003.1192901
Jun Yang, Jiandong Li
Employing smart antennas in the central access point (CAP) of wireless Internet access networks is studied. A polling-based adaptive beamforming multiple access protocol (PB-ABFMA) is proposed. In PB-ABFMA, CAP requests the corresponding mobile terminal (MT) to transmit a training sequence just before the data packet transmission, so the temporal reference beamforming (TRB) can be performed by the smart antennas. CAP schedules packet transmissions based on polling mechanism and dynamic TDMA. CAP and MT transmit alternately. A mini-slot is used to keep connectivity when an MT is idle, therefore, the access delay is reduced. A simple and effective access method is proposed to guarantee rapid access of new arrival MT to the channel. Based on the "request-reply" traffic, which is the main traffic in the Internet, the theoretical analysis of channel utilization is presented. The mean turn around delay and performance of the proposed access method are evaluated by simulation. Results show that the proposed PB-ABFMA protocols effectively support the application of smart antennas and provide high channel utilization and low turn around delay.
{"title":"A novel multiple access protocol for wireless Internet access network with smart antennas","authors":"Jun Yang, Jiandong Li","doi":"10.1109/AINA.2003.1192901","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192901","url":null,"abstract":"Employing smart antennas in the central access point (CAP) of wireless Internet access networks is studied. A polling-based adaptive beamforming multiple access protocol (PB-ABFMA) is proposed. In PB-ABFMA, CAP requests the corresponding mobile terminal (MT) to transmit a training sequence just before the data packet transmission, so the temporal reference beamforming (TRB) can be performed by the smart antennas. CAP schedules packet transmissions based on polling mechanism and dynamic TDMA. CAP and MT transmit alternately. A mini-slot is used to keep connectivity when an MT is idle, therefore, the access delay is reduced. A simple and effective access method is proposed to guarantee rapid access of new arrival MT to the channel. Based on the \"request-reply\" traffic, which is the main traffic in the Internet, the theoretical analysis of channel utilization is presented. The mean turn around delay and performance of the proposed access method are evaluated by simulation. Results show that the proposed PB-ABFMA protocols effectively support the application of smart antennas and provide high channel utilization and low turn around delay.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133626689","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
扫码关注我们
求助内容：
应助结果提醒方式：