Pub Date : 2003-04-09DOI: 10.1109/ICCT.2003.1209042
Tiebing Xie, Yu Zhang, Jiming Gao, Ziqiang Hou
With the developments of broadband wireless techniques, one thing we can be sure is that multi access methods (e.g. GPRS, Bluetooth, IEEE 801.11) would coexist together in the access field in the future and IP could provide a simple unique platform for convergence of different techniques. Based on the analysis of different authentication methods (ppp, 802.x) now exist in this field, the paper proposes an IP carrier based authentication method which support smooth interaction between mobile terminals and access networks while roaming, and also provides the original model of the implementation based on ICMP/IP.
{"title":"A generic way for wireline and wireless access authentication","authors":"Tiebing Xie, Yu Zhang, Jiming Gao, Ziqiang Hou","doi":"10.1109/ICCT.2003.1209042","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209042","url":null,"abstract":"With the developments of broadband wireless techniques, one thing we can be sure is that multi access methods (e.g. GPRS, Bluetooth, IEEE 801.11) would coexist together in the access field in the future and IP could provide a simple unique platform for convergence of different techniques. Based on the analysis of different authentication methods (ppp, 802.x) now exist in this field, the paper proposes an IP carrier based authentication method which support smooth interaction between mobile terminals and access networks while roaming, and also provides the original model of the implementation based on ICMP/IP.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126532473","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-04-09DOI: 10.1109/ICCT.2003.1209786
Yaxin Cao, V. Li
In dealing with wireless link variability, adaptive scheduling and adaptive coding each has its own advantages and disadvantages. These two approaches were mostly used separately. Existing work on wireless scheduling usually uses a coarse two-stage link model and assumes perfect link knowledge, while work on adaptive coding ignores bandwidth sharing among users. In reality, multiple users with time-varying and location dependent links share the transmission bandwidth in a wireless network, and the two approaches need to be integrated to achieve better utilization and finer fairness granularity. In this paper, we design a simple scheme that combines the adaptive scheduling and coding mechanisms. The scheme is applicable to general multiple-state Markov link model and enables tradeoff between bandwidth utilization and fairness granularity. Link state estimation and prediction errors are accounted for in decision-making. We also show that the optimal solution for maximizing bandwidth utilization is a special case of the general schemes.
{"title":"Adaptive scheduling and coding for time-varying links","authors":"Yaxin Cao, V. Li","doi":"10.1109/ICCT.2003.1209786","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209786","url":null,"abstract":"In dealing with wireless link variability, adaptive scheduling and adaptive coding each has its own advantages and disadvantages. These two approaches were mostly used separately. Existing work on wireless scheduling usually uses a coarse two-stage link model and assumes perfect link knowledge, while work on adaptive coding ignores bandwidth sharing among users. In reality, multiple users with time-varying and location dependent links share the transmission bandwidth in a wireless network, and the two approaches need to be integrated to achieve better utilization and finer fairness granularity. In this paper, we design a simple scheme that combines the adaptive scheduling and coding mechanisms. The scheme is applicable to general multiple-state Markov link model and enables tradeoff between bandwidth utilization and fairness granularity. Link state estimation and prediction errors are accounted for in decision-making. We also show that the optimal solution for maximizing bandwidth utilization is a special case of the general schemes.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125247052","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-04-09DOI: 10.1109/ICCT.2003.1209061
Yijiao Yu, Qin Liu, L. Tan, Debao Xiao
In large computer network, isolation of the primary source of failure is a challenging task. In this paper, we present a novel approach of modeling network fault diagnosis. With the model based on reachable theorems, we design an automated fault identification algorithm and analyze its performance and validity named as DAFMA. To judge the consistency between the fault effect of the given failure sources and the testing one, an efficient algorithm is also proposed named as FFEAJ. DAFMA can be carried out automatically in computer because both DAFMA and FFEAJ are based on matrix and Boolean operations. Finally, to illustrate the details of DAFAM, four classical fault effects are classified and the working steps of DAFAM are described.
{"title":"A novel automated fault identification approach in computer networks based on graph theory","authors":"Yijiao Yu, Qin Liu, L. Tan, Debao Xiao","doi":"10.1109/ICCT.2003.1209061","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209061","url":null,"abstract":"In large computer network, isolation of the primary source of failure is a challenging task. In this paper, we present a novel approach of modeling network fault diagnosis. With the model based on reachable theorems, we design an automated fault identification algorithm and analyze its performance and validity named as DAFMA. To judge the consistency between the fault effect of the given failure sources and the testing one, an efficient algorithm is also proposed named as FFEAJ. DAFMA can be carried out automatically in computer because both DAFMA and FFEAJ are based on matrix and Boolean operations. Finally, to illustrate the details of DAFAM, four classical fault effects are classified and the working steps of DAFAM are described.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"26 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113959723","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-04-09DOI: 10.1109/ICCT.2003.1209725
Hong Liang, Weilin Wu
The design criteria for space-time codes under block fading channels are the rank criterion and the determinant criterion, which are widely cited in the literature. These criteria are not very tight under some circumstances. In this letter, we derive a tighter design criterion for space-time codes. Based on our criterion, we have found good space-time codes by computer search. The complexity of systematic search for good space-time codes is a big obstacle to get good codes. Using our new design criterion, the complexity of search is dropped down dramatically. Simulations show that our new codes have superior performance over the existing codes.
{"title":"Improved design criterion for good space-time trellis-codes under block fading channels","authors":"Hong Liang, Weilin Wu","doi":"10.1109/ICCT.2003.1209725","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209725","url":null,"abstract":"The design criteria for space-time codes under block fading channels are the rank criterion and the determinant criterion, which are widely cited in the literature. These criteria are not very tight under some circumstances. In this letter, we derive a tighter design criterion for space-time codes. Based on our criterion, we have found good space-time codes by computer search. The complexity of systematic search for good space-time codes is a big obstacle to get good codes. Using our new design criterion, the complexity of search is dropped down dramatically. Simulations show that our new codes have superior performance over the existing codes.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131949134","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-04-09DOI: 10.1109/ICCT.2003.1209090
Dzung Ho-Quang, Manseop Lee
In this paper, we propose a novel heuristic, routing and wavelength assignment algorithm (RWA), called congestion avoidance and lambda-run-based (CALR) algorithm, that offers very good performance in terms of blocking probability in WDM networks with limited-wavelength-converting capacity. Lightpaths for all connection requests in the network can be set up and released on-demand. The analytical and simulation results show that the proposed CALR algorithm ensures a much lower blocking probability than other previously proposed algorithms.
{"title":"A heuristic solution for high-performance lightpath set-up procedure in wavelength-routing optical networks","authors":"Dzung Ho-Quang, Manseop Lee","doi":"10.1109/ICCT.2003.1209090","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209090","url":null,"abstract":"In this paper, we propose a novel heuristic, routing and wavelength assignment algorithm (RWA), called congestion avoidance and lambda-run-based (CALR) algorithm, that offers very good performance in terms of blocking probability in WDM networks with limited-wavelength-converting capacity. Lightpaths for all connection requests in the network can be set up and released on-demand. The analytical and simulation results show that the proposed CALR algorithm ensures a much lower blocking probability than other previously proposed algorithms.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132393741","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-04-09DOI: 10.1109/ICCT.2003.1209882
Wei Yang, Shiming Li, Z. Tan
An improved direction of arrival (DOA) estimation algorithm with sensor gains and phase uncertainties for synchronous CDMA system with decorrelator is presented. Through decorrelating processing DOAs of the desired users can be estimated independently and all other resolved signal interferences are eliminated. Emphasis is directed to applications in which sensor gain and phrase are perturbed that are often happened actually. It is shown that improved DOA estimation can be achieved for decoupled signals by gain and phase pre-estimation procedures.
{"title":"An improved DOA estimation with sensor gain and phase perturbations for CDMA system","authors":"Wei Yang, Shiming Li, Z. Tan","doi":"10.1109/ICCT.2003.1209882","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209882","url":null,"abstract":"An improved direction of arrival (DOA) estimation algorithm with sensor gains and phase uncertainties for synchronous CDMA system with decorrelator is presented. Through decorrelating processing DOAs of the desired users can be estimated independently and all other resolved signal interferences are eliminated. Emphasis is directed to applications in which sensor gain and phrase are perturbed that are often happened actually. It is shown that improved DOA estimation can be achieved for decoupled signals by gain and phase pre-estimation procedures.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130108923","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-04-09DOI: 10.1109/ICCT.2003.1209113
Qi Wangdong, Chen Hua, Dong Min, Shen Qing-guo, C. Xiaoshu
Between the two broad categories of packet scheduling algorithms, round robin and time stamp based schemes, the former is usually not considered a proper candidate for providing QoS guarantees. In this paper, we challenge such conventional wisdom by comparing them with a new and more balanced perspective. Taking the scheduler and the provisioning condition of a link as a whole, it is shown by extensive simulations that RR algorithms with a little bandwidth overprovisioning can usually beat TS ones. Considering the prospect of bandwidth overprovisioning, it is likely that the simpler round robin algorithm turns out to be more economic for the purpose of providing practical QoS guarantees.
{"title":"The performance of scheduling algorithms, with a prospect of bandwidth overprovisioning","authors":"Qi Wangdong, Chen Hua, Dong Min, Shen Qing-guo, C. Xiaoshu","doi":"10.1109/ICCT.2003.1209113","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209113","url":null,"abstract":"Between the two broad categories of packet scheduling algorithms, round robin and time stamp based schemes, the former is usually not considered a proper candidate for providing QoS guarantees. In this paper, we challenge such conventional wisdom by comparing them with a new and more balanced perspective. Taking the scheduler and the provisioning condition of a link as a whole, it is shown by extensive simulations that RR algorithms with a little bandwidth overprovisioning can usually beat TS ones. Considering the prospect of bandwidth overprovisioning, it is likely that the simpler round robin algorithm turns out to be more economic for the purpose of providing practical QoS guarantees.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134424909","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-04-09DOI: 10.1109/ICCT.2003.1209897
Yongqing Yan, X. You
A novel pilot aided adaptive antenna array for reverse link of CDMA system is proposed in the paper. In this work, a sliding-window integrator is exploited to estimate channel parameters, and the weight of the antenna array is updated by using RLS algorithm in chip rate for tracing the channel variation fast. Theoretical analysis and computer simulation results show that this receiver has better receiving performance and faster convergence compared to the traditional symbol rate based algorithm under the Rayleigh fading environments.
{"title":"A chip-rate adaptive antenna array used on up-link of CDMA system","authors":"Yongqing Yan, X. You","doi":"10.1109/ICCT.2003.1209897","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209897","url":null,"abstract":"A novel pilot aided adaptive antenna array for reverse link of CDMA system is proposed in the paper. In this work, a sliding-window integrator is exploited to estimate channel parameters, and the weight of the antenna array is updated by using RLS algorithm in chip rate for tracing the channel variation fast. Theoretical analysis and computer simulation results show that this receiver has better receiving performance and faster convergence compared to the traditional symbol rate based algorithm under the Rayleigh fading environments.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131786013","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}
Peer-to-peer (P2P) networking technology is a currently emerging technology in the network research domain. The research of P2P network architecture is an important problem in the investigation of P2P network models are analyzed. Each of these two models has many problems itself, which makes it not a suitable solution for resource discovery in large peer based networks. By introducing the concepts of aggregation and hierarchical directory into the P2P network, a new type of P2P network model is proposed.
{"title":"Research of peer-to-peer network architecture","authors":"Zupeng Li, Daoying Huang, Zinrang Liu, Jianhua Huang","doi":"10.1109/ICCT.2003.1209091","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209091","url":null,"abstract":"Peer-to-peer (P2P) networking technology is a currently emerging technology in the network research domain. The research of P2P network architecture is an important problem in the investigation of P2P network models are analyzed. Each of these two models has many problems itself, which makes it not a suitable solution for resource discovery in large peer based networks. By introducing the concepts of aggregation and hierarchical directory into the P2P network, a new type of P2P network model is proposed.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132970167","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}
Optical burst switching (OBS) is regarded as one of the most promising solutions for the next generation backbone. Burst assembly in the edge nodes is an important issue to be addressed in OBS networks. In this paper, the impacts of burst assembly using different schemes on the Poisson traffic properties are investigated and simulated. The results are shown that the intervals of assembled burst arrivals are short dominant, but their service time distributions are much different from each other due to different assembly schemes. When the timer-based scheme is used, a normal-like distribution is obtained, while a long dominant one is obtained when threshold-based scheme is adopted. In addition, the product of the traffic load and time rate keeps invariable in both cases.
{"title":"The impacts of burst assembly on the traffic properties in optical burst switching networks","authors":"Jiangtao Luo, Qingji Zeng, Hao Chi, Zhizhong Zhang, Huandong Zhao","doi":"10.1109/ICCT.2003.1209131","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209131","url":null,"abstract":"Optical burst switching (OBS) is regarded as one of the most promising solutions for the next generation backbone. Burst assembly in the edge nodes is an important issue to be addressed in OBS networks. In this paper, the impacts of burst assembly using different schemes on the Poisson traffic properties are investigated and simulated. The results are shown that the intervals of assembled burst arrivals are short dominant, but their service time distributions are much different from each other due to different assembly schemes. When the timer-based scheme is used, a normal-like distribution is obtained, while a long dominant one is obtained when threshold-based scheme is adopted. In addition, the product of the traffic load and time rate keeps invariable in both cases.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130774345","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
扫码关注我们
求助内容：
应助结果提醒方式：