Pub Date : 1900-01-01DOI: 10.14209/sbrt.2008.42368
L. Marques, Shusaburo Motoyama
—In this paper is presented a study of HTTP handoff traffic impact in the forward link of UMTS/HSDPA system. This study is based on the introduction of new criteria for HTTP hand-off traffic acceptance. These criteria are proposed considering the radio signal strength (RSS) and percentage of buffer occupation. Moreover, this study is carried out with acceptance criteria combined with data schedulers Max C/I (Maximum Carrier Interference), PF (Proportional Fair) and new proposal Pr/PF (Priority Proportional Fair). Different criteria and schedulers are evaluated through metrics of QoS in function of handoff traffic load. The results showed that depending on the chosen criterion and scheduler, it is possible to assure the QoS of HSDPA system and still to accept a good amount of handoff traffic.
{"title":"Impacto do Tráfego Handoff no Sistema 3G UMTS/HSDPA Sob Vários Critérios de Aceitação e Escalonadores","authors":"L. Marques, Shusaburo Motoyama","doi":"10.14209/sbrt.2008.42368","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42368","url":null,"abstract":"—In this paper is presented a study of HTTP handoff traffic impact in the forward link of UMTS/HSDPA system. This study is based on the introduction of new criteria for HTTP hand-off traffic acceptance. These criteria are proposed considering the radio signal strength (RSS) and percentage of buffer occupation. Moreover, this study is carried out with acceptance criteria combined with data schedulers Max C/I (Maximum Carrier Interference), PF (Proportional Fair) and new proposal Pr/PF (Priority Proportional Fair). Different criteria and schedulers are evaluated through metrics of QoS in function of handoff traffic load. The results showed that depending on the chosen criterion and scheduler, it is possible to assure the QoS of HSDPA system and still to accept a good amount of handoff traffic.","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123082404","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42703
Fábio da Silva, Leni J. Matos, Edson Cataldo
{"title":"Simulação de um canal rádio UWB através do modelo auto-regressivo","authors":"Fábio da Silva, Leni J. Matos, Edson Cataldo","doi":"10.14209/sbrt.2008.42703","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42703","url":null,"abstract":"","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127724713","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42864
F. Vieira, L. Ling, C. Jorge, Jeferson Stênico
{"title":"Um Algoritmo Adaptativo para Predição da Regularidade Local de Tráfego de Redes","authors":"F. Vieira, L. Ling, C. Jorge, Jeferson Stênico","doi":"10.14209/sbrt.2008.42864","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42864","url":null,"abstract":"","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114177988","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42882
H. Bierwagen, N. Ribeiro, E. Barrientos, Matheus Massagardi, C. Gallep, E. Conforti
— A web-lab wavelength converter setup is presented, offering optical services to other laboratories in the Fapesp-KyaTera Optical Network. In addition, optical generation, amplification and filtering, at several gigabits per second, is also available. An Optical Spectrum Analyzer controlled through the Internet provides accurate analyses of filtering, amplification and wavelength conversion.
{"title":"Lambda-Conversion using remote fully automated WebLab","authors":"H. Bierwagen, N. Ribeiro, E. Barrientos, Matheus Massagardi, C. Gallep, E. Conforti","doi":"10.14209/sbrt.2008.42882","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42882","url":null,"abstract":"— A web-lab wavelength converter setup is presented, offering optical services to other laboratories in the Fapesp-KyaTera Optical Network. In addition, optical generation, amplification and filtering, at several gigabits per second, is also available. An Optical Spectrum Analyzer controlled through the Internet provides accurate analyses of filtering, amplification and wavelength conversion.","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116864793","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42833
C. Junior, Romis Attux, Ricardo Suyama, J. Romano
— This work presents a stability analysis of the LMS algorithm based on deterministic and stochastic Lyapunov approaches. In both cases it is shown to be possible to obtain expressions for the maximum value of the adaptation step-size without necessarily resorting to simplifying hypotheses such as the independence theory. This reveals interesting perspectives of studies concerning aspects like convergence rate and misadjustment.
{"title":"Análise de Estabilidade do LMS segundo a Teoria de Lyapunov","authors":"C. Junior, Romis Attux, Ricardo Suyama, J. Romano","doi":"10.14209/sbrt.2008.42833","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42833","url":null,"abstract":"— This work presents a stability analysis of the LMS algorithm based on deterministic and stochastic Lyapunov approaches. In both cases it is shown to be possible to obtain expressions for the maximum value of the adaptation step-size without necessarily resorting to simplifying hypotheses such as the independence theory. This reveals interesting perspectives of studies concerning aspects like convergence rate and misadjustment.","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117110928","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 : 1900-01-01DOI: 10.14209/sbrt.2008.43165
Edgar Piacentini, Anelise Munaretto, Mauro Fonseca
{"title":"Controle de Admissão para Redes em Malha de Última Milha","authors":"Edgar Piacentini, Anelise Munaretto, Mauro Fonseca","doi":"10.14209/sbrt.2008.43165","DOIUrl":"https://doi.org/10.14209/sbrt.2008.43165","url":null,"abstract":"","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124835288","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42127
J. Arpasi, E. Carvalho, L. Tibola
—The trellis of a binary convolutional code is a connected graph, that is, all the states are connected by some path that is compounded by the concatenation of transitions labeled by encoded bits. When the convolucional code is not binary, then its trellis can be a disconnected graph. In this work it is shown the equivalence between connectedness of graphs and controllability of group codes which are generated from extensions of groups. More precisely; given a group G as an extension U by S , i
{"title":"Grafos conexos e controle em códigos de treliça","authors":"J. Arpasi, E. Carvalho, L. Tibola","doi":"10.14209/sbrt.2008.42127","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42127","url":null,"abstract":"—The trellis of a binary convolutional code is a connected graph, that is, all the states are connected by some path that is compounded by the concatenation of transitions labeled by encoded bits. When the convolucional code is not binary, then its trellis can be a disconnected graph. In this work it is shown the equivalence between connectedness of graphs and controllability of group codes which are generated from extensions of groups. More precisely; given a group G as an extension U by S , i","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126245004","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42423
José Antonio Casemiro Neto, Marco Maia
{"title":"Roteamento Baseado em Localização em Redes Ad-Hoc","authors":"José Antonio Casemiro Neto, Marco Maia","doi":"10.14209/sbrt.2008.42423","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42423","url":null,"abstract":"","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121830558","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42801
W. Gazzoni, Reginaldo Palazzo
{"title":"Códigos Simplex Descrevem Estados Quânticos com Máximo Emaranhamento Global","authors":"W. Gazzoni, Reginaldo Palazzo","doi":"10.14209/sbrt.2008.42801","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42801","url":null,"abstract":"","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116024267","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 : 1900-01-01DOI: 10.14209/sbrt.2008.42428
Márcio Lima, V. D. Rocha Jr., B. T. Ávila
— For a given arbitrary list of integer numbers, in general there is no known single universal code which is an overall optimum in the sense of representing the whole list with the shortest average codeword length. This is the main motivation in this paper to introduce adaptive universal codes based on pattern codes. The construction of a class of adaptive universal codes based on Fibonacci codes is given for integer representation which perform well over a wider range of integer values in comparison to known universal code constructions.
{"title":"Códigos Universais Adaptativos para Representação de Números Inteiros","authors":"Márcio Lima, V. D. Rocha Jr., B. T. Ávila","doi":"10.14209/sbrt.2008.42428","DOIUrl":"https://doi.org/10.14209/sbrt.2008.42428","url":null,"abstract":"— For a given arbitrary list of integer numbers, in general there is no known single universal code which is an overall optimum in the sense of representing the whole list with the shortest average codeword length. This is the main motivation in this paper to introduce adaptive universal codes based on pattern codes. The construction of a class of adaptive universal codes based on Fibonacci codes is given for integer representation which perform well over a wider range of integer values in comparison to known universal code constructions.","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829800","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
扫码关注我们
求助内容：
应助结果提醒方式：