Pub Date : 2003-04-09DOI: 10.1109/ICCT.2003.176878
J. Khoja, M. Al-Shalash, J. Bredow
Abstruct- In 3G wireless systems the volume of data traftie is expected to be larger on the forward link than the reverse link This is one of the main reasons that contribute to the forward link being the limiting link for the capacity of 3C CDMA systems, Many different algorithms interact in complex ways to affect the achieved capacity and define the system’s operation and coverage. This work studies the impact of system algorithms and their parameters, like maximum base station power, power partitioning between overhead and traffic, and connection blocking algorithms. It examines their effect on forward link performance (e.g. capacity, coverage, call blocking and dropout probabilities). A dynamic system simulator is used to examine how these algorithms, and their parameters affect the sytem capacity/coverage tradeoff. KqtwordMDMA; forward link; capaciv; coverage; 36
{"title":"Capacity and coverage management issues in the forward link of CDMA systems","authors":"J. Khoja, M. Al-Shalash, J. Bredow","doi":"10.1109/ICCT.2003.176878","DOIUrl":"https://doi.org/10.1109/ICCT.2003.176878","url":null,"abstract":"Abstruct- In 3G wireless systems the volume of data traftie is expected to be larger on the forward link than the reverse link This is one of the main reasons that contribute to the forward link being the limiting link for the capacity of 3C CDMA systems, Many different algorithms interact in complex ways to affect the achieved capacity and define the system’s operation and coverage. This work studies the impact of system algorithms and their parameters, like maximum base station power, power partitioning between overhead and traffic, and connection blocking algorithms. It examines their effect on forward link performance (e.g. capacity, coverage, call blocking and dropout probabilities). A dynamic system simulator is used to examine how these algorithms, and their parameters affect the sytem capacity/coverage tradeoff. KqtwordMDMA; forward link; capaciv; coverage; 36","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":"134007565","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.1209259
Tong Ye, Qingji Zeng, Zhizhong Zhang, Jie Yang, Guolong Zhu
Previous dynamic resource allocation method (separate path selection, SPS) for a survivable network is always separated into two steps, that is, determine a primary path first and then select a backup path for the primary path. In this paper we analyze the drawback of the traditional SPS technique and propose an efficient shared protection method called M/spl I.bar/SPS. Instead of rejecting an arrival call immediately when a backup lightpath for the optimal primary lightpath cannot be found, M/spl I.bar/SPS continue to try the sub-optimal one until a legal primary-backup pair can be selected. We apply M/spl I.bar/SPS to CERNET/spl I.bar/Like and NSFNET networks. Simulation results show that M/spl I.bar/SPS improves the network performance remarkably.
{"title":"An improved method for guaranteed shared protection in WDM optical networks","authors":"Tong Ye, Qingji Zeng, Zhizhong Zhang, Jie Yang, Guolong Zhu","doi":"10.1109/ICCT.2003.1209259","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209259","url":null,"abstract":"Previous dynamic resource allocation method (separate path selection, SPS) for a survivable network is always separated into two steps, that is, determine a primary path first and then select a backup path for the primary path. In this paper we analyze the drawback of the traditional SPS technique and propose an efficient shared protection method called M/spl I.bar/SPS. Instead of rejecting an arrival call immediately when a backup lightpath for the optimal primary lightpath cannot be found, M/spl I.bar/SPS continue to try the sub-optimal one until a legal primary-backup pair can be selected. We apply M/spl I.bar/SPS to CERNET/spl I.bar/Like and NSFNET networks. Simulation results show that M/spl I.bar/SPS improves the network performance remarkably.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"291 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":"132214402","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.1209772
Tao Xiaofeng, Shang Dan, Ni Li, Zhang Ping
For the third generation systems' low frequency efficiency and small system capacity, there should be greatly changed in physical techniques in fourth generation mobile communication systems while many advanced techniques suited for high bit rate, high frequency efficiency and large dynamic range, such as JT, STC, MIMO, OFDMA, distributed antenna, are taken into considerations. But besides physical techniques, basic network layer techniques, e.g., the constructions of cellular and the modes of handover, must be broken through in the fourth generation mobile communication systems. The group cell structure proposed in WTI is a novel cellular construction method, which is fit well for these new advanced physical techniques. And slide handover is also novel handover mode emphasized in this paper. According to the current research, the slide handover could improve the system capacity dynamically.
{"title":"Group cells and slide handover mode","authors":"Tao Xiaofeng, Shang Dan, Ni Li, Zhang Ping","doi":"10.1109/ICCT.2003.1209772","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209772","url":null,"abstract":"For the third generation systems' low frequency efficiency and small system capacity, there should be greatly changed in physical techniques in fourth generation mobile communication systems while many advanced techniques suited for high bit rate, high frequency efficiency and large dynamic range, such as JT, STC, MIMO, OFDMA, distributed antenna, are taken into considerations. But besides physical techniques, basic network layer techniques, e.g., the constructions of cellular and the modes of handover, must be broken through in the fourth generation mobile communication systems. The group cell structure proposed in WTI is a novel cellular construction method, which is fit well for these new advanced physical techniques. And slide handover is also novel handover mode emphasized in this paper. According to the current research, the slide handover could improve the system capacity dynamically.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"25 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":"132295416","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.1209663
Zhiming Yin, Jianying Xie, P. Lv
Power control is one of the major challenges in radio resource management in wireless CDMA networks. Traditional power control scheme mainly concerns real-time voice services in mobile communications systems. In this paper, we present a new utility function with pricing and propose an economic model using game theory for uplink power control for data services in wireless CDMA networks. Based on the model we propose a synchronous distributed power control algorithm. Numerical simulations are conducted to demonstrate the performance of the algorithm. We investigate the pricing factor on the performance of the system. The results show the performance of convergence of the algorithm is satisfactory.
{"title":"An economic model for power control in wireless CDMA data networks","authors":"Zhiming Yin, Jianying Xie, P. Lv","doi":"10.1109/ICCT.2003.1209663","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209663","url":null,"abstract":"Power control is one of the major challenges in radio resource management in wireless CDMA networks. Traditional power control scheme mainly concerns real-time voice services in mobile communications systems. In this paper, we present a new utility function with pricing and propose an economic model using game theory for uplink power control for data services in wireless CDMA networks. Based on the model we propose a synchronous distributed power control algorithm. Numerical simulations are conducted to demonstrate the performance of the algorithm. We investigate the pricing factor on the performance of the system. The results show the performance of convergence of the algorithm is satisfactory.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"48 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":"132350766","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.1209085
Zhen Chen, Zengji Liu, Z. Qiu
In this paper, we propose the C1-networks, including the complete C1-networks and the incomplete C1-networks, which evolved from the B-networks. The main difference between the complete C1-network and the B-network is their connecting pattern between the stages. The available MINs to date are almost all restricted by the port number in the power of 2. The C1-network is not under the control of this restriction, hence, good flexibility is obtained. In addition, the single-buffer performance model is developed and evaluated, and some results are given.
{"title":"The C1-networks: a scalable multistage interconnection network with backward links for deflecting routing","authors":"Zhen Chen, Zengji Liu, Z. Qiu","doi":"10.1109/ICCT.2003.1209085","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209085","url":null,"abstract":"In this paper, we propose the C1-networks, including the complete C1-networks and the incomplete C1-networks, which evolved from the B-networks. The main difference between the complete C1-network and the B-network is their connecting pattern between the stages. The available MINs to date are almost all restricted by the port number in the power of 2. The C1-network is not under the control of this restriction, hence, good flexibility is obtained. In addition, the single-buffer performance model is developed and evaluated, and some results are given.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"491 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":"133104701","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.1209105
Jinyang Shi, Yuehui Jin, Hui Huang, Dajiang Zhang
The stream control transmission protocol (SCTP) is a new general-purpose transport layer protocol developed by the IETF. Compared with TCP, SCTP has two distinct features: multi-homing and multi-stream. Our work investigates the SCTP performance in various network environments, and its availability for different applications. This paper proposes a SCTP multi-homing scheme as the transport layer solution for wireless multi-access networks, using GPRS for retransmission when WLAN connection is interfered, collided or congested. We also evaluate the transport protocol behaviors for e-commerce applications. Through the experiments based on the Linux kernel implementation, we find the SCTP scheme can provide better throughput and more robustness in wireless access networks.
{"title":"Experimental performance studies of SCTP in wireless access networks","authors":"Jinyang Shi, Yuehui Jin, Hui Huang, Dajiang Zhang","doi":"10.1109/ICCT.2003.1209105","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209105","url":null,"abstract":"The stream control transmission protocol (SCTP) is a new general-purpose transport layer protocol developed by the IETF. Compared with TCP, SCTP has two distinct features: multi-homing and multi-stream. Our work investigates the SCTP performance in various network environments, and its availability for different applications. This paper proposes a SCTP multi-homing scheme as the transport layer solution for wireless multi-access networks, using GPRS for retransmission when WLAN connection is interfered, collided or congested. We also evaluate the transport protocol behaviors for e-commerce applications. Through the experiments based on the Linux kernel implementation, we find the SCTP scheme can provide better throughput and more robustness in wireless access networks.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"34 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":"134095038","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.1209839
Zhang Zhiqiang, Qu Xuesong, Chen Ju, Shi Yaqing, Neng Luoming
After the management environments of multitechnology connection service are analyzed, the MCSMF based on workflow management is presented, which automates MCS management processes with flexibility and scalability. The implementation based CORBA is also given.
{"title":"An approach to the management of multitechnology connection service based on workflow management","authors":"Zhang Zhiqiang, Qu Xuesong, Chen Ju, Shi Yaqing, Neng Luoming","doi":"10.1109/ICCT.2003.1209839","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209839","url":null,"abstract":"After the management environments of multitechnology connection service are analyzed, the MCSMF based on workflow management is presented, which automates MCS management processes with flexibility and scalability. The implementation based CORBA is also given.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"1 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":"130329168","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.1209172
Wen Lian-sheng, Zuo Peng, Yan Yumei, W. Anbin, Cui Xianli, L. Guoming, Wu Jian, Lin Jin-tong
We present a new structure of packet switch for optical packet switching network based on optical time division multiplexing (OTDM); theoretical and experimental results indicate that it is a feasible method.
{"title":"A new packet switch for optical time slotted packet switching networks based on OTDM","authors":"Wen Lian-sheng, Zuo Peng, Yan Yumei, W. Anbin, Cui Xianli, L. Guoming, Wu Jian, Lin Jin-tong","doi":"10.1109/ICCT.2003.1209172","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209172","url":null,"abstract":"We present a new structure of packet switch for optical packet switching network based on optical time division multiplexing (OTDM); theoretical and experimental results indicate that it is a feasible method.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"133 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":"115785228","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}
Processing toward variable-length IP packets brings burden to high speed network node control, caching, management, etc. A popular solution uses a method similar to ATM segmentation and reassembly (SAR) in the non-ATM network node. In this paper, it is pointed out that the low-bandwidth usage of this method is not suitable for high speed network node realization. To reduce the redundant data rate (RDR) and improve packet switching rate, a new fixed-size processing method, merge and separate plus SAR (MAS+), in high speed network node is presented. In this new method, the packets larger than the fixed size are segmented. And, the computer simulations of RDR improvement and latency analysis of the new solution are also given in this paper.
{"title":"The merge and separate plus SAR method with QoS support in the high speed network node","authors":"Xiaodong Liu, Yuguo Dong, Julong Lan, Yunfei Guo, Jiangxing Wu","doi":"10.1109/ICCT.2003.1209117","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209117","url":null,"abstract":"Processing toward variable-length IP packets brings burden to high speed network node control, caching, management, etc. A popular solution uses a method similar to ATM segmentation and reassembly (SAR) in the non-ATM network node. In this paper, it is pointed out that the low-bandwidth usage of this method is not suitable for high speed network node realization. To reduce the redundant data rate (RDR) and improve packet switching rate, a new fixed-size processing method, merge and separate plus SAR (MAS+), in high speed network node is presented. In this new method, the packets larger than the fixed size are segmented. And, the computer simulations of RDR improvement and latency analysis of the new solution are also given in this paper.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"55 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":"115817625","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.1209890
Yan-Hai Shen, J. Liu
In this paper, a new coding architecture for digital video surveillance applications is proposed. By use of a series of application-oriented techniques, the developed architecture supports multiple video channels, has error-resilience and alarming functions, and leads to high compression ratio. It is also sensitive to moving objects and feasible for browsing. Simulation results show that the proposed algorithm is more suitable than MPEG-1 for the application of digital video surveillance.
{"title":"A novel coding architecture for digital video surveillance applications","authors":"Yan-Hai Shen, J. Liu","doi":"10.1109/ICCT.2003.1209890","DOIUrl":"https://doi.org/10.1109/ICCT.2003.1209890","url":null,"abstract":"In this paper, a new coding architecture for digital video surveillance applications is proposed. By use of a series of application-oriented techniques, the developed architecture supports multiple video channels, has error-resilience and alarming functions, and leads to high compression ratio. It is also sensitive to moving objects and feasible for browsing. Simulation results show that the proposed algorithm is more suitable than MPEG-1 for the application of digital video surveillance.","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":"115932923","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
扫码关注我们
求助内容：
应助结果提醒方式：