Pub Date : 2011-12-08DOI: 10.1109/ATNAC.2011.6096662
Ming Li, Longxiang Gao, Wanlei Zhou
In this paper we study the problem of routing in opportunistic wireless network, and propose a novel routing mechanism, message-aware routing (MAR). Using MAR, the messages can be prioritized at mobile nodes and the resources will be allocated accordingly. The MAR uses the message-aware socializing model to classify mobile nodes into different social groups. In MAR, nodes only maintain up-to-date routing information for the nodes in the same social group and the messages for the nodes in the same social group will have higher priority to be delivered. The MAR improves the routing efficiency in terms of reduced traffic and a higher delivery success rate. Further, MAR is constructed in decentralized way and does not require any centralized infrastructure. Experiments using NS2 simulator show that the MAR achieves higher delivery rate than the Epidemic and Prophet routing.
{"title":"MAR: Message-aware routing for opportunistic wireless ad hoc networks","authors":"Ming Li, Longxiang Gao, Wanlei Zhou","doi":"10.1109/ATNAC.2011.6096662","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096662","url":null,"abstract":"In this paper we study the problem of routing in opportunistic wireless network, and propose a novel routing mechanism, message-aware routing (MAR). Using MAR, the messages can be prioritized at mobile nodes and the resources will be allocated accordingly. The MAR uses the message-aware socializing model to classify mobile nodes into different social groups. In MAR, nodes only maintain up-to-date routing information for the nodes in the same social group and the messages for the nodes in the same social group will have higher priority to be delivered. The MAR improves the routing efficiency in terms of reduced traffic and a higher delivery success rate. Further, MAR is constructed in decentralized way and does not require any centralized infrastructure. Experiments using NS2 simulator show that the MAR achieves higher delivery rate than the Epidemic and Prophet routing.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134292155","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096654
S. Erfani, S. Rajasegarar, C. Leckie
An important challenge in network management and intrusion detection is the problem of data stream classification to identify new and abnormal traffic flows. An open research issue in this context is concept-evolution, which involves the emergence of a new class in the data stream. Most traditional data classification techniques are based on the assumption that the number of classes does not change over time. However, that is not the case in real world networks, and existing methods generally do not have the capability of identifying the evolution of a new class in the data stream. In this paper, we present a novel approach to the detection of novel classes in data streams that exhibit concept-evolution. In particular, our approach is able to improve both accuracy and computational efficiency by eliminating “noise” clusters in the analysis of concept evolution. Through an evaluation on simulated and benchmark data sets, we demonstrate that our approach achieves comparable accuracy to an existing scheme from the literature with a significant reduction in computational complexity.
{"title":"An efficient approach to detecting concept-evolution in network data streams","authors":"S. Erfani, S. Rajasegarar, C. Leckie","doi":"10.1109/ATNAC.2011.6096654","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096654","url":null,"abstract":"An important challenge in network management and intrusion detection is the problem of data stream classification to identify new and abnormal traffic flows. An open research issue in this context is concept-evolution, which involves the emergence of a new class in the data stream. Most traditional data classification techniques are based on the assumption that the number of classes does not change over time. However, that is not the case in real world networks, and existing methods generally do not have the capability of identifying the evolution of a new class in the data stream. In this paper, we present a novel approach to the detection of novel classes in data streams that exhibit concept-evolution. In particular, our approach is able to improve both accuracy and computational efficiency by eliminating “noise” clusters in the analysis of concept evolution. Through an evaluation on simulated and benchmark data sets, we demonstrate that our approach achieves comparable accuracy to an existing scheme from the literature with a significant reduction in computational complexity.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133497375","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096648
J. Jusak, R. Harris
Increasing demand for multimedia Internet applications today has shown progressive growth of the User Datagram Protocol (UDP) as the Internet transport protocol of choice for a large number of applications. However, its statistical characteristics and behaviour, specifically in terms of scaling-dependent properties are rarely studied. In this work, we firstly study the statistical characteristics of the UDP traces in terms of its long-range dependence properties as well as its marginal distribution. Secondly, based on the wavelet-based estimation method, we shall investigate the dependence structure of the wavelet coefficients in the light of the quasi-whitening concept, and lastly we shall consider a study for estimating the Hurst parameter (the degree of self-similarity) or the power law exponent for the long-range dependent processes that are present in the UDP Internet traffic. By analysing a large set of real traffic data taken from public repositories, it is evident that UDP Internet traffic reveals as long-range dependence with considerably high non-stationary processes and exhibits non-Gaussian marginal distributions. It is also interesting to see that analysis of the statistical properties of the wavelet coefficients shows that a reduction of the long dependence range to become short dependence range is impossible to be achieved by increasing the number of vanishing moments although it is done at a very coarse scale. Thus, it can be noticed that there is no significant difference on the performance of the Hurst parameter estimation for different numbers of vanishing moments for the mother wavelet.
{"title":"Study of UDP-based Internet traffic: Long-range dependence characteristics","authors":"J. Jusak, R. Harris","doi":"10.1109/ATNAC.2011.6096648","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096648","url":null,"abstract":"Increasing demand for multimedia Internet applications today has shown progressive growth of the User Datagram Protocol (UDP) as the Internet transport protocol of choice for a large number of applications. However, its statistical characteristics and behaviour, specifically in terms of scaling-dependent properties are rarely studied. In this work, we firstly study the statistical characteristics of the UDP traces in terms of its long-range dependence properties as well as its marginal distribution. Secondly, based on the wavelet-based estimation method, we shall investigate the dependence structure of the wavelet coefficients in the light of the quasi-whitening concept, and lastly we shall consider a study for estimating the Hurst parameter (the degree of self-similarity) or the power law exponent for the long-range dependent processes that are present in the UDP Internet traffic. By analysing a large set of real traffic data taken from public repositories, it is evident that UDP Internet traffic reveals as long-range dependence with considerably high non-stationary processes and exhibits non-Gaussian marginal distributions. It is also interesting to see that analysis of the statistical properties of the wavelet coefficients shows that a reduction of the long dependence range to become short dependence range is impossible to be achieved by increasing the number of vanishing moments although it is done at a very coarse scale. Thus, it can be noticed that there is no significant difference on the performance of the Hurst parameter estimation for different numbers of vanishing moments for the mother wavelet.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127470448","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096636
Hyung-Deug Bae, B. Ryu, N. Park
In this paper, we evaluate handover (HO) performance when user equipment (UE) moves between femto cell and macro cell in long term evolution (LTE) systems. The focus is on the HO performance for inbound and outbound mobility which corresponds to handoff between the femtocell and the macro cell. Due to the severe signal-to-interference noise ratio (SINR) degradation near the edge area of femtocell, HO triggering for inbound and outbound mobility needs to be carefully selected than that of the macro cell. Too late HO triggering leads to radio link failures (RLF), whereas too early HO triggering causes ping-pong HO. In this paper, we take the neighbouring cell configurations into account to keep the allowable RLF rate and low ping-pong rates. We propose a cell-types adaptive handover margins algorithm, which assigns different handover margins in line with neighbouring cell types. Simulation results indicate that the low ping-pong rate and the low RLF rate are achieved simultaneously by using the proposed algorithm.
{"title":"Analysis of handover failures in LTE femtocell systems","authors":"Hyung-Deug Bae, B. Ryu, N. Park","doi":"10.1109/ATNAC.2011.6096636","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096636","url":null,"abstract":"In this paper, we evaluate handover (HO) performance when user equipment (UE) moves between femto cell and macro cell in long term evolution (LTE) systems. The focus is on the HO performance for inbound and outbound mobility which corresponds to handoff between the femtocell and the macro cell. Due to the severe signal-to-interference noise ratio (SINR) degradation near the edge area of femtocell, HO triggering for inbound and outbound mobility needs to be carefully selected than that of the macro cell. Too late HO triggering leads to radio link failures (RLF), whereas too early HO triggering causes ping-pong HO. In this paper, we take the neighbouring cell configurations into account to keep the allowable RLF rate and low ping-pong rates. We propose a cell-types adaptive handover margins algorithm, which assigns different handover margins in line with neighbouring cell types. Simulation results indicate that the low ping-pong rate and the low RLF rate are achieved simultaneously by using the proposed algorithm.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129570343","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096661
Dong Xia, Q. Fu
IEEE 802.11 rate adaptation is a mechanism that adapts channel data rate in response to varying channel conditions. Rate adaptation has been considered a key component to achieve high performance. Indeed, many access points use rate adaptation as the default setting. However, how well rate adaptation performs in comparison with fixed rate has never been clearly identified. In this paper, we present an experimental study using commercial access points to compare the performance of rate adaptation and fixed rate in an IEEE 802.11g testbed. The comparison is conducted with various factors taken into account (e.g., UDP traffic, sending rate, power level, distance). The results show in many cases that fixed rate outperforms rate adaptation. Our findings raise questions regarding the suitability of the adopted rate adaptation algorithm in typical indoor environments and can provide useful information on the design of rate adaptation. Furthermore, our study indicates that it is not wise to simply ignore fixed rate. Fine selection of a fixed rate could be made to achieve desired performance.
{"title":"An experimental study on performance comparison of rate adaptation and fixed rate in IEEE 802.11g","authors":"Dong Xia, Q. Fu","doi":"10.1109/ATNAC.2011.6096661","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096661","url":null,"abstract":"IEEE 802.11 rate adaptation is a mechanism that adapts channel data rate in response to varying channel conditions. Rate adaptation has been considered a key component to achieve high performance. Indeed, many access points use rate adaptation as the default setting. However, how well rate adaptation performs in comparison with fixed rate has never been clearly identified. In this paper, we present an experimental study using commercial access points to compare the performance of rate adaptation and fixed rate in an IEEE 802.11g testbed. The comparison is conducted with various factors taken into account (e.g., UDP traffic, sending rate, power level, distance). The results show in many cases that fixed rate outperforms rate adaptation. Our findings raise questions regarding the suitability of the adopted rate adaptation algorithm in typical indoor environments and can provide useful information on the design of rate adaptation. Furthermore, our study indicates that it is not wise to simply ignore fixed rate. Fine selection of a fixed rate could be made to achieve desired performance.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126864017","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096665
Zakwan Al-Arnaout, Q. Fu, Marcus Frean
In this paper, we aim to address the problem of content replication and placement in Wireless Mesh Networks (WMNs). Our main contribution is to propose an innovative, distributed and scalable content replication and placement heuristic that places content at mesh routers to improve the network performance in terms of bandwidth consumption and latency perceived by mesh clients. We first introduce our proposed heuristic by presenting the effect of object replication at mesh routers on the performance of the WMNs. We then describe our proposed replica placement heuristic. Finally, we present our preliminary results on the performance of the proposed heuristic. The results show that the proposed heuristic can achieve a significant performance gain in terms of object access cost, throughput and latency.
{"title":"A novel distributed content replication and placement scheme for Wireless Mesh Networks","authors":"Zakwan Al-Arnaout, Q. Fu, Marcus Frean","doi":"10.1109/ATNAC.2011.6096665","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096665","url":null,"abstract":"In this paper, we aim to address the problem of content replication and placement in Wireless Mesh Networks (WMNs). Our main contribution is to propose an innovative, distributed and scalable content replication and placement heuristic that places content at mesh routers to improve the network performance in terms of bandwidth consumption and latency perceived by mesh clients. We first introduce our proposed heuristic by presenting the effect of object replication at mesh routers on the performance of the WMNs. We then describe our proposed replica placement heuristic. Finally, we present our preliminary results on the performance of the proposed heuristic. The results show that the proposed heuristic can achieve a significant performance gain in terms of object access cost, throughput and latency.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126430374","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096656
Yeong-Sheng Chen, M. Chuang, Fan-Chun Tseng, C. Ke
IEEE 802.11e standard is specified to support QoS (Quality of Service) in wireless local area networks for multimedia traffic such as real-time audio and video streaming. It proposes two wireless network access mechanisms to support QoS: HCF Controlled Channel Access (HCCA) and Enhanced Distributed Channel Access (EDCA). EDCA is a contention-based scheme. When the network size is increased, there will be more collisions and idle slots. Therefore, the performance will degrade a lot. To cope with this problem, this study proposed a High Performance Distributed Coordination Function with QoS support (QHDCF) protocol to enhance the performance. In QHDCF, the transmitting station determines the next transmitter according a selection rule from a probability formulation perspective based on the priorities and numbers of stations in different traffic classes. Since, in the proposed QHDCF, stations do not contend for channel access, transmission collisions are reduced a lot, and hence the network throughput is enhanced. Moreover, in EDCA, the high-priority traffic will always get the transmission opportunity and therefore low-priority traffic will suffer starvation. In contrast, in QHDCF, the high-priority traffic has better transmission opportunity on a probability base and hence does not starve the low-priority traffic. Simulation results show that the proposed QHDCF protocol outperform EDCA protocol in different packet sizes and number of stations.
{"title":"High Performance Distributed Coordination Function with QoS support in IEEE 802.11e networks","authors":"Yeong-Sheng Chen, M. Chuang, Fan-Chun Tseng, C. Ke","doi":"10.1109/ATNAC.2011.6096656","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096656","url":null,"abstract":"IEEE 802.11e standard is specified to support QoS (Quality of Service) in wireless local area networks for multimedia traffic such as real-time audio and video streaming. It proposes two wireless network access mechanisms to support QoS: HCF Controlled Channel Access (HCCA) and Enhanced Distributed Channel Access (EDCA). EDCA is a contention-based scheme. When the network size is increased, there will be more collisions and idle slots. Therefore, the performance will degrade a lot. To cope with this problem, this study proposed a High Performance Distributed Coordination Function with QoS support (QHDCF) protocol to enhance the performance. In QHDCF, the transmitting station determines the next transmitter according a selection rule from a probability formulation perspective based on the priorities and numbers of stations in different traffic classes. Since, in the proposed QHDCF, stations do not contend for channel access, transmission collisions are reduced a lot, and hence the network throughput is enhanced. Moreover, in EDCA, the high-priority traffic will always get the transmission opportunity and therefore low-priority traffic will suffer starvation. In contrast, in QHDCF, the high-priority traffic has better transmission opportunity on a probability base and hence does not starve the low-priority traffic. Simulation results show that the proposed QHDCF protocol outperform EDCA protocol in different packet sizes and number of stations.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125934453","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096657
W. Fritsche
Deploying appropriate security functionality in satellite networks is often necessary in order to allow their usage for certain sensitive scenarios. However, deploying security over satellite networks has specific issues caused either by the characteristic of the satellite link such as the long end-to-end delay and higher bit error rates, or by some other protocols typically and frequently used in satellite networks, such as Performance Enhancing Proxies (PEPs) or IP Multicast to name a few of them. This paper first outlines and analyses these security issues with broadband satellite communication, such as issues with PEPs and IPsec anti-replay protection. It then investigates and outlines solutions to this kind of issues, which are deployable today. Finally it points to some research topic in this area, which needs future work before becoming deployable.
{"title":"Solutions for securing broadband satellite communication","authors":"W. Fritsche","doi":"10.1109/ATNAC.2011.6096657","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096657","url":null,"abstract":"Deploying appropriate security functionality in satellite networks is often necessary in order to allow their usage for certain sensitive scenarios. However, deploying security over satellite networks has specific issues caused either by the characteristic of the satellite link such as the long end-to-end delay and higher bit error rates, or by some other protocols typically and frequently used in satellite networks, such as Performance Enhancing Proxies (PEPs) or IP Multicast to name a few of them. This paper first outlines and analyses these security issues with broadband satellite communication, such as issues with PEPs and IPsec anti-replay protection. It then investigates and outlines solutions to this kind of issues, which are deployable today. Finally it points to some research topic in this area, which needs future work before becoming deployable.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131458486","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096638
Alia Asheralieva, J. Khan, K. Mahata
With the arrival of LTE standard it is expected that the mobile voice services paradigm will shift from the circuit switched to fully packet switched mode supporting the VoIP services. VoIP services took quite a bit of time before they were accepted as the main stream telephony service in the fixed networks. To provided VoIP services over the LTE networks with appropriate QoS it is necessary to analyze the performance of such services on the LTE network and optimize the network parameters. This paper analyses the performance of VoIP services on the LTE network using the FD and the SMP packet scheduling techniques. This work identifies and analyzes the features of above LTE packet scheduling techniques to enhance the QoS of VoIP services. An OPNET based simulation model is used to analyse the performance of VoIP services on the LTE network by incorporating G.711 and G.723 speech coders. The work also studied the performance of VoIP services in variable transmission channel conditions.
{"title":"Performance analysis of VoIP services on the LTE network","authors":"Alia Asheralieva, J. Khan, K. Mahata","doi":"10.1109/ATNAC.2011.6096638","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096638","url":null,"abstract":"With the arrival of LTE standard it is expected that the mobile voice services paradigm will shift from the circuit switched to fully packet switched mode supporting the VoIP services. VoIP services took quite a bit of time before they were accepted as the main stream telephony service in the fixed networks. To provided VoIP services over the LTE networks with appropriate QoS it is necessary to analyze the performance of such services on the LTE network and optimize the network parameters. This paper analyses the performance of VoIP services on the LTE network using the FD and the SMP packet scheduling techniques. This work identifies and analyzes the features of above LTE packet scheduling techniques to enhance the QoS of VoIP services. An OPNET based simulation model is used to analyse the performance of VoIP services on the LTE network by incorporating G.711 and G.723 speech coders. The work also studied the performance of VoIP services in variable transmission channel conditions.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122829610","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096655
R. Jayasinghe, M. Gregory
The number of Point Of Interconnects (PoI) is a critical factor in the proposed Australian National Broadband Network (NBN) because there is a relationship to the Capital and Operational Expenditure. Initially a centralized model with 14 P0Is in 7 major cities was proposed and after a critical evaluation of the mode the Australian Competition and Consumer Commission proposed a decentralized option with more than 200 PoI. The two models are still being debated by the many stakeholders such as the Federal Government, service providers, backhaul access providers and the general public through the media. One of the NBN objectives is to promote innovative value added services to customers through enhanced competition amongst all service providers. The problem is to find the optimal number of PoI and their locations whilst minimizing cost and maintaining objectives. An analysis is provided in this paper of two potential traffic aggregation techniques: centralized and decentralized PoI models. A proof of concept model used to compare the two models is presented. Video streaming, Voice over Internet Protocol and File Transfer Protocol applications are used as broadband traffic and Weighted Fair Queuing was taken as the quality of service scheme.
{"title":"Incorporating Point of Interconnect within the Australian National Broadband Network","authors":"R. Jayasinghe, M. Gregory","doi":"10.1109/ATNAC.2011.6096655","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096655","url":null,"abstract":"The number of Point Of Interconnects (PoI) is a critical factor in the proposed Australian National Broadband Network (NBN) because there is a relationship to the Capital and Operational Expenditure. Initially a centralized model with 14 P0Is in 7 major cities was proposed and after a critical evaluation of the mode the Australian Competition and Consumer Commission proposed a decentralized option with more than 200 PoI. The two models are still being debated by the many stakeholders such as the Federal Government, service providers, backhaul access providers and the general public through the media. One of the NBN objectives is to promote innovative value added services to customers through enhanced competition amongst all service providers. The problem is to find the optimal number of PoI and their locations whilst minimizing cost and maintaining objectives. An analysis is provided in this paper of two potential traffic aggregation techniques: centralized and decentralized PoI models. A proof of concept model used to compare the two models is presented. Video streaming, Voice over Internet Protocol and File Transfer Protocol applications are used as broadband traffic and Weighted Fair Queuing was taken as the quality of service scheme.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126803947","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
扫码关注我们
求助内容：
应助结果提醒方式：