M. Z. Alam, Charles Chittaranjan Patra, Colin Patra, M. Sobhan
Fourth generation mobile systems and services will mainly be characterized by a horizontal communication model, where different access technologies such as cellular, cordless, wireless local area network, short-range connectivity, and wired systems will be combined on a common platform to complement each other optimally for different service requirements and radio environments. To access different wireless networks, multimode user terminals are essential. The most promising way of implementing multimodal user terminals are to adopt the software radio approach. In this article, the authors find the complexity through establishing 4G Heterogeneous network and discuss over the recently developed multiplexing technique to access all IP based networks.
{"title":"Multiplexing Technique for All-IP 4G Heterogeneous Network","authors":"M. Z. Alam, Charles Chittaranjan Patra, Colin Patra, M. Sobhan","doi":"10.1109/AICT.2009.43","DOIUrl":"https://doi.org/10.1109/AICT.2009.43","url":null,"abstract":"Fourth generation mobile systems and services will mainly be characterized by a horizontal communication model, where different access technologies such as cellular, cordless, wireless local area network, short-range connectivity, and wired systems will be combined on a common platform to complement each other optimally for different service requirements and radio environments. To access different wireless networks, multimode user terminals are essential. The most promising way of implementing multimodal user terminals are to adopt the software radio approach. In this article, the authors find the complexity through establishing 4G Heterogeneous network and discuss over the recently developed multiplexing technique to access all IP based networks.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131550964","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}
A transmultiplexer combines several signals into one signal to be sent through a single communication channel. At the receiver end the combined signal is split to recover the transmitted signals. The crosstalk between output signals must be zero. A simulator, which enables to design and verify the properties of transmultiplexer systems, is presented. Due to the applied integer-value filters, the perfect reconstruction condition is strictly realized in practical applications. An example of the 4-channel polyphase transmultiplexer is also presented.
{"title":"Software Simulator to Design and Verify Transmultiplexer Systems","authors":"P. Sypka, M. Ziólko","doi":"10.1109/AICT.2009.35","DOIUrl":"https://doi.org/10.1109/AICT.2009.35","url":null,"abstract":"A transmultiplexer combines several signals into one signal to be sent through a single communication channel. At the receiver end the combined signal is split to recover the transmitted signals. The crosstalk between output signals must be zero. A simulator, which enables to design and verify the properties of transmultiplexer systems, is presented. Due to the applied integer-value filters, the perfect reconstruction condition is strictly realized in practical applications. An example of the 4-channel polyphase transmultiplexer is also presented.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121738633","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}
Proposals have been made to describe services programs in a rule-based language, because it is easier to describe programs in a rule-based language than a procedural language. But, it is difficult to find bugs in programs described in a rule-based language. To solve the problem and to make it easier for service developers to find bugs in programs, service specifications can be elicited from programs described in a rule-based language. This paper proposes a system for automatically eliciting state transition diagrams based on an enhanced state transition model from a set of rules.
{"title":"Automatic Elicitation System of Network Service Specifications from a Set of Rules","authors":"M. Ohba, T. Ohta","doi":"10.1109/AICT.2009.27","DOIUrl":"https://doi.org/10.1109/AICT.2009.27","url":null,"abstract":"Proposals have been made to describe services programs in a rule-based language, because it is easier to describe programs in a rule-based language than a procedural language. But, it is difficult to find bugs in programs described in a rule-based language. To solve the problem and to make it easier for service developers to find bugs in programs, service specifications can be elicited from programs described in a rule-based language. This paper proposes a system for automatically eliciting state transition diagrams based on an enhanced state transition model from a set of rules.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115150840","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}
I. B. Martins, F. R. Barbosa, L. H. Bonani, E. Moschim
In this work we investigate the performance of optical packet/burst switched (OPS/OBS) architectures connected as mesh and as ring topologies, for future optical metropolitan networks. Network throughput and protection to link failure under uniform traffic distribution for all nodes is investigated in order to evaluate the sensitivity of OPS/OBSN performance. Our results are based on analysis of simulations and comparison between various mesh (Manhattan St. type) and ring topologies. We also consider the detailed traffic distributions over the network links and the impact caused by failure of more or less loaded links, thus providing a way to select links that require protection.
{"title":"Improved Method for Evaluation of Network Throughput and Protection in Future Optically Switched Metropolitan Networks","authors":"I. B. Martins, F. R. Barbosa, L. H. Bonani, E. Moschim","doi":"10.1109/AICT.2009.48","DOIUrl":"https://doi.org/10.1109/AICT.2009.48","url":null,"abstract":"In this work we investigate the performance of optical packet/burst switched (OPS/OBS) architectures connected as mesh and as ring topologies, for future optical metropolitan networks. Network throughput and protection to link failure under uniform traffic distribution for all nodes is investigated in order to evaluate the sensitivity of OPS/OBSN performance. Our results are based on analysis of simulations and comparison between various mesh (Manhattan St. type) and ring topologies. We also consider the detailed traffic distributions over the network links and the impact caused by failure of more or less loaded links, thus providing a way to select links that require protection.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133448494","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}
This paper presents a system for a location-based discovery of points of interest, based on the current geographic position of mobile users. The proposed approach exploits a mixture of Web 2.0 technologies (for the localization of point of interests), positioning techniques and cross-layer networking schemes for a seamless navigation, while moving through different and heterogeneous wireless networks.
{"title":"A Web 2.0, Location-Based Architecture for a Seamless Discovery of Points of Interests","authors":"S. Ferretti, V. Ghini","doi":"10.1109/AICT.2009.45","DOIUrl":"https://doi.org/10.1109/AICT.2009.45","url":null,"abstract":"This paper presents a system for a location-based discovery of points of interest, based on the current geographic position of mobile users. The proposed approach exploits a mixture of Web 2.0 technologies (for the localization of point of interests), positioning techniques and cross-layer networking schemes for a seamless navigation, while moving through different and heterogeneous wireless networks.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134254511","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}
The article presents a diffusion approximation model applied to investigate the behaviour of priority queues. Diffusion approximation allows us to include in queueing models fairly general assumptions. First of all it gives us a tool to consider in a natural way transient states of queues, which is vary rare in classical queueing models. Then we may consider input streams with general interarrival time distributions and servers with general service time distributions. Single server models may be easily incorporated into the network of queues. Here, we apply the diffusion approximation formalism to study transient and steady-state behavior of G/G/1 and G/G/1/N priority preemptive models. The models can be easily converted to nonpreemptive queueing discipline. Also the introduction of self-similar traffic is possible. The models may be useful in performance evaluation of mechanisms to differentiate the quality of service e.g. in WiMAX, metro networks, etc.
{"title":"Transient States of Priority Queues - A Diffusion Approximation Study","authors":"T. Czachórski, Tomasz Nycz, F. Pekergin","doi":"10.1109/AICT.2009.14","DOIUrl":"https://doi.org/10.1109/AICT.2009.14","url":null,"abstract":"The article presents a diffusion approximation model applied to investigate the behaviour of priority queues. Diffusion approximation allows us to include in queueing models fairly general assumptions. First of all it gives us a tool to consider in a natural way transient states of queues, which is vary rare in classical queueing models. Then we may consider input streams with general interarrival time distributions and servers with general service time distributions. Single server models may be easily incorporated into the network of queues. Here, we apply the diffusion approximation formalism to study transient and steady-state behavior of G/G/1 and G/G/1/N priority preemptive models. The models can be easily converted to nonpreemptive queueing discipline. Also the introduction of self-similar traffic is possible. The models may be useful in performance evaluation of mechanisms to differentiate the quality of service e.g. in WiMAX, metro networks, etc.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"421 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134534763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, network selection in heterogeneous wireless networks has been widely studied by combining various attributes to make a final decision. However, weighting methods in the current literature are not suitable for practical usage. Therefore, we propose in this paper a novel weighting method, named TRigger-based aUtomatic Subjective weighTing (TRUST), which can efficiently calculate the subjective weights of various network attributes based on both terminal-side and network-side subjective requirements in the network selection issue. Trigger events of the network selection procedure are specifically considered by this method, so the subjective weights are calculated based on the effects that these events bring to the selection results. The proposed method has several obvious benefits compared with the widely used eigenvector method in the literature of network selection.
{"title":"TRUST: A Trigger-Based Automatic Subjective Weighting Method for Network Selection","authors":"Lusheng Wang, D. Binet","doi":"10.1109/AICT.2009.68","DOIUrl":"https://doi.org/10.1109/AICT.2009.68","url":null,"abstract":"In recent years, network selection in heterogeneous wireless networks has been widely studied by combining various attributes to make a final decision. However, weighting methods in the current literature are not suitable for practical usage. Therefore, we propose in this paper a novel weighting method, named TRigger-based aUtomatic Subjective weighTing (TRUST), which can efficiently calculate the subjective weights of various network attributes based on both terminal-side and network-side subjective requirements in the network selection issue. Trigger events of the network selection procedure are specifically considered by this method, so the subjective weights are calculated based on the effects that these events bring to the selection results. The proposed method has several obvious benefits compared with the widely used eigenvector method in the literature of network selection.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133043509","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}
Industry and end users interest in personalization of services and user devices continues to increase. Many user devices and services already contain settings and preferences that are specific to that user device or a network and unrelated to any other. Behind every instance of personalization is a profile that stores the user preferences, context of use and other information that can be used to deliver a user experience tailored to the individual users’ needs and preferences. In order to make use of the user preferences for a range of services and devices, there is a need for standardization of preferences and the architecture that enables their interoperability. In this scenario, the paper illustrates how two complementary technologies, XDM by OMA and XDI by OASIS, may be seamlessly integrated in Next Generation Networks to enable interoperability of user profile data management between telecommunication and internet services.
{"title":"User Profile Management in Next Generation Networks","authors":"G. Bartolomeo, T. Kováčiková","doi":"10.1109/AICT.2009.28","DOIUrl":"https://doi.org/10.1109/AICT.2009.28","url":null,"abstract":"Industry and end users interest in personalization of services and user devices continues to increase. Many user devices and services already contain settings and preferences that are specific to that user device or a network and unrelated to any other. Behind every instance of personalization is a profile that stores the user preferences, context of use and other information that can be used to deliver a user experience tailored to the individual users’ needs and preferences. In order to make use of the user preferences for a range of services and devices, there is a need for standardization of preferences and the architecture that enables their interoperability. In this scenario, the paper illustrates how two complementary technologies, XDM by OMA and XDI by OASIS, may be seamlessly integrated in Next Generation Networks to enable interoperability of user profile data management between telecommunication and internet services.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"61 2-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114124106","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}
A new design for maximizing the data rate of the multiband orthogonal frequency division multiplexing ultra wideband systems is presented. The design is based on the generation of a series of M-ary quadrature amplitude modulation zones for each UWB subcarrier whose levels of fading depend on the UWB channel model. The available transmitted power is then optimally distributed to use the modulation scheme with the maximum M in the subcarriers. The optimization is constrained by the target bit error rate and the limitation of the UWB transmit power spectral density in each subcarrier. The rate maximization has been obtained in a three-step algorithm consisting of M-QAM zones generation, primary and advanced power and bit loading. The performance of the proposed algorithm is analyzed over UWB channel. The results show that the data rate is significantly improved by an advanced power and bit loading scheme.
{"title":"Rate Maximization for Multiband OFDM Ultra Wideband Systems Using Adaptive Power and Bit Loading Algorithm","authors":"Liaoyuan Zeng, S. McGrath, E. Cano","doi":"10.1109/AICT.2009.69","DOIUrl":"https://doi.org/10.1109/AICT.2009.69","url":null,"abstract":"A new design for maximizing the data rate of the multiband orthogonal frequency division multiplexing ultra wideband systems is presented. The design is based on the generation of a series of M-ary quadrature amplitude modulation zones for each UWB subcarrier whose levels of fading depend on the UWB channel model. The available transmitted power is then optimally distributed to use the modulation scheme with the maximum M in the subcarriers. The optimization is constrained by the target bit error rate and the limitation of the UWB transmit power spectral density in each subcarrier. The rate maximization has been obtained in a three-step algorithm consisting of M-QAM zones generation, primary and advanced power and bit loading. The performance of the proposed algorithm is analyzed over UWB channel. The results show that the data rate is significantly improved by an advanced power and bit loading scheme.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114378553","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}
This paper presents a closed form expression and a Markov model estimating packet loss in a bufferless hybrid circuit and packet switched OpMiGua node. Prior traffic analysis of hybrid network nodes are based on preemptive and queue-based priority mechanisms, however, in this article we focus on the time-window approach with its associated reservation induced blocking (RIB). A closed form expression for packet loss is found by minimizing the RIB and is proved to be asymptotically exact for increasing length of circuit packets. A Markov model accounting for the effect of RIB is proposed and simulation is used to determine its accuracy. For lower than 85% share of circuit switched traffic, the respective median and 95- percentile for the relative error equals 10% and 25%. Finally, when circuit packets are aggregated into bursts the total packet loss is reduced for sufficiently high share of circuit traffic. The mechanisms behind this performance gain are identified and methods to maximise its effect are proposed.
{"title":"Analysis of a Bufferless OpMiGua Node","authors":"A. Kimsas, H. Øverby, N. Stol","doi":"10.1109/AICT.2009.71","DOIUrl":"https://doi.org/10.1109/AICT.2009.71","url":null,"abstract":"This paper presents a closed form expression and a Markov model estimating packet loss in a bufferless hybrid circuit and packet switched OpMiGua node. Prior traffic analysis of hybrid network nodes are based on preemptive and queue-based priority mechanisms, however, in this article we focus on the time-window approach with its associated reservation induced blocking (RIB). A closed form expression for packet loss is found by minimizing the RIB and is proved to be asymptotically exact for increasing length of circuit packets. A Markov model accounting for the effect of RIB is proposed and simulation is used to determine its accuracy. For lower than 85% share of circuit switched traffic, the respective median and 95- percentile for the relative error equals 10% and 25%. Finally, when circuit packets are aggregated into bursts the total packet loss is reduced for sufficiently high share of circuit traffic. The mechanisms behind this performance gain are identified and methods to maximise its effect are proposed.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117135869","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
扫码关注我们
求助内容：
应助结果提醒方式：