Pub Date : 2009-12-14DOI: 10.1109/ANTS.2009.5409891
L. Brewka, H. Wessing, L. Dittmann
Provisioning QoS within home networks becomes a common requirement. This paper evaluates one of the candidates for home network control and management protocol suites, namely UPnP. Using network modeling tools we identify highlights and drawbacks of UPnP QoS Architecture.
{"title":"Signaling performance of UPnP QoS Architecture","authors":"L. Brewka, H. Wessing, L. Dittmann","doi":"10.1109/ANTS.2009.5409891","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409891","url":null,"abstract":"Provisioning QoS within home networks becomes a common requirement. This paper evaluates one of the candidates for home network control and management protocol suites, namely UPnP. Using network modeling tools we identify highlights and drawbacks of UPnP QoS Architecture.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115365848","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409868
Abhishek Parakh, S. Kak
This paper presents a recursive computational multi-secret sharing technique that hides k − 2 secrets of size b each into n shares of a single secret S of size b, such that any k of the n shares suffice to recreate the secret S as well as all the hidden secrets. This may act as a steganographic channel to transmit hidden information or used for authentication and verification of shares and the secret itself. Further, such a recursive technique may be used as a computational secret sharing technique that has potential applications in secure and reliable storage of information on the Web, in sensor networks and information dispersal schemes. The presented technique, unlike previous computational techniques, does not require the use of any encryption key or storage of public information.
{"title":"Recursive secret sharing for distributed storage and information hiding","authors":"Abhishek Parakh, S. Kak","doi":"10.1109/ANTS.2009.5409868","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409868","url":null,"abstract":"This paper presents a recursive computational multi-secret sharing technique that hides k − 2 secrets of size b each into n shares of a single secret S of size b, such that any k of the n shares suffice to recreate the secret S as well as all the hidden secrets. This may act as a steganographic channel to transmit hidden information or used for authentication and verification of shares and the secret itself. Further, such a recursive technique may be used as a computational secret sharing technique that has potential applications in secure and reliable storage of information on the Web, in sensor networks and information dispersal schemes. The presented technique, unlike previous computational techniques, does not require the use of any encryption key or storage of public information.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639009","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409893
A. Alsarahn, A. Agarwal
In this paper we consider a cognitive wireless mesh network where unlicensed users (secondary users, SUs) can use the unused licensed spectrum allocated to primary users (PUs). Wireless mesh networks (WMNs) have emerged recently to improve internet access and other networking services. WMNs routers provide network access to the clients and other networking functions such as routing, and packet forwarding. Spectrum scarcity is the main challenge that limits the performance of WMNs. Although considerable research has been conducted on spectrum allocation, spectrum assignment is still considered an important open problem. This problem can be solved using cognitive radio technology that allows radios to intelligently locate free frequencies and assign them to users. In addition to consider quality of service (QoS) of users, our scheme uses several heuristics for allocating channels. These heuristics include channel error rate, PUs activities, channel capacity and channel switching time. Performance evaluation of the proposed scheme shows that the scheme is able to allocate the unused spectrum for SUs efficiently.
{"title":"Channel assignment in cognitive wireless mesh networks","authors":"A. Alsarahn, A. Agarwal","doi":"10.1109/ANTS.2009.5409893","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409893","url":null,"abstract":"In this paper we consider a cognitive wireless mesh network where unlicensed users (secondary users, SUs) can use the unused licensed spectrum allocated to primary users (PUs). Wireless mesh networks (WMNs) have emerged recently to improve internet access and other networking services. WMNs routers provide network access to the clients and other networking functions such as routing, and packet forwarding. Spectrum scarcity is the main challenge that limits the performance of WMNs. Although considerable research has been conducted on spectrum allocation, spectrum assignment is still considered an important open problem. This problem can be solved using cognitive radio technology that allows radios to intelligently locate free frequencies and assign them to users. In addition to consider quality of service (QoS) of users, our scheme uses several heuristics for allocating channels. These heuristics include channel error rate, PUs activities, channel capacity and channel switching time. Performance evaluation of the proposed scheme shows that the scheme is able to allocate the unused spectrum for SUs efficiently.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116609639","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409859
J. Sullivan, Paul Ramos, V. Vokkarane
One of TCP's primary objectives is to provide fairness to all flows competing for resources in a network. Since the popular flavors of TCP were designed to work with electronic packet-switched networks, they behave differently when used over optical burst-switched networks (OBS). In OBS, burst loss occurs due to random contention of data bursts. Since TCP is unaware of the underlying physical media, the responsibility of fairness must be provided by the burst assembler. We investigate several flow-aware and flow-unaware mechanisms that improve TCP fairness over OBS.
{"title":"Unfairness in TCP performance over lossy optical burst-switched (OBS) networks","authors":"J. Sullivan, Paul Ramos, V. Vokkarane","doi":"10.1109/ANTS.2009.5409859","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409859","url":null,"abstract":"One of TCP's primary objectives is to provide fairness to all flows competing for resources in a network. Since the popular flavors of TCP were designed to work with electronic packet-switched networks, they behave differently when used over optical burst-switched networks (OBS). In OBS, burst loss occurs due to random contention of data bursts. Since TCP is unaware of the underlying physical media, the responsibility of fairness must be provided by the burst assembler. We investigate several flow-aware and flow-unaware mechanisms that improve TCP fairness over OBS.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127895090","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409895
S. Agarwal, S. Agarwal
We use Twitter's real-time lists of popular Internet topics as a basis for predicting which Internet content will become popular in the near future. Our methods can be applied to optimize content delivery networks of the Internet via intelligent content pre-fetching and caching.
{"title":"Social networks as Internet barometers for optimizing content delivery networks","authors":"S. Agarwal, S. Agarwal","doi":"10.1109/ANTS.2009.5409895","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409895","url":null,"abstract":"We use Twitter's real-time lists of popular Internet topics as a basis for predicting which Internet content will become popular in the near future. Our methods can be applied to optimize content delivery networks of the Internet via intelligent content pre-fetching and caching.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125864902","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409876
N. Manohar, Arvind Kumar
Two-degree ROADM can be upgraded to next generation dynamically reconfigurable multi-degree OADM using an Nx1 Wavelength Select Switch (WSS). WSS enables routing of selected wavelengths from a (local) degree to N (remote) degrees. In a typical multi-degree configuration, WSS sitting on individual degrees are connected back-to-back. This paper describes the design of a new protocol to run over an out-of-band OSC like channel established between a pair of WSS modules. This protocol creates a control channel between local degree (East or West) and a remote degree and enables detection of human errors in physical fibre connections among WSS modules. Using proposed protocol WSS module can detect various types of misconnections and in-turn can raise alarms to inform user about the same. This paper briefly discusses design of this protocol. A four degree configuration (N=2) is chosen for the ease of illustration.
{"title":"Auto-detection of misconnected fibers in WSS based multi-degree ROADM","authors":"N. Manohar, Arvind Kumar","doi":"10.1109/ANTS.2009.5409876","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409876","url":null,"abstract":"Two-degree ROADM can be upgraded to next generation dynamically reconfigurable multi-degree OADM using an Nx1 Wavelength Select Switch (WSS). WSS enables routing of selected wavelengths from a (local) degree to N (remote) degrees. In a typical multi-degree configuration, WSS sitting on individual degrees are connected back-to-back. This paper describes the design of a new protocol to run over an out-of-band OSC like channel established between a pair of WSS modules. This protocol creates a control channel between local degree (East or West) and a remote degree and enables detection of human errors in physical fibre connections among WSS modules. Using proposed protocol WSS module can detect various types of misconnections and in-turn can raise alarms to inform user about the same. This paper briefly discusses design of this protocol. A four degree configuration (N=2) is chosen for the ease of illustration.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126992178","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409874
Georgios-Grigorios Mplemenos, P. Christou, I. Papaefstathiou
In this paper, a pioneering platform is introduced, which utilizes all the advantages of CPLDs in order to enhance the processing power of the sensor nodes and, more importantly, significantly reduce the overall energy consumption in heavy demanding tasks such as routing and header processing. This new platform, accelerates the cost estimation algorithm of the XMesh routing protocol by 606 times. At the same time, and more importantly, there is a reduction in the measured energy consumption by 97%. Moreover, the proposed system can accelerate by three orders of magnitude the header checksum calculation scheme, while it consumes 96.33% less energy than the corresponding standard software implementations. Since this is the first time ever that such a hardware-based scheme is used in a WSN environment, we strongly believe that this paper can be a first reference for a new design paradigm for WSN nodes which will include CPLDs for the actual data/network processing.
{"title":"Using reconfigurable hardware devices in WSNs for accelerating and reducing the power consumption of header processing tasks","authors":"Georgios-Grigorios Mplemenos, P. Christou, I. Papaefstathiou","doi":"10.1109/ANTS.2009.5409874","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409874","url":null,"abstract":"In this paper, a pioneering platform is introduced, which utilizes all the advantages of CPLDs in order to enhance the processing power of the sensor nodes and, more importantly, significantly reduce the overall energy consumption in heavy demanding tasks such as routing and header processing. This new platform, accelerates the cost estimation algorithm of the XMesh routing protocol by 606 times. At the same time, and more importantly, there is a reduction in the measured energy consumption by 97%. Moreover, the proposed system can accelerate by three orders of magnitude the header checksum calculation scheme, while it consumes 96.33% less energy than the corresponding standard software implementations. Since this is the first time ever that such a hardware-based scheme is used in a WSN environment, we strongly believe that this paper can be a first reference for a new design paradigm for WSN nodes which will include CPLDs for the actual data/network processing.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130199101","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409862
Shivashis Saha, E. Manley, J. Deogun
The problem of minimizing the total network cost of an optical network topology by efficient selection of switching sites, size of optical switches, and optical links is investigated in this paper. The problem investigated is NP—hard. Therefore, we develop an efficient heuristic to approximate the solution in polynomial time. A mixed integer quadratic programming (MIQP) formulation of the problem is also presented to find the optimal network cost and compute the efficiency of the heuristic. The total network cost calculated by the heuristic in the experiments is within 19% of its optimal value. Moreover, the total network cost in half of the test problems is within 6% of its optimal value. The heuristic solves the problem with 20 node topologies in less than a second. However, the commercial optimization software can not solve any problem with more than 10 nodes even in two weeks.
{"title":"Minimizing network cost in all-optical networks","authors":"Shivashis Saha, E. Manley, J. Deogun","doi":"10.1109/ANTS.2009.5409862","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409862","url":null,"abstract":"The problem of minimizing the total network cost of an optical network topology by efficient selection of switching sites, size of optical switches, and optical links is investigated in this paper. The problem investigated is NP—hard. Therefore, we develop an efficient heuristic to approximate the solution in polynomial time. A mixed integer quadratic programming (MIQP) formulation of the problem is also presented to find the optimal network cost and compute the efficiency of the heuristic. The total network cost calculated by the heuristic in the experiments is within 19% of its optimal value. Moreover, the total network cost in half of the test problems is within 6% of its optimal value. The heuristic solves the problem with 20 node topologies in less than a second. However, the commercial optimization software can not solve any problem with more than 10 nodes even in two weeks.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114952458","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409872
A. Nag, M. Tornatore
Due to the increasing heterogeneity and the growing volume of traffic, telecom backbone networks are going through new innovations and paradigm shift. The wavelength-division multiplexed (WDM) optical networks may cost-effectively support the growing heterogeneity of traffic demands by having mixed line rates (MLR) over different wavelength channels.
{"title":"Impact of channel spacing on the design of a mixed-line-rate optical network","authors":"A. Nag, M. Tornatore","doi":"10.1109/ANTS.2009.5409872","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409872","url":null,"abstract":"Due to the increasing heterogeneity and the growing volume of traffic, telecom backbone networks are going through new innovations and paradigm shift. The wavelength-division multiplexed (WDM) optical networks may cost-effectively support the growing heterogeneity of traffic demands by having mixed line rates (MLR) over different wavelength channels.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128955086","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409863
Mahmudur Rahman, A. Agarwal
Implementing multiple channels among the multi-radio nodes of Wireless Mesh Networks (WMNs) improve the capacity of the network. In this paper, we propose Channel Aware Routing Metric (CARM) as a new routing metric that facilitates the use of available channels in 802.11 WMNs. It chooses a route that has better link quality, reduced switching delay and better channel diversity. Unlike all the other metrics, CARM makes a combination between the number of interfaces and the number of channels available to improve the performance of the network. Simulation results show that by utilizing all the channels in the frequency spectrum, CARM performs better than other standard metrics.
{"title":"Channel Aware Routing Metric for IEEE 802.11 multi-channel Mesh Networks","authors":"Mahmudur Rahman, A. Agarwal","doi":"10.1109/ANTS.2009.5409863","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409863","url":null,"abstract":"Implementing multiple channels among the multi-radio nodes of Wireless Mesh Networks (WMNs) improve the capacity of the network. In this paper, we propose Channel Aware Routing Metric (CARM) as a new routing metric that facilitates the use of available channels in 802.11 WMNs. It chooses a route that has better link quality, reduced switching delay and better channel diversity. Unlike all the other metrics, CARM makes a combination between the number of interfaces and the number of channels available to improve the performance of the network. Simulation results show that by utilizing all the channels in the frequency spectrum, CARM performs better than other standard metrics.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116855172","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
扫码关注我们
求助内容：
应助结果提醒方式：