Pub Date : 2016-09-01DOI: 10.1109/ISTEL.2016.7881778
Lida Ghaemi Dizaji, A. Rahbar
Hybrid optical networks (HONs) are the combination of different switching mechanisms such as Optical Circuit Switching (OCS), Optical Burst Switching (OBS) and Optical Packet Switching (OPS). The basic idea behind HONs is to integrate the advantages of different switching mechanisms. HONs are classified into three classes as: (1) parallel hybrid optical networks, (2) integrated hybrid optical networks, (3) client-server hybrid optical networks. In this article, we describe these classes in detail and a new integrated hybrid optical network called EISM (Efficient Integration of Switching Mechanisms in all-optical networks) is introduced. The proposed EISM method could perform optimally while considering some implementation criteria; such criteria include network bandwidth utilization, implementation complexity and also the domain of network performance by combining four switching mechanisms-OCS, long-OBS, short-OBS and OPS.
{"title":"Efficient Integration of Switching Mechanisms in all-optical networks","authors":"Lida Ghaemi Dizaji, A. Rahbar","doi":"10.1109/ISTEL.2016.7881778","DOIUrl":"https://doi.org/10.1109/ISTEL.2016.7881778","url":null,"abstract":"Hybrid optical networks (HONs) are the combination of different switching mechanisms such as Optical Circuit Switching (OCS), Optical Burst Switching (OBS) and Optical Packet Switching (OPS). The basic idea behind HONs is to integrate the advantages of different switching mechanisms. HONs are classified into three classes as: (1) parallel hybrid optical networks, (2) integrated hybrid optical networks, (3) client-server hybrid optical networks. In this article, we describe these classes in detail and a new integrated hybrid optical network called EISM (Efficient Integration of Switching Mechanisms in all-optical networks) is introduced. The proposed EISM method could perform optimally while considering some implementation criteria; such criteria include network bandwidth utilization, implementation complexity and also the domain of network performance by combining four switching mechanisms-OCS, long-OBS, short-OBS and OPS.","PeriodicalId":212575,"journal":{"name":"International Symposium on Telecommunications","volume":"9 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114124265","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 : 1900-01-01DOI: 10.1109/ISTEL.2018.8661039
Amir Masoud Ahmadi Khoub, H. S. Sourck
One of the important applications of graph signal processing (GSP) in wireless sensor network (WSN) is reconstruction of the bandlimited graph signals from local measurements. The reconstruction may be performed by iterative algorithm. Graph partitioning plays an important role in the signal reconstruction using iterative algorithm. In this paper, we propose a new partitioning approach to improve the convergence rate of the signal reconstruction. The proposed partitioning method relaxes calculating the maximum bandwidth of graph signal to be reconstructed.
{"title":"Graph Partitioning for Iterative Signal Reconstruction in Wireless Sensor Network","authors":"Amir Masoud Ahmadi Khoub, H. S. Sourck","doi":"10.1109/ISTEL.2018.8661039","DOIUrl":"https://doi.org/10.1109/ISTEL.2018.8661039","url":null,"abstract":"One of the important applications of graph signal processing (GSP) in wireless sensor network (WSN) is reconstruction of the bandlimited graph signals from local measurements. The reconstruction may be performed by iterative algorithm. Graph partitioning plays an important role in the signal reconstruction using iterative algorithm. In this paper, we propose a new partitioning approach to improve the convergence rate of the signal reconstruction. The proposed partitioning method relaxes calculating the maximum bandwidth of graph signal to be reconstructed.","PeriodicalId":212575,"journal":{"name":"International Symposium on Telecommunications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123641871","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
扫码关注我们
求助内容：
应助结果提醒方式：