Pub Date : 2001-12-01DOI: 10.1109/GLOCOM.2001.966148
N. Matsuura, K. Yamakoshi, E. Oki, K. Nakai, N. Yamanaka, T. Ohyama, Y. Akahori
This paper describes a wavelength-division-multiplexing (WDM) optical switching technique that achieves 5-Tb/s switch throughput. This technique is employed in our previously described OPTically Interconnected Distributed Multi-stage Tb/s-ATM switching Network Architecture, called OPTIMA-2. This is a scalable and non-blocking 3-stage switch employing optical WDM and dynamic bandwidth sharing. An inter-stage, cell-based WDM switch is fabricated in combination with field programmable gate arrays (FPGAs) and 2.5-Gb/s 8-wavelength optical interconnection modules. Experimental results from a 5-Tb/s switching system are introduced.
{"title":"WDM optical switching to achieve 5 tb/s throughput","authors":"N. Matsuura, K. Yamakoshi, E. Oki, K. Nakai, N. Yamanaka, T. Ohyama, Y. Akahori","doi":"10.1109/GLOCOM.2001.966148","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966148","url":null,"abstract":"This paper describes a wavelength-division-multiplexing (WDM) optical switching technique that achieves 5-Tb/s switch throughput. This technique is employed in our previously described OPTically Interconnected Distributed Multi-stage Tb/s-ATM switching Network Architecture, called OPTIMA-2. This is a scalable and non-blocking 3-stage switch employing optical WDM and dynamic bandwidth sharing. An inter-stage, cell-based WDM switch is fabricated in combination with field programmable gate arrays (FPGAs) and 2.5-Gb/s 8-wavelength optical interconnection modules. Experimental results from a 5-Tb/s switching system are introduced.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124822699","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.965907
N. Yamamoto, T. Ohtsuki
Infrared wireless communication and optical communication usually adopt on-off keying (OOK) and pulse position modulation (PPM). In this paper, we present iterative maximum a posteriori probability (MAP) decoding of Turbo coded OOK and Turbo coded binary PPM (BPPM). We show that the BER performances of both Turbo coded OOK and Turbo coded BPPM are almost identical and improved as the number of iterations is increased.
{"title":"Iterative MAP decoding of turbo coded OOK and turbo coded BPPM","authors":"N. Yamamoto, T. Ohtsuki","doi":"10.1109/GLOCOM.2001.965907","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965907","url":null,"abstract":"Infrared wireless communication and optical communication usually adopt on-off keying (OOK) and pulse position modulation (PPM). In this paper, we present iterative maximum a posteriori probability (MAP) decoding of Turbo coded OOK and Turbo coded binary PPM (BPPM). We show that the BER performances of both Turbo coded OOK and Turbo coded BPPM are almost identical and improved as the number of iterations is increased.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125184429","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.965825
T. Kitamura, M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase
We propose a scheduling algorithm for a WDM single-hop network. In the algorithm, the transmission of multicast packets with more destination address overlap is postponed in order to improve average packet delay and throughput. By prioritizing the transmission of multicast packets with less destination address overlap, our algorithm can decrease the number of data packets prevented from transmission by the other multicast packets with more destination address overlap and can reduce average packet delay. We compare, by computer simulation, the performance of the proposed scheduling algorithm with that of the conventional one with respect to average packet delay and throughput. As a result, it is shown that the proposed scheduling algorithm can improve average packet delay and throughput performance.
{"title":"A new partition scheduling algorithm by prioritizing the transmission of multicast packets with less destination address overlap in WDM single-hop networks","authors":"T. Kitamura, M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase","doi":"10.1109/GLOCOM.2001.965825","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965825","url":null,"abstract":"We propose a scheduling algorithm for a WDM single-hop network. In the algorithm, the transmission of multicast packets with more destination address overlap is postponed in order to improve average packet delay and throughput. By prioritizing the transmission of multicast packets with less destination address overlap, our algorithm can decrease the number of data packets prevented from transmission by the other multicast packets with more destination address overlap and can reduce average packet delay. We compare, by computer simulation, the performance of the proposed scheduling algorithm with that of the conventional one with respect to average packet delay and throughput. As a result, it is shown that the proposed scheduling algorithm can improve average packet delay and throughput performance.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126329888","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.966333
A. Stamoulis, N. Sidiropoulos, G. Giannakis
Fair queuing (FQ) algorithms, which have been proposed for QoS wireline-wireless networking, rely on the fundamental idea that the service rate allocated to user m is proportional to a positive weight /spl phi//sub m/. Targeting wireless data networks with a multicode CDMA-based physical layer, we develop FQ with time-varying weight assignments in order to minimize the queuing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying (i) constraints imposed by the underlying physical layer, and (ii) QoS requirements. Simulations illustrate the merits of our designs.
{"title":"Time-varying fair queuing scheduling for multicode CDMA based on dynamic programming","authors":"A. Stamoulis, N. Sidiropoulos, G. Giannakis","doi":"10.1109/GLOCOM.2001.966333","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966333","url":null,"abstract":"Fair queuing (FQ) algorithms, which have been proposed for QoS wireline-wireless networking, rely on the fundamental idea that the service rate allocated to user m is proportional to a positive weight /spl phi//sub m/. Targeting wireless data networks with a multicode CDMA-based physical layer, we develop FQ with time-varying weight assignments in order to minimize the queuing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying (i) constraints imposed by the underlying physical layer, and (ii) QoS requirements. Simulations illustrate the merits of our designs.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131554867","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.965818
Resit Sendag, Peng-fei Chuang, D. Du
This paper considers the problem of routing and wavelength assignment (RWA) in optical passive star networks with non-uniform traffic load. The problem can be considered as designing a logical topology over an optical passive star physical topology with a given non-uniform traffic. The approach uses the bipartite graphs and the concept of time and wavelength division multiplexing (TWDM) embedding process to discuss the problem. The non-uniformity of the traffic load makes the logical design computationally hard and requires heuristic algorithms. Then, a linear program can solve the routing. We present an algorithm for effectively assigning a limited number of wavelengths among the access nodes of a WDM multi-hop network, which are connected via a passive star topology. The RWA problem for such a network with non-uniform traffic load is discussed for the first time. The idea is based on reducing the maximum load on each wavelength by using more wavelengths available. The proposed algorithm is tested on several traffic models, and results are given to show the improvement in the performance of the network using our algorithm.
{"title":"Routing and wavelength assignment in optical passive star networks with non-uniform traffic load","authors":"Resit Sendag, Peng-fei Chuang, D. Du","doi":"10.1109/GLOCOM.2001.965818","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965818","url":null,"abstract":"This paper considers the problem of routing and wavelength assignment (RWA) in optical passive star networks with non-uniform traffic load. The problem can be considered as designing a logical topology over an optical passive star physical topology with a given non-uniform traffic. The approach uses the bipartite graphs and the concept of time and wavelength division multiplexing (TWDM) embedding process to discuss the problem. The non-uniformity of the traffic load makes the logical design computationally hard and requires heuristic algorithms. Then, a linear program can solve the routing. We present an algorithm for effectively assigning a limited number of wavelengths among the access nodes of a WDM multi-hop network, which are connected via a passive star topology. The RWA problem for such a network with non-uniform traffic load is discussed for the first time. The idea is based on reducing the maximum load on each wavelength by using more wavelengths available. The proposed algorithm is tested on several traffic models, and results are given to show the improvement in the performance of the network using our algorithm.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115683334","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.965207
Sumeetpal S. Singh, V. Krishnamurthy, H. Poor
This paper considers the call admission control problem for multi-service wireless CDMA cellular systems with buffering. The call admission problem is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR. By using recent results in large random matrices, the SIR constraints incorporate multi-class voice/data services and fading channels. We show that the optimal call admission policy can be computed via a linear programming based algorithm.
{"title":"Admission control for DS-CDMA systems with fading","authors":"Sumeetpal S. Singh, V. Krishnamurthy, H. Poor","doi":"10.1109/GLOCOM.2001.965207","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965207","url":null,"abstract":"This paper considers the call admission control problem for multi-service wireless CDMA cellular systems with buffering. The call admission problem is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR. By using recent results in large random matrices, the SIR constraints incorporate multi-class voice/data services and fading channels. We show that the optimal call admission policy can be computed via a linear programming based algorithm.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116945046","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.965964
D. Niculescu, B. Nath
Many ad hoc network protocols and applications assume the knowledge of geographic location of nodes. The absolute location of each networked node is an assumed fact by most sensor networks which can then present the sensed information on a geographical map. Finding location without the aid of GPS in each node of an ad hoc network is important in cases where GPS is either not accessible, or not practical to use due to power, form factor or line of sight conditions. Location would also enable routing in sufficiently isotropic large networks, without the use of large routing tables. We are proposing APS - a distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate location for all nodes in a network where only a limited fraction of nodes have self location capability.
{"title":"Ad hoc positioning system (APS)","authors":"D. Niculescu, B. Nath","doi":"10.1109/GLOCOM.2001.965964","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965964","url":null,"abstract":"Many ad hoc network protocols and applications assume the knowledge of geographic location of nodes. The absolute location of each networked node is an assumed fact by most sensor networks which can then present the sensed information on a geographical map. Finding location without the aid of GPS in each node of an ad hoc network is important in cases where GPS is either not accessible, or not practical to use due to power, form factor or line of sight conditions. Location would also enable routing in sufficiently isotropic large networks, without the use of large routing tables. We are proposing APS - a distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate location for all nodes in a network where only a limited fraction of nodes have self location capability.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133627071","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.966377
M. Takahashi, Y. Komoriya, M. Bandai, I. Sasase, T. Arita
We propose a medium access protocol with token passing and retransmission by the hub station in the asynchronous transfer mode of Wireless 1394 in high data rate home network. In the proposed protocol, to improve the waiting time performance, the token passing is adopted. Moreover, when the data packets are received incorrectly because of the shadowing, the hub station transmits the corresponding data packets instead of transmitting from the same station to improve the recovery rate performance. By the performance evaluation using computer simulations, we show that the proposed protocol can improve the waiting time performance and the recovery rate performance comparing to the conventional Wireless 1394.
{"title":"A medium access control protocol with token passing and retransmission by the hub station in the asynchronous transfer mode of Wireless 1394","authors":"M. Takahashi, Y. Komoriya, M. Bandai, I. Sasase, T. Arita","doi":"10.1109/GLOCOM.2001.966377","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966377","url":null,"abstract":"We propose a medium access protocol with token passing and retransmission by the hub station in the asynchronous transfer mode of Wireless 1394 in high data rate home network. In the proposed protocol, to improve the waiting time performance, the token passing is adopted. Moreover, when the data packets are received incorrectly because of the shadowing, the hub station transmits the corresponding data packets instead of transmitting from the same station to improve the recovery rate performance. By the performance evaluation using computer simulations, we show that the proposed protocol can improve the waiting time performance and the recovery rate performance comparing to the conventional Wireless 1394.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124417073","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.965079
K. Kamakura, I. Sasase
We propose an embedded transmission method using pulse position modulation (PPM) signaling with symmetric error correcting codes for optical code division multiple access (CDMA). In the method, 2/sup J/ slots of 2/sup J/-ary PPM signaling are embedded in a user's signature sequence with 2/sup J/ weighted positions. Therefore, the proposed method increases the number of bits per signature sequence. This increase in the number of transmission bits allows us to adopt J error correcting codes without decreasing the information rate and expanding the system bandwidth. Consequently, the effect of multiaccess interference (MAI) is removed within the error correction capability. Considering the effect of MAI, we analyze the BER under Poisson photon counting process. Numerical results show that the proposed method has an advantage of good energy efficiency over the conventional PPM method in applying error correcting codes.
{"title":"An embedded transmission method of PPM signaling constructed of parallel error correcting codes for optical CDMA","authors":"K. Kamakura, I. Sasase","doi":"10.1109/GLOCOM.2001.965079","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.965079","url":null,"abstract":"We propose an embedded transmission method using pulse position modulation (PPM) signaling with symmetric error correcting codes for optical code division multiple access (CDMA). In the method, 2/sup J/ slots of 2/sup J/-ary PPM signaling are embedded in a user's signature sequence with 2/sup J/ weighted positions. Therefore, the proposed method increases the number of bits per signature sequence. This increase in the number of transmission bits allows us to adopt J error correcting codes without decreasing the information rate and expanding the system bandwidth. Consequently, the effect of multiaccess interference (MAI) is removed within the error correction capability. Considering the effect of MAI, we analyze the BER under Poisson photon counting process. Numerical results show that the proposed method has an advantage of good energy efficiency over the conventional PPM method in applying error correcting codes.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133897729","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 : 2001-12-01DOI: 10.1109/GLOCOM.2001.966256
R. Rojas-Cessa, E. Oki, Hung-Hsiang Jonathan Chao
We propose a novel architecture, a combined input-crosspoint-output buffered (CIXOB-k, where k is the size of the crosspoint buffer) Switch. CIXOB-k architecture provides 100% throughput under uniform and unbalanced traffic. It also provides timing relaxation and scalability. CIXOB-k is based on a switch with combined input-crosspoint buffering (CIXB-k) and round-robin arbitration. CIXB-k has a better performance than a non-buffered crossbar that uses iSLIP arbitration scheme. CIXOB-k uses a small speedup to provide 100% throughput under unbalanced traffic. We analyze the effect of the crosspoint buffer size and the switch size under uniform and unbalanced traffic for CIXB-k. We also describe solutions for relaxing the crosspoint memory amount and scalability for a CIXOB-k switch with a large number of ports.
{"title":"CIXOB-k: combined input-crosspoint-output buffered packet switch","authors":"R. Rojas-Cessa, E. Oki, Hung-Hsiang Jonathan Chao","doi":"10.1109/GLOCOM.2001.966256","DOIUrl":"https://doi.org/10.1109/GLOCOM.2001.966256","url":null,"abstract":"We propose a novel architecture, a combined input-crosspoint-output buffered (CIXOB-k, where k is the size of the crosspoint buffer) Switch. CIXOB-k architecture provides 100% throughput under uniform and unbalanced traffic. It also provides timing relaxation and scalability. CIXOB-k is based on a switch with combined input-crosspoint buffering (CIXB-k) and round-robin arbitration. CIXB-k has a better performance than a non-buffered crossbar that uses iSLIP arbitration scheme. CIXOB-k uses a small speedup to provide 100% throughput under unbalanced traffic. We analyze the effect of the crosspoint buffer size and the switch size under uniform and unbalanced traffic for CIXB-k. We also describe solutions for relaxing the crosspoint memory amount and scalability for a CIXOB-k switch with a large number of ports.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124039851","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
扫码关注我们
求助内容：
应助结果提醒方式：