Pub Date : 2011-12-08DOI: 10.1109/ATNAC.2011.6096628
S. Alcock, R. Nelson
It has been assumed that the need for successful NAT traversal discourages residential DSL users from running services or applications that require them to accept connections from remote hosts. However, there are now numerous approaches for NAT traversal but there have been no studies measuring the prevalence of DSL users accepting inbound sessions. This paper presents an analysis of TCP and UDP flows initiated by remote clients to a group of residential DSL users, using packet traces captured from a New Zealand ISP between 2009 and 2011. Our analysis reveals that over half of all measured users accepted at least one inbound TCP or UDP session. There was no dominant port being used to accept sessions and port usage was spread over thousands of different ports. Skype and BitTorrent were the most popular application protocols observed and had increased in popularity over time. We also report on the use of dual SYNs to perform TCP NAT traversal in our data.
{"title":"Measuring and characterising inbound sessions in residential DSL traffic","authors":"S. Alcock, R. Nelson","doi":"10.1109/ATNAC.2011.6096628","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096628","url":null,"abstract":"It has been assumed that the need for successful NAT traversal discourages residential DSL users from running services or applications that require them to accept connections from remote hosts. However, there are now numerous approaches for NAT traversal but there have been no studies measuring the prevalence of DSL users accepting inbound sessions. This paper presents an analysis of TCP and UDP flows initiated by remote clients to a group of residential DSL users, using packet traces captured from a New Zealand ISP between 2009 and 2011. Our analysis reveals that over half of all measured users accepted at least one inbound TCP or UDP session. There was no dominant port being used to accept sessions and port usage was spread over thousands of different ports. Skype and BitTorrent were the most popular application protocols observed and had increased in popularity over time. We also report on the use of dual SYNs to perform TCP NAT traversal in our data.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123052447","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.6096667
Abdelnour Aldraho, A. Kist
Energy efficiency has become an important focus in the context of networks as they are major energy users. For extended periods, resources consume energy, but are only lightly loaded. Dynamic Topologies is a concept where networks can adapt their topology to traffic load by disabling unused nodes and links. Previous work has demonstrated that such dynamic networks can reduce power consumption considerably. Traditional routing protocols are not suitable to implement such networks as rerouting would cause major disruptions to active traffic. This research project proposes a mechanism to alter network paths dynamically to enable changing topologies. It is based on Multi Protocol Label Switching (MPLS) methodology and proposes flow tracking to maintain transaction state. It causes minimal disruptions to active network connections. This paper discusses the underlying optimisation problem, proposes Dynamic Topologies using MPLS (DTM) and introduces simulation results that demonstrate the operation of the proposed scheme.
{"title":"Enabling Dynamic Topologies in communication networks","authors":"Abdelnour Aldraho, A. Kist","doi":"10.1109/ATNAC.2011.6096667","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096667","url":null,"abstract":"Energy efficiency has become an important focus in the context of networks as they are major energy users. For extended periods, resources consume energy, but are only lightly loaded. Dynamic Topologies is a concept where networks can adapt their topology to traffic load by disabling unused nodes and links. Previous work has demonstrated that such dynamic networks can reduce power consumption considerably. Traditional routing protocols are not suitable to implement such networks as rerouting would cause major disruptions to active traffic. This research project proposes a mechanism to alter network paths dynamically to enable changing topologies. It is based on Multi Protocol Label Switching (MPLS) methodology and proposes flow tracking to maintain transaction state. It causes minimal disruptions to active network connections. This paper discusses the underlying optimisation problem, proposes Dynamic Topologies using MPLS (DTM) and introduces simulation results that demonstrate the operation of the proposed scheme.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121105533","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.6096660
P. Sofotasios, S. Freear
This paper presents the formulation and derivation of the α-κ-µ Extreme distribution. This is a fading model that is distinct for its capability to account for the characterization of mobile radio propagation under non-linear severe fading conditions. This capability results from the remarkable flexibility offered by its parameters. Closed-form expressions for the envelope and power probability density and distribution functions are derived and their validity is justified through extensive comparisons with numerical results. Notably, the algebraic representation of the derived expressions is shown to be quite convenient both analytically and numerically. Based on this, they can be considered useful mathematical tools which can be efficiently utilized in numerous studies related to the analytic performance evaluation of digital communications over non-linear severe fading conditions.
{"title":"The α-κ-µ Extreme distribution: Characterizing non-linear severe fading conditions","authors":"P. Sofotasios, S. Freear","doi":"10.1109/ATNAC.2011.6096660","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096660","url":null,"abstract":"This paper presents the formulation and derivation of the α-κ-µ Extreme distribution. This is a fading model that is distinct for its capability to account for the characterization of mobile radio propagation under non-linear severe fading conditions. This capability results from the remarkable flexibility offered by its parameters. Closed-form expressions for the envelope and power probability density and distribution functions are derived and their validity is justified through extensive comparisons with numerical results. Notably, the algebraic representation of the derived expressions is shown to be quite convenient both analytically and numerically. Based on this, they can be considered useful mathematical tools which can be efficiently utilized in numerous studies related to the analytic performance evaluation of digital communications over non-linear severe fading conditions.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046479","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.6096632
R. Asgarnezhad, J. A. Torkestani
There is no physical backbone infrastructure in Wireless Sensor Networks and all nodes are energy constrained. A virtual backbone can be created by different algorithms to organize the node is a better way. A backbone is a subset of active nodes that are able to perform especial tasks and serve nodes which are not in the backbone. For stance, connected backbone nodes in networks can perform efficient routing and broadcasting. In this paper, we present and compare a classification of backbone formation algorithms. We survey different backbone formation algorithms.
{"title":"A survey on backbone formation algorithms for Wireless Sensor Networks: (A New Classification)","authors":"R. Asgarnezhad, J. A. Torkestani","doi":"10.1109/ATNAC.2011.6096632","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096632","url":null,"abstract":"There is no physical backbone infrastructure in Wireless Sensor Networks and all nodes are energy constrained. A virtual backbone can be created by different algorithms to organize the node is a better way. A backbone is a subset of active nodes that are able to perform especial tasks and serve nodes which are not in the backbone. For stance, connected backbone nodes in networks can perform efficient routing and broadcasting. In this paper, we present and compare a classification of backbone formation algorithms. We survey different backbone formation algorithms.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126437506","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.6096644
H. Chu, C. Cheung, Kin-Hon Ho, Ningzhi Wang
Conserving energy consumption in the Internet has attracted much attention in recent years. During the non-peak time in daily network operations, it is possible to put a subset of routers to sleep mode for energy conservation purposes without network performance deterioration. This paper proposes a practical green traffic engineering scheme called Greedy Green MPLS Traffic Engineering Scheme (GGMTES) to save energy in multi-protocol label switching (MPLS) networks. During the non-peak time, GGMTES arranges some routers into sleep mode to save energy and re-routes all traffic for load balancing with minimum re-configuration overhead. Our simulation results show that GGMTS can save up to 15% more energy than an existing approach without network performance deterioration.
{"title":"Green MPLS Traffic Engineering","authors":"H. Chu, C. Cheung, Kin-Hon Ho, Ningzhi Wang","doi":"10.1109/ATNAC.2011.6096644","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096644","url":null,"abstract":"Conserving energy consumption in the Internet has attracted much attention in recent years. During the non-peak time in daily network operations, it is possible to put a subset of routers to sleep mode for energy conservation purposes without network performance deterioration. This paper proposes a practical green traffic engineering scheme called Greedy Green MPLS Traffic Engineering Scheme (GGMTES) to save energy in multi-protocol label switching (MPLS) networks. During the non-peak time, GGMTES arranges some routers into sleep mode to save energy and re-routes all traffic for load balancing with minimum re-configuration overhead. Our simulation results show that GGMTS can save up to 15% more energy than an existing approach without network performance deterioration.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133355557","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.6096669
William Liu, H. Sirisena, K. Pawlikowski
To compensate for the neglected aspect of service resilience in current green networking studies, this paper proposes a new BlueGreen network design philosophy for rethinking and redesigning network protocols and architectures to satisfy the criteria of being simultaneously service resilient, energy efficient and eco-friendly. Next Generation Networks (NGNs) are required to satisfy both extremely high levels of service resilience by means of network survivability mechanisms such as over provisioning of diversity and backup network resources (i.e., Blue criteria), as well as minimizing consumption of energy by switching off unused network resources as much as possible (i.e., Green criteria). There is an inherent contradiction involved in satisfying both these Blue and Green perspectives simultaneously. We model this challenging problem as a global optimization problem, where the network's working and backup components, and their energy consumption are considered as a resource, and the utilization is minimized while guaranteeing the required degrees of service resilience. The case studies presented confirm that the BlueGreen approach shows promise for integrating service resilience and energy efficiency in core networks to achieve specified BlueGreen targets.
{"title":"Building dependable Next Generation Networks (NGNs): A new BlueGreen design philosophy","authors":"William Liu, H. Sirisena, K. Pawlikowski","doi":"10.1109/ATNAC.2011.6096669","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096669","url":null,"abstract":"To compensate for the neglected aspect of service resilience in current green networking studies, this paper proposes a new BlueGreen network design philosophy for rethinking and redesigning network protocols and architectures to satisfy the criteria of being simultaneously service resilient, energy efficient and eco-friendly. Next Generation Networks (NGNs) are required to satisfy both extremely high levels of service resilience by means of network survivability mechanisms such as over provisioning of diversity and backup network resources (i.e., Blue criteria), as well as minimizing consumption of energy by switching off unused network resources as much as possible (i.e., Green criteria). There is an inherent contradiction involved in satisfying both these Blue and Green perspectives simultaneously. We model this challenging problem as a global optimization problem, where the network's working and backup components, and their energy consumption are considered as a resource, and the utilization is minimized while guaranteeing the required degrees of service resilience. The case studies presented confirm that the BlueGreen approach shows promise for integrating service resilience and energy efficiency in core networks to achieve specified BlueGreen targets.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116830691","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.6096640
Smitha Shivshankar, Yaozhou Ma, A. Jamalipour
The exertion of adequate cooperation enforcement methods has been receiving booming attention during the last few years. With the emerging applications such as the P2P overlay network for file sharing, Mobile Ad Hoc Networks (MANETs) requiring nodes to forward packets on behalf of others, the emanating opportunistic networks and with the sprouting popularity of Mobile Social Networks, it is becoming important to maintain a well balanced cooperation among the users of the network. This paper contemplates some of the cooperation enforcement methods, providing a comprehensive comparison between the proposed schemes. The work also contributes towards the investigation of different models of cooperation enforcement systems and analyze why these systems cannot work from human perspective. The paper also discharges a beam to show how insights from economics, social science and game theory has been integrated to frame a cooperation enforcement model.
{"title":"A correlative study of cooperation enforcement mechanisms","authors":"Smitha Shivshankar, Yaozhou Ma, A. Jamalipour","doi":"10.1109/ATNAC.2011.6096640","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096640","url":null,"abstract":"The exertion of adequate cooperation enforcement methods has been receiving booming attention during the last few years. With the emerging applications such as the P2P overlay network for file sharing, Mobile Ad Hoc Networks (MANETs) requiring nodes to forward packets on behalf of others, the emanating opportunistic networks and with the sprouting popularity of Mobile Social Networks, it is becoming important to maintain a well balanced cooperation among the users of the network. This paper contemplates some of the cooperation enforcement methods, providing a comprehensive comparison between the proposed schemes. The work also contributes towards the investigation of different models of cooperation enforcement systems and analyze why these systems cannot work from human perspective. The paper also discharges a beam to show how insights from economics, social science and game theory has been integrated to frame a cooperation enforcement model.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127123359","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.6096634
Sankissa Jayasinghe
A potential application of ad hoc networks is their use by the military as tactical networks. Thus ad hoc networks will play an important role in future military networks. However, ad hoc networks are not without problems. One of these problems is that the routing protocols that have been designed for ad hoc networks assume bi directional links. This may not always be the case, and an ad hoc network may have uni directional links. This paper examines the performance of blacklisting, which is a routing protocol that has been designed for ad hoc networks with uni directional links. Computer simulation is used to ascertain the performance.
{"title":"The performance of blacklisting in ad hoc networks with unidirectional links","authors":"Sankissa Jayasinghe","doi":"10.1109/ATNAC.2011.6096634","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096634","url":null,"abstract":"A potential application of ad hoc networks is their use by the military as tactical networks. Thus ad hoc networks will play an important role in future military networks. However, ad hoc networks are not without problems. One of these problems is that the routing protocols that have been designed for ad hoc networks assume bi directional links. This may not always be the case, and an ad hoc network may have uni directional links. This paper examines the performance of blacklisting, which is a routing protocol that has been designed for ad hoc networks with uni directional links. Computer simulation is used to ascertain the performance.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116727294","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.6096639
M. Javed, J. Khan
In future, vehicular networks will play a crucial role in the development of intelligent road traffic systems. Vehicular network will enable cars to exchange crucial road traffic information among them as well as with the traffic signaling infrastructure. In an ad hoc vehicular network generally broadcasting technique is used to disseminate road traffic information. In an IEEE802.11p based vehicular network broadcasting technique could increase the contention level thus increasing information dissemination delay. In this paper we propose a geocasting packet transmission technique to transmit safety messages in a vehicular network which can significantly improve the QoS of a vehicular network. In this work OPNET based simulation models are used to analyze the performance of the proposed protocol. The proposed protocol performance is benchmarked against the standard packet broadcasting protocols proposed for vehicular networks.
{"title":"A geocasting technique in an IEEE802.11p based vehicular ad hoc network for road traffic management","authors":"M. Javed, J. Khan","doi":"10.1109/ATNAC.2011.6096639","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096639","url":null,"abstract":"In future, vehicular networks will play a crucial role in the development of intelligent road traffic systems. Vehicular network will enable cars to exchange crucial road traffic information among them as well as with the traffic signaling infrastructure. In an ad hoc vehicular network generally broadcasting technique is used to disseminate road traffic information. In an IEEE802.11p based vehicular network broadcasting technique could increase the contention level thus increasing information dissemination delay. In this paper we propose a geocasting packet transmission technique to transmit safety messages in a vehicular network which can significantly improve the QoS of a vehicular network. In this work OPNET based simulation models are used to analyze the performance of the proposed protocol. The proposed protocol performance is benchmarked against the standard packet broadcasting protocols proposed for vehicular networks.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122427523","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.6096672
M. I. Akram, A. Sheikh
This paper presents second order statistical properties of the mobile to mobile Nakagami Hoyt (Nakagami-q) channel model. The spatial-time correlation function, the power spectral density (PSD), level crossing rate (LCR) and the average fade duration (AFD) of the Nakagami Hoyt channel have been derived under the assumption that both the transmitter and receiver are non-stationary. Design of simulator using the Inverse Fast Fourier Transform (IFFT) based computation method has been applied for this model. The simulator and analytical results have been corroborated.
{"title":"On the second order statistical properties of Nakagami Hoyt mobile to mobile fading channel","authors":"M. I. Akram, A. Sheikh","doi":"10.1109/ATNAC.2011.6096672","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096672","url":null,"abstract":"This paper presents second order statistical properties of the mobile to mobile Nakagami Hoyt (Nakagami-q) channel model. The spatial-time correlation function, the power spectral density (PSD), level crossing rate (LCR) and the average fade duration (AFD) of the Nakagami Hoyt channel have been derived under the assumption that both the transmitter and receiver are non-stationary. Design of simulator using the Inverse Fast Fourier Transform (IFFT) based computation method has been applied for this model. The simulator and analytical results have been corroborated.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123842687","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
扫码关注我们
求助内容：
应助结果提醒方式：