Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898978
Takashi Isobe, Daisuke Ito, Dai Akashi, S. Tsutsumi
TCP communication has the feature that decreases the throughput over a virtual private WAN between global offices, which has larger delay and causes packet loss at higher frequency than LAN. This paper proposes a high-speed original TCP applied for a virtual private WAN: RADIC-TCP (RTT — And — Discard — Independent Congestion control TCP). RADIC-TCP comprises of following three features: the bandwidth control using token size to limit the size of send data by each constant interval of time independent of RTT, rapid retransmission of all discontinuous loss segments using one time NACK and congestion control based on change rate of packet loss ratio. By using these three techniques, RADIC-TCP achieves large throughput communication independent of RTT and packet loss ratio over a virtual private WAN. We implemented the proxy applying RADIC-TCP for a normal PC, and evaluated the throughput of RADIC-TCP in an experimental environment. In the experimentation to emulate a general WAN (100 Mbps, 200 ms RTT, 0.1 % loss), the file transmission of single FTP user over RADIC-TCP achieves 93 Mbps throughput equal to 25 times of the throughput over CUBIC-TCP, when send/receive buffer size is set to 16 Mbytes. When using RADIC-TCP with other conventional TCP communications, the bandwidth allocated for RADIC-TCP can be controlled under a pre-set threshold to protect other conventional TCP communications. When the bandwidth allocated for RADIC-TCP is limited up to 10Mbps, the file transmissions of 50 FTP users were completed at the same time by dividing the 10Mbps bandwidth fairly, while saving the bandwidth of 90 Mbps for other conventional TCP communications.
{"title":"RADIC-TCP: High-speed protocol applied for virtual private WAN","authors":"Takashi Isobe, Daisuke Ito, Dai Akashi, S. Tsutsumi","doi":"10.1109/CTS.2011.5898978","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898978","url":null,"abstract":"TCP communication has the feature that decreases the throughput over a virtual private WAN between global offices, which has larger delay and causes packet loss at higher frequency than LAN. This paper proposes a high-speed original TCP applied for a virtual private WAN: RADIC-TCP (RTT — And — Discard — Independent Congestion control TCP). RADIC-TCP comprises of following three features: the bandwidth control using token size to limit the size of send data by each constant interval of time independent of RTT, rapid retransmission of all discontinuous loss segments using one time NACK and congestion control based on change rate of packet loss ratio. By using these three techniques, RADIC-TCP achieves large throughput communication independent of RTT and packet loss ratio over a virtual private WAN. We implemented the proxy applying RADIC-TCP for a normal PC, and evaluated the throughput of RADIC-TCP in an experimental environment. In the experimentation to emulate a general WAN (100 Mbps, 200 ms RTT, 0.1 % loss), the file transmission of single FTP user over RADIC-TCP achieves 93 Mbps throughput equal to 25 times of the throughput over CUBIC-TCP, when send/receive buffer size is set to 16 Mbytes. When using RADIC-TCP with other conventional TCP communications, the bandwidth allocated for RADIC-TCP can be controlled under a pre-set threshold to protect other conventional TCP communications. When the bandwidth allocated for RADIC-TCP is limited up to 10Mbps, the file transmissions of 50 FTP users were completed at the same time by dividing the 10Mbps bandwidth fairly, while saving the bandwidth of 90 Mbps for other conventional TCP communications.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126509422","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-05-08DOI: 10.1109/CTS.2011.5898981
H. Çelebi, S. Güzelgöz, Tayyar Güzel, H. Arslan
Power line communication (PLC) channels may have entirely different physical characteristics. In order to establish reliable communication systems operating in power line networks (PLNs), characteristics of power line channel have to be investigated very carefully. In this paper, noise and multipath characteristics of PLC channels are examined. A unique experimental setup is established for noise measurements and a simulation environment is prepared for multipath analysis for indoor PLNs. Results of the measurements and simulations are presented. Besides the investigation of some specific PLNs, impact of the physical characteristics of different PLC networks on the channel delay spread parameter, namely root-mean-squared (RMS) delay spread, are studied statistically.
{"title":"Noise and channel statistics of indoor power line networks","authors":"H. Çelebi, S. Güzelgöz, Tayyar Güzel, H. Arslan","doi":"10.1109/CTS.2011.5898981","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898981","url":null,"abstract":"Power line communication (PLC) channels may have entirely different physical characteristics. In order to establish reliable communication systems operating in power line networks (PLNs), characteristics of power line channel have to be investigated very carefully. In this paper, noise and multipath characteristics of PLC channels are examined. A unique experimental setup is established for noise measurements and a simulation environment is prepared for multipath analysis for indoor PLNs. Results of the measurements and simulations are presented. Besides the investigation of some specific PLNs, impact of the physical characteristics of different PLC networks on the channel delay spread parameter, namely root-mean-squared (RMS) delay spread, are studied statistically.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127097836","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-05-08DOI: 10.1109/CTS.2011.5898985
Enqing Dong, Chai Yanze, Xiaojun Liu
The paper presents a three-dimensional localization algorithm for Wireless Sensor Networks (WSN) based on Particle Swarm Optimization (PSO). According to a direct proportion relationship of the measured distance with the measuring errors, an improved three-dimensional localization objective function is defined with weighted the measured distance, and which is optimized by using PSO. In the process of solving the measured distance equations set which is an overdetermined system of equations, for reducing the order of the equations, the minimum distance equation in the system of equations is selected to subtract other equations instead of random selection. The simulation results show that the process can reduce localization errors. The effects of the amount and the distribution of the beacon nodes are analyzed, and the experimental results show that the localization errors under the marginal distribution of the beacon nodes are smaller than that one under the random distribution of the beacon nodes. The final simulation results indicate that the proposed three-dimensional localization algorithm has a higher accuracy and lower affection of the non-line-of-sight error than the least square algorithm and the BFGS (Broyden, Fletcher, Goldfarb, Shanno) algorithm, but the proposed algorithm is at cost of more localization time.
{"title":"A novel three-dimensional localization algorithm for Wireless Sensor Networks based on Particle Swarm Optimization","authors":"Enqing Dong, Chai Yanze, Xiaojun Liu","doi":"10.1109/CTS.2011.5898985","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898985","url":null,"abstract":"The paper presents a three-dimensional localization algorithm for Wireless Sensor Networks (WSN) based on Particle Swarm Optimization (PSO). According to a direct proportion relationship of the measured distance with the measuring errors, an improved three-dimensional localization objective function is defined with weighted the measured distance, and which is optimized by using PSO. In the process of solving the measured distance equations set which is an overdetermined system of equations, for reducing the order of the equations, the minimum distance equation in the system of equations is selected to subtract other equations instead of random selection. The simulation results show that the process can reduce localization errors. The effects of the amount and the distribution of the beacon nodes are analyzed, and the experimental results show that the localization errors under the marginal distribution of the beacon nodes are smaller than that one under the random distribution of the beacon nodes. The final simulation results indicate that the proposed three-dimensional localization algorithm has a higher accuracy and lower affection of the non-line-of-sight error than the least square algorithm and the BFGS (Broyden, Fletcher, Goldfarb, Shanno) algorithm, but the proposed algorithm is at cost of more localization time.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114199111","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-05-08DOI: 10.1109/CTS.2011.5898968
S. A. Zahr, E. Doumith, M. Gagnaire
Over the last decade, translucent WDM networks have appeared as a promising candidate for next generation core networks. Using sparse regeneration techniques, translucent networks may achieve a pretty tradeoff between the low cost of transparent networks and the quality of transmission guaranteed by fully-opaque networks. On one hand, deploying large-scale transparent networks is still a critical issue since transmission impairments arising from long-haul optical equipment may significantly limit the optical reach. On the other hand, opaque networks remain very expensive due to electrical regeneration performed at each network node. In this paper, we propose an original exact approach, based on an integer linear program (ILP) formulation, to deal with the problem of translucent network design. Existing exact approaches rely on linear approximations of the signal degradation. In this paper, we make use of a realistic estimate of the signal quality taking into account the simultaneous effect of four well-known transmission impairments. Moreover and to the best of our knowledge, all existing approaches consider the problem of translucent network design assuming either permanent or semi-permanent lightpath demands. In this paper, we consider the problem of translucent network design under dynamic but deterministic traffic pattern; i.e., scheduled lightpath demands (SLDs). In order to improve the scalability of our approach, we decompose the problem into the routing and regenerator placement, and the wavelength assignment and regenerator placement sub-problems. In the former, we place regenerators and route demands while assuming that the quality of transmission is independent of the wavelength value. In the latter, additional regenerators may be required to overcome the dependency of the quality of transmission on the wavelength value. Deployed regenerators may be shared among multiple non-concurrent SLDs. In doing so, we shorten further the gap between translucent and transparent network costs.
{"title":"An exact approach for translucent WDM network design considering scheduled lightpath demands","authors":"S. A. Zahr, E. Doumith, M. Gagnaire","doi":"10.1109/CTS.2011.5898968","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898968","url":null,"abstract":"Over the last decade, translucent WDM networks have appeared as a promising candidate for next generation core networks. Using sparse regeneration techniques, translucent networks may achieve a pretty tradeoff between the low cost of transparent networks and the quality of transmission guaranteed by fully-opaque networks. On one hand, deploying large-scale transparent networks is still a critical issue since transmission impairments arising from long-haul optical equipment may significantly limit the optical reach. On the other hand, opaque networks remain very expensive due to electrical regeneration performed at each network node. In this paper, we propose an original exact approach, based on an integer linear program (ILP) formulation, to deal with the problem of translucent network design. Existing exact approaches rely on linear approximations of the signal degradation. In this paper, we make use of a realistic estimate of the signal quality taking into account the simultaneous effect of four well-known transmission impairments. Moreover and to the best of our knowledge, all existing approaches consider the problem of translucent network design assuming either permanent or semi-permanent lightpath demands. In this paper, we consider the problem of translucent network design under dynamic but deterministic traffic pattern; i.e., scheduled lightpath demands (SLDs). In order to improve the scalability of our approach, we decompose the problem into the routing and regenerator placement, and the wavelength assignment and regenerator placement sub-problems. In the former, we place regenerators and route demands while assuming that the quality of transmission is independent of the wavelength value. In the latter, additional regenerators may be required to overcome the dependency of the quality of transmission on the wavelength value. Deployed regenerators may be shared among multiple non-concurrent SLDs. In doing so, we shorten further the gap between translucent and transparent network costs.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116319202","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-05-08DOI: 10.1109/CTS.2011.5898958
Marios Koutroullos, Charalambos Sergiou, V. Vassiliou
As applications in Wireless Sensor Networks are evolving, performance bounds are becoming stricter. Novel applications introduce much heavier traffic load, which, in turn, leads specific areas in the network to face congestion problems. In this paper, we describe the notion of using mobile nodes to mitigate congestion under specific circumstances. We examine the benefits of introducing new mobile nodes placed between the congested areas and sinks, in order to provide alternative disjoint paths towards them. The proposed Mobile Congestion Control (Mobile-CC) algorithm is applicable in areas where congestion happens repeatedly, or is of high duration, or even permanent. If congestion happens for very small period of time there will be no big benefit (in terms of congestion mitigation) when moving any nodes to that area, unless there is great probability of the event happening again at the same place in the future. Mobile-CC is not replacing existing congestion control or routing algorithms but instead aims to mitigate congestion, running in parallel with them.
{"title":"Mobile-CC: Introducing mobility to WSNs for congestion mitigation in heavily congested areas","authors":"Marios Koutroullos, Charalambos Sergiou, V. Vassiliou","doi":"10.1109/CTS.2011.5898958","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898958","url":null,"abstract":"As applications in Wireless Sensor Networks are evolving, performance bounds are becoming stricter. Novel applications introduce much heavier traffic load, which, in turn, leads specific areas in the network to face congestion problems. In this paper, we describe the notion of using mobile nodes to mitigate congestion under specific circumstances. We examine the benefits of introducing new mobile nodes placed between the congested areas and sinks, in order to provide alternative disjoint paths towards them. The proposed Mobile Congestion Control (Mobile-CC) algorithm is applicable in areas where congestion happens repeatedly, or is of high duration, or even permanent. If congestion happens for very small period of time there will be no big benefit (in terms of congestion mitigation) when moving any nodes to that area, unless there is great probability of the event happening again at the same place in the future. Mobile-CC is not replacing existing congestion control or routing algorithms but instead aims to mitigate congestion, running in parallel with them.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"2022 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114663844","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-05-08DOI: 10.1109/CTS.2011.5898960
D. V. D. Merwe, L. Grobler, Melvin Ferreira
The Radio Interferometric Positioning System (RIPS) was developed by Maroti et al. for the purpose of node localization in wireless sensor networks. They theorized that RIPS would produce ambiguous measurements when distances between nodes exceeded a carrier wavelength. This paper investigates this effect. In this investigation patterns in these invalid measurements are studied and then explained by looking at the mathematics behind RIPS. Findings made, provide a characterization of ambiguity in RIPS as well as new methods to extend the range of RIPS measurements beyond one carrier wavelength.
{"title":"A study of Q-range ambiguity in the Radio Interferometric Positioning System","authors":"D. V. D. Merwe, L. Grobler, Melvin Ferreira","doi":"10.1109/CTS.2011.5898960","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898960","url":null,"abstract":"The Radio Interferometric Positioning System (RIPS) was developed by Maroti et al. for the purpose of node localization in wireless sensor networks. They theorized that RIPS would produce ambiguous measurements when distances between nodes exceeded a carrier wavelength. This paper investigates this effect. In this investigation patterns in these invalid measurements are studied and then explained by looking at the mathematics behind RIPS. Findings made, provide a characterization of ambiguity in RIPS as well as new methods to extend the range of RIPS measurements beyond one carrier wavelength.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132148385","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-05-08DOI: 10.1109/CTS.2011.5898953
P. Gouvas, A. Bouras, A. Zafeiropoulos, A. Liakopoulos
Future networks are becoming larger in scale, more dynamic and heterogeneous, imposing new requirements to the design and provision of advanced services. In order to cope with these requirements, new approaches have to be proposed that are able to handle the changes in the network topology in an autonomic manner and relieve application developers from dealing with network topology volatility. In this paper, an approach for efficiently designing services is proposed, based on an existing generic framework that facilitates the design and development of autonomic and decentralized services in ad-hoc networks. The design of the services is realized independently from the underlying physical network while specific functions are provided to application developers for deploying useful applications. Through a set of emulations over a reference implementation, it is demonstrated that services may be efficiently and reliably delivered over a dynamic network.
{"title":"Ubi-Chord: Services provision in dynamic networks based on p2p protocols","authors":"P. Gouvas, A. Bouras, A. Zafeiropoulos, A. Liakopoulos","doi":"10.1109/CTS.2011.5898953","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898953","url":null,"abstract":"Future networks are becoming larger in scale, more dynamic and heterogeneous, imposing new requirements to the design and provision of advanced services. In order to cope with these requirements, new approaches have to be proposed that are able to handle the changes in the network topology in an autonomic manner and relieve application developers from dealing with network topology volatility. In this paper, an approach for efficiently designing services is proposed, based on an existing generic framework that facilitates the design and development of autonomic and decentralized services in ad-hoc networks. The design of the services is realized independently from the underlying physical network while specific functions are provided to application developers for deploying useful applications. Through a set of emulations over a reference implementation, it is demonstrated that services may be efficiently and reliably delivered over a dynamic network.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128300840","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-05-08DOI: 10.1109/CTS.2011.5898957
B. Gajic, Janne Riihijärvi, P. Mähönen
In this work we analyze the performance of publish-subscribe based intra domain topology management. We build our model along with PSIRP project [1] implementation prototype, relying entirely on publish-subscribe communication pattern. The exchange of topology information is completely done within publish-subscribe domain. Furthermore, we aim at using different optimization techniques in path computation in order to utilize network resources more efficiently. To the best of our knowledge, this work represents the first topology management and network path calculation model entirely founded on publish-subscribe paradigm, moving a step forward in evaluation of this emerging communication scheme.
{"title":"Intra-domain topology manager for publish-subscribe networks","authors":"B. Gajic, Janne Riihijärvi, P. Mähönen","doi":"10.1109/CTS.2011.5898957","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898957","url":null,"abstract":"In this work we analyze the performance of publish-subscribe based intra domain topology management. We build our model along with PSIRP project [1] implementation prototype, relying entirely on publish-subscribe communication pattern. The exchange of topology information is completely done within publish-subscribe domain. Furthermore, we aim at using different optimization techniques in path computation in order to utilize network resources more efficiently. To the best of our knowledge, this work represents the first topology management and network path calculation model entirely founded on publish-subscribe paradigm, moving a step forward in evaluation of this emerging communication scheme.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"430 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133278525","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-05-08DOI: 10.1109/CTS.2011.5898927
M. Georgiades, G. Zervas, D. Simeonidou, J. Palacios, J. Fullaondo, M. Basham
This paper discusses the requirements and motivations for setting-up and utilizing two different optical fiber test-beds both of a Telecom Operator as well as the UEssex/JANET Aurora field fiber testbed for optical metro networks research within the EU ICT MAINS project. Using both test-beds the MAINS project aims to evaluate its proposed mesh-ring topologies which feature innovative sub-wavelength switching nodes. Different research and technology attributes are considered for evaluation over the research and real commercial environments. The paper illustrates how the first test-bed scenario is designed to experimentally analyze multi-technology interoperability both at the data and control planes and how the second test-bed scenario with the use of a virtual PC application over sub-wavelength switching ring network aims to validate the proposed solutions with real customers and obtain supportive statistics and performance measures.
{"title":"A suite of optical network testbeds for a realistic evaluation of MAINS' sub-wavelength switched metro network architectures","authors":"M. Georgiades, G. Zervas, D. Simeonidou, J. Palacios, J. Fullaondo, M. Basham","doi":"10.1109/CTS.2011.5898927","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898927","url":null,"abstract":"This paper discusses the requirements and motivations for setting-up and utilizing two different optical fiber test-beds both of a Telecom Operator as well as the UEssex/JANET Aurora field fiber testbed for optical metro networks research within the EU ICT MAINS project. Using both test-beds the MAINS project aims to evaluate its proposed mesh-ring topologies which feature innovative sub-wavelength switching nodes. Different research and technology attributes are considered for evaluation over the research and real commercial environments. The paper illustrates how the first test-bed scenario is designed to experimentally analyze multi-technology interoperability both at the data and control planes and how the second test-bed scenario with the use of a virtual PC application over sub-wavelength switching ring network aims to validate the proposed solutions with real customers and obtain supportive statistics and performance measures.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116675004","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-05-08DOI: 10.1109/CTS.2011.5898971
M. Shahidi, Nika Naghavi, H. Aghvami
Pervasive devices possess restricted capabilities in terms of processing, information display and network data rates due to their mobile nature. Therefore in order to provide content to users with pervasive devices, the quality of the media presentation often needs to be adjusted according the different characteristics of those devices, and it is not efficient for content and service providers to provide all sort of contents in advanced. That indicates the great importance of adaptation in pervasive computing environment. Adaptation Management Framework (AMF) has been proposed to provide an environment in which the content/services are personalized to the user's preferences automatically. In this paper, we look into one major complication in the design of the AMF, that is to select and combine appropriate adaptation operations as well as their concrete implementations which is called Adaptation Mechanisms. We proposed the use of two selection algorithm methods to fulfill the tasks. Their performances are evaluated and compared with respect to effectiveness and efficiency.
{"title":"Content adaptor selection models in Adaptation Management Framework","authors":"M. Shahidi, Nika Naghavi, H. Aghvami","doi":"10.1109/CTS.2011.5898971","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898971","url":null,"abstract":"Pervasive devices possess restricted capabilities in terms of processing, information display and network data rates due to their mobile nature. Therefore in order to provide content to users with pervasive devices, the quality of the media presentation often needs to be adjusted according the different characteristics of those devices, and it is not efficient for content and service providers to provide all sort of contents in advanced. That indicates the great importance of adaptation in pervasive computing environment. Adaptation Management Framework (AMF) has been proposed to provide an environment in which the content/services are personalized to the user's preferences automatically. In this paper, we look into one major complication in the design of the AMF, that is to select and combine appropriate adaptation operations as well as their concrete implementations which is called Adaptation Mechanisms. We proposed the use of two selection algorithm methods to fulfill the tasks. Their performances are evaluated and compared with respect to effectiveness and efficiency.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132643086","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
扫码关注我们
求助内容：
应助结果提醒方式：