Pub Date : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963071
Longxin Lin
Multicast services can be provided either as a basic network service by IP multicast or as an application layer service called overlay multicast. How to build an efficient data delivery structure is the most critical problem for overlay multicast, which depends on a good routing algorithm. Many routing algorithms have been presented recent years. Some algorithms modeled overlay multicast's routing problem as a degree constrained spanning tree problem based on undirected completed graph, and some others were built on some special peer to peer routing protocols. However, detecting and obtaining a completed graph's all network state information needs consume expensive cost and restricts its scalability and sometime be impossible. On the contrary these routing algorithms built on p2p scheme are of good scalability but maybe fail in practical applications. This paper redefines the overlay multicast routing problem as to find a degree constrained sub-tree with minimum delay optimization for a general undirected connected graph not a completed graph. It is a NP-hard problem. A heuristic genetic algorithm for this problem is given and the simulation results verify its effectiveness.
{"title":"A heuristic overlay multicast routing algorithm for minimum delay optimization","authors":"Longxin Lin","doi":"10.1109/ICCCNT.2014.6963071","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963071","url":null,"abstract":"Multicast services can be provided either as a basic network service by IP multicast or as an application layer service called overlay multicast. How to build an efficient data delivery structure is the most critical problem for overlay multicast, which depends on a good routing algorithm. Many routing algorithms have been presented recent years. Some algorithms modeled overlay multicast's routing problem as a degree constrained spanning tree problem based on undirected completed graph, and some others were built on some special peer to peer routing protocols. However, detecting and obtaining a completed graph's all network state information needs consume expensive cost and restricts its scalability and sometime be impossible. On the contrary these routing algorithms built on p2p scheme are of good scalability but maybe fail in practical applications. This paper redefines the overlay multicast routing problem as to find a degree constrained sub-tree with minimum delay optimization for a general undirected connected graph not a completed graph. It is a NP-hard problem. A heuristic genetic algorithm for this problem is given and the simulation results verify its effectiveness.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134412601","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963076
L. U. Khan, M. I. Khattak, Naeem Khan, M. Shafi
Orthogonal Frequency Division Multiplexing (OFDM) is adopted widespread for wireless and wired communication systems because of its inherent feature of the spectral efficiency and robustness to channel impairments. The throughput deterioration of the OFDM system due to pilots can be reduced by minimizing the density of pilots. A novel Low Overhead Pilot Insertion (LPI) scheme is proposed for OFDM system over slow fading channels without compromising on the Bit Error Rate (BER) performance. Modified Minimum Mean Square Error (M-MMSE) estimator with low computational complexity based on LPI scheme is also proposed. The pilot overhead in LPI scheme is reduced to 51.56% as compared to block-type channel estimation for the same BER performance. The simulation time taken for computing the channel frequency response by M-MMSE estimator with the proposed LPI scheme is reduced to approximately 14.28 % as compared to MMSE estimator for block-type pilot arrangement.
{"title":"Low complexity MMSE estimator for OFDM systems over slow fading Rayleigh channels","authors":"L. U. Khan, M. I. Khattak, Naeem Khan, M. Shafi","doi":"10.1109/ICCCNT.2014.6963076","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963076","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is adopted widespread for wireless and wired communication systems because of its inherent feature of the spectral efficiency and robustness to channel impairments. The throughput deterioration of the OFDM system due to pilots can be reduced by minimizing the density of pilots. A novel Low Overhead Pilot Insertion (LPI) scheme is proposed for OFDM system over slow fading channels without compromising on the Bit Error Rate (BER) performance. Modified Minimum Mean Square Error (M-MMSE) estimator with low computational complexity based on LPI scheme is also proposed. The pilot overhead in LPI scheme is reduced to 51.56% as compared to block-type channel estimation for the same BER performance. The simulation time taken for computing the channel frequency response by M-MMSE estimator with the proposed LPI scheme is reduced to approximately 14.28 % as compared to MMSE estimator for block-type pilot arrangement.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132741700","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963135
K. A. Unnikrishna Menon, Achyuta Gungi, B. Hariharan
Underground Wireless Sensor Network (UWSN) is a newly emerging technology that is capable of replacing existing traditional wired connections. Research has proved that magnetic induction based communication performs better than electromagnetic wave communication, especially in the dynamic underground environment. Currently, data recorders are being used to collect the data from underground sensors. Data recorders have a few disadvantages such as the inability to produce data on time and the difficulty to deploy them. Many problems related to data recorders can be solved using UWSN's magnetic induction technique. One of the main challenges associated with the UWSN is the lack of efficient power transfer to underground sensors as the distance between the transmitter and the receiver coils increases. This paper introduces a unique technique where relay resonators are used between the transmitter and the receiver coils to increase the efficiency for charging sensors which are present underground. Experimental results that prove the presence of relay coils for efficient power transfer are presented.
{"title":"Efficient wireless power transfer using underground relay coils","authors":"K. A. Unnikrishna Menon, Achyuta Gungi, B. Hariharan","doi":"10.1109/ICCCNT.2014.6963135","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963135","url":null,"abstract":"Underground Wireless Sensor Network (UWSN) is a newly emerging technology that is capable of replacing existing traditional wired connections. Research has proved that magnetic induction based communication performs better than electromagnetic wave communication, especially in the dynamic underground environment. Currently, data recorders are being used to collect the data from underground sensors. Data recorders have a few disadvantages such as the inability to produce data on time and the difficulty to deploy them. Many problems related to data recorders can be solved using UWSN's magnetic induction technique. One of the main challenges associated with the UWSN is the lack of efficient power transfer to underground sensors as the distance between the transmitter and the receiver coils increases. This paper introduces a unique technique where relay resonators are used between the transmitter and the receiver coils to increase the efficiency for charging sensors which are present underground. Experimental results that prove the presence of relay coils for efficient power transfer are presented.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132261152","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963035
Premananda B S, U. B. V.
In mobile phones, perceived quality of speech signal deteriorates significantly in the presence of near-end/surrounding noise as it arrives at the near-end listener's ears. There is a need to improve the intelligibility and quality of the received speech signal in noisy environments by developing speech enhancement algorithms. Paper focuses on the impact of near-end noises on signal degradation. Gain adjustment process employing psychoacoustic has been adopted to improve the intelligibility and quality of the speech signal in the noisy environments by automatically enhancing the speech signals when the noise dominates. Intelligibility and quality of enhanced speech signal are measured using SII and PESQ. Experimental results show intelligibility and quality improvement of speech signal with the proposed method over the unprocessed far-end speech signal. Approach is more efficient in overcoming the degradation of speech signals in presence of near-end noise.
{"title":"Speech enhancement to overcome the effect of near-end noise in mobile phones using psychoacoustics","authors":"Premananda B S, U. B. V.","doi":"10.1109/ICCCNT.2014.6963035","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963035","url":null,"abstract":"In mobile phones, perceived quality of speech signal deteriorates significantly in the presence of near-end/surrounding noise as it arrives at the near-end listener's ears. There is a need to improve the intelligibility and quality of the received speech signal in noisy environments by developing speech enhancement algorithms. Paper focuses on the impact of near-end noises on signal degradation. Gain adjustment process employing psychoacoustic has been adopted to improve the intelligibility and quality of the speech signal in the noisy environments by automatically enhancing the speech signals when the noise dominates. Intelligibility and quality of enhanced speech signal are measured using SII and PESQ. Experimental results show intelligibility and quality improvement of speech signal with the proposed method over the unprocessed far-end speech signal. Approach is more efficient in overcoming the degradation of speech signals in presence of near-end noise.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133453075","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963006
Jin Bin, Zhang Jing, Zhiyong Yang
Motivated by image reconstruction, sparse representation based classification (SRC) and locality-constrained linear coding (LLC) have been shown to be effective methods for applications. In this paper, we propose a new dictionary learning and sparse representation approach. During sparse coding step, we incorporate locality on representation samples, which preserves local data structure, resulting in improved classification. In dictionary learning step, a `discriminative' sparse coding error criterion and an `optimal' classification performance criterion are added into the objective function for better discriminating power. Experimental results demonstrate that our algorithm outperforms many recently proposed sparse representation techniques for face and SAR recognition.
{"title":"Learning a discriminative dictionary for locality constrained coding and sparse representation","authors":"Jin Bin, Zhang Jing, Zhiyong Yang","doi":"10.1109/ICCCNT.2014.6963006","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963006","url":null,"abstract":"Motivated by image reconstruction, sparse representation based classification (SRC) and locality-constrained linear coding (LLC) have been shown to be effective methods for applications. In this paper, we propose a new dictionary learning and sparse representation approach. During sparse coding step, we incorporate locality on representation samples, which preserves local data structure, resulting in improved classification. In dictionary learning step, a `discriminative' sparse coding error criterion and an `optimal' classification performance criterion are added into the objective function for better discriminating power. Experimental results demonstrate that our algorithm outperforms many recently proposed sparse representation techniques for face and SAR recognition.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130165458","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963075
Shuo Shi, Jiliang Chen, Xuemai Gu
We propose an optimal Combined Greedy-Face routing based on local link quality (CGF-LQ) in ad hoc wireless networks. Since it is expensive for wireless nodes to get the whole network topology information, geometric routing decisions should be made locally by nodes using location information of neighboring nodes. In this paper, we figure out the problem of Combined Greedy-Face (CGF) routing, then estimate the affection of distance between the relaying node and the sink node to the link quality according to radio propagation models. Basing on the findings, we propose a novel routing decision metric. Through experiment in the NS-2 simulator, we show advantages of the proposed routing algorithm over prior algorithms in several routing properties, including packet delivery ratio as well as hop count and routing overhead.
{"title":"CGF-LQ: An optimal Combined Greedy-Face routing based on local link quality","authors":"Shuo Shi, Jiliang Chen, Xuemai Gu","doi":"10.1109/ICCCNT.2014.6963075","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963075","url":null,"abstract":"We propose an optimal Combined Greedy-Face routing based on local link quality (CGF-LQ) in ad hoc wireless networks. Since it is expensive for wireless nodes to get the whole network topology information, geometric routing decisions should be made locally by nodes using location information of neighboring nodes. In this paper, we figure out the problem of Combined Greedy-Face (CGF) routing, then estimate the affection of distance between the relaying node and the sink node to the link quality according to radio propagation models. Basing on the findings, we propose a novel routing decision metric. Through experiment in the NS-2 simulator, we show advantages of the proposed routing algorithm over prior algorithms in several routing properties, including packet delivery ratio as well as hop count and routing overhead.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"23 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116375229","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}
In recent years, cloud computing is gradually evolving as a popular computing paradigm, which offers a uniform platform for service providers to publish their applications as cloud services. In many cases, however, single cloud service cannot satisfy a service request due to its simple functionality. Furthermore, current service composition systems have seldom taken into account user interests for personalized recommendation. In this paper, we propose a novel framework for personalized service recommendation in cloud computing platform by Web service composition and user modeling. The proposed framework first models cloud services together with a service request as a Web service composition problem, called cloud service recommendation (CSR) planning problem. It is fed into our self-developed service planner to compose a cloud service with complex business workflow. Second, our framework also applies user modeling for checking whether the generated composite cloud service can be matched with the interests of service consumer. To validate the feasibility of CSR framework, we have designed and implemented two prototype systems, QoS-aware service composition system and service platform based on user model.
{"title":"Service composition and user modeling for personalized recommendation in cloud computing","authors":"Guobing Zou, Yanglan Gan, Jianxing Zheng, Bofeng Zhang","doi":"10.1109/ICCCNT.2014.6963025","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963025","url":null,"abstract":"In recent years, cloud computing is gradually evolving as a popular computing paradigm, which offers a uniform platform for service providers to publish their applications as cloud services. In many cases, however, single cloud service cannot satisfy a service request due to its simple functionality. Furthermore, current service composition systems have seldom taken into account user interests for personalized recommendation. In this paper, we propose a novel framework for personalized service recommendation in cloud computing platform by Web service composition and user modeling. The proposed framework first models cloud services together with a service request as a Web service composition problem, called cloud service recommendation (CSR) planning problem. It is fed into our self-developed service planner to compose a cloud service with complex business workflow. Second, our framework also applies user modeling for checking whether the generated composite cloud service can be matched with the interests of service consumer. To validate the feasibility of CSR framework, we have designed and implemented two prototype systems, QoS-aware service composition system and service platform based on user model.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132216035","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963115
Mohamad Baseri, S. Motamedi, M. Maadani
IEEE 802.15.4 is a promising standard for MAC and physical layer of Wireless Sensor Networks. Recently, Wireless Sensor Network has developed into a highly used protocol to transmit multimedia data, such as voice, image and video. Since these data types have high volume, throughput and delay would be significant parameters in these networks. IEEE 802.15.4 supports only Star and Cluster Tree Topologies and does not support mesh topology in Beacon-Enable mode. In this paper, a Load-Adaptive Beacon Scheduling (LABS) approach is proposed to enable mesh topology over IEEE 802.15.4 Beacon-Enable mode. MeshMAC and BOP approaches have been proposed for scheduling of IEEE 802.15.4, but they do not consider throughput for supporting Quality of Service of multimedia data. Our work is inspired from MeshMAC, although LABS approach enhances throughput and alleviate end to end delay in high congested region in comparison with MeshMAC approaches. The proposed approach is simulated by NS-2 simulator which will confirm the results.
{"title":"A Load-Adaptive Beacon Scheduling algorithm for IEEE 802.15.4 mesh topology improving throughput and QoS in WMSNs","authors":"Mohamad Baseri, S. Motamedi, M. Maadani","doi":"10.1109/ICCCNT.2014.6963115","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963115","url":null,"abstract":"IEEE 802.15.4 is a promising standard for MAC and physical layer of Wireless Sensor Networks. Recently, Wireless Sensor Network has developed into a highly used protocol to transmit multimedia data, such as voice, image and video. Since these data types have high volume, throughput and delay would be significant parameters in these networks. IEEE 802.15.4 supports only Star and Cluster Tree Topologies and does not support mesh topology in Beacon-Enable mode. In this paper, a Load-Adaptive Beacon Scheduling (LABS) approach is proposed to enable mesh topology over IEEE 802.15.4 Beacon-Enable mode. MeshMAC and BOP approaches have been proposed for scheduling of IEEE 802.15.4, but they do not consider throughput for supporting Quality of Service of multimedia data. Our work is inspired from MeshMAC, although LABS approach enhances throughput and alleviate end to end delay in high congested region in comparison with MeshMAC approaches. The proposed approach is simulated by NS-2 simulator which will confirm the results.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132359699","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963125
Wu Haibing, C. Dong, L. Ping, Liang Mingxi, Y. Hongwei, Gao Haomin
With the wide application of WSN, the security issues are also increasingly taken seriously. When the WSN node communication it needs to verify the identity of the other party, the common approach is key authentication, how to ensure the security of the key distribution process is even more important. Based on the analysis of currently used key distribution algorithm, a new method is proposed based on the polynomial-based, time and identity-related key distribution, which using quaternion symmetric polynomial deployment time and node ID will be binding, and establish a shared key between nodes on the basis of this consultation mechanism. The safety and feasibility of the method are analyzed and verified, the simulation results show that the WSN key distribution method based PTPP can effectively prevent a replication node join to network behavior camouflage improve the security of key distribution.
{"title":"WSN key distribution method based on PTPP","authors":"Wu Haibing, C. Dong, L. Ping, Liang Mingxi, Y. Hongwei, Gao Haomin","doi":"10.1109/ICCCNT.2014.6963125","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963125","url":null,"abstract":"With the wide application of WSN, the security issues are also increasingly taken seriously. When the WSN node communication it needs to verify the identity of the other party, the common approach is key authentication, how to ensure the security of the key distribution process is even more important. Based on the analysis of currently used key distribution algorithm, a new method is proposed based on the polynomial-based, time and identity-related key distribution, which using quaternion symmetric polynomial deployment time and node ID will be binding, and establish a shared key between nodes on the basis of this consultation mechanism. The safety and feasibility of the method are analyzed and verified, the simulation results show that the WSN key distribution method based PTPP can effectively prevent a replication node join to network behavior camouflage improve the security of key distribution.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134023292","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 : 2014-07-11DOI: 10.1109/ICCCNT.2014.6963137
Sreekanth Sasidharan, Saurav Chandra
Software Defined Networking (SDN) brings-in a paradigm shift in the network design, management and control through its disruptive idea of separating the control plane out of the embedded switching systems. This allows better centralization as multiple network elements can be controlled by a single SDN controller. The network management is also expected to be more simplified as the network management system (NMS) can contact the SDN controller instead of multiple network elements. However, the traditional NMS has to undergo certain changes to achieve the above. Initial part of this paper focuses on those challenges and the approaches for mitigating them. Further, beyond the normal functionalities the current NMSs does, SDN opens up wide opportunities in terms of flexibility and programmability. The paper attempts to bring out those innovation possibilities as well. Finally, combining the current and future requirements, this paper defines the characteristics of a futuristic NMS over SDN. Attempt has also been made to weigh those characteristics and define an approach to place them on a functionality map.
{"title":"Defining future SDN based network management systems characterization and approach","authors":"Sreekanth Sasidharan, Saurav Chandra","doi":"10.1109/ICCCNT.2014.6963137","DOIUrl":"https://doi.org/10.1109/ICCCNT.2014.6963137","url":null,"abstract":"Software Defined Networking (SDN) brings-in a paradigm shift in the network design, management and control through its disruptive idea of separating the control plane out of the embedded switching systems. This allows better centralization as multiple network elements can be controlled by a single SDN controller. The network management is also expected to be more simplified as the network management system (NMS) can contact the SDN controller instead of multiple network elements. However, the traditional NMS has to undergo certain changes to achieve the above. Initial part of this paper focuses on those challenges and the approaches for mitigating them. Further, beyond the normal functionalities the current NMSs does, SDN opens up wide opportunities in terms of flexibility and programmability. The paper attempts to bring out those innovation possibilities as well. Finally, combining the current and future requirements, this paper defines the characteristics of a futuristic NMS over SDN. Attempt has also been made to weigh those characteristics and define an approach to place them on a functionality map.","PeriodicalId":140744,"journal":{"name":"Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132862849","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
扫码关注我们
求助内容：
应助结果提醒方式：