2005 Asia-Pacific Conference on Communications最新文献_第5页

A Novel Implementation of Bidirectional Coupling Circuit for Broadband, High-Voltage, Power-Line Communications 宽带、高压、电力线通信双向耦合电路的一种新实现

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554014

M. Rastogi, D. K. Mitra, A. Bhattacharya

引用次数: 4

Referential Loss Recovery for Streaming Audio using Application Level Multicast 使用应用级多播的流音频的参考损失恢复

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554061

M. Hayasake, M. Gamage, T. Miki

{"title":"Referential Loss Recovery for Streaming Audio using Application Level Multicast","authors":"M. Hayasake, M. Gamage, T. Miki","doi":"10.1109/APCC.2005.1554061","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554061","url":null,"abstract":"The demand for real-time multimedia streaming services using application level multicast (ALM) is expected to grow rapidly in the near future and these multimedia applications consists of many media. Especially, the audio media requires a guaranteed quality of service (QoS). The ALM is expected to provide multicast services in a wide area. However, packet losses during transmission are a serious problem in these services as they result in degradation of the QoS. Forward error correction (FEC) is a promising technique to recover the lost packets and improve the QoS of streaming media. In the conventional audio streaming, pre-buffering of media stream and FEC techniques are required to cope with delay jitter and packet losses. However, FEC may degrade the QoS of all communications due to the increased congestion caused by FEC overhead with the increase of streaming sessions. In this paper, a novel FEC method that improves QoS of audio streaming services is proposed. It avoids the increased congestion caused by FEC overhead during media streaming. It also accommodates the delay jitter even without prebuffering of media stream. Furthermore, it provides the QoS according to requirements and environments of users, and location in the multicast tree by using layered coding of FEC. Thus, packet losses and jitter are recovered at each end host using ALM and do not affect the next-hop streaming. The results of computer simulations show that our proposed method provides better audio quality compared to conventional method","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134140216","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}

引用次数: 6

Band Planning Algorithm for Zipper-VDSL Systems Zipper-VDSL系统的频带规划算法

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554007

H. L. Wu, Shyue-Win Wei

引用次数: 0

Low Density Parity Check Decoding Algorithm for Multi-level Modulation Scheme 多级调制方案的低密度奇偶校验译码算法

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554158

J. Jeong, D. Choi, Ji-Won Jung

引用次数: 3

Waiting Time for Packet-based Networks with Slow and Fast Servers 具有慢速和快速服务器的分组网络的等待时间

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554233

J. Foo, G. Mercankosk

引用次数: 0

Computer Communication Network Upgrade for Optimal Capacity Related Reliability 计算机通信网络优化容量相关可靠性升级

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554235

Kok Yong Lim, S. Soh, S. Rai

{"title":"Computer Communication Network Upgrade for Optimal Capacity Related Reliability","authors":"Kok Yong Lim, S. Soh, S. Rai","doi":"10.1109/APCC.2005.1554235","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554235","url":null,"abstract":"Capacity-related reliability (CRR) computes the probability that a computer communication network (CCN) has at least a bandwidth Wmin between a pair of nodes. The quality of service (QoS) metric extends the terminal-reliability and the network-flow measures to capture the effects of any required message bandwidth, channel capacity, and network connectivity in a CCN, where links (connection services) are subject to failures and each connection has different bandwidth. An optimal CRR is achieved during the network design phase, or by upgrading the existing network. Since network upgrade conies at a cost, upgrading inappropriate network components may waste resources, and therefore an optimal upgrade should maximize QoS improvement with minimum resources. This paper presents a brute force approach to find a bottleneck link whose upgrade achieves a maximal CRR improvement. To reduce its time complexity, we also propose an efficient heuristic that obtains the link with high probability. We have implemented the algorithms in C, and used them to find the bottleneck links on some typical CCN. The simulation results to show the effectiveness of the algorithms are presented in this paper","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123689085","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}

引用次数: 3

An Adaptive Scheduling Algorithm for PDD Method Based on Modelling of DiffServ Queues 基于DiffServ队列建模的PDD自适应调度算法

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554192

A. Broumandan, N. Rezaee, M. Mahramian

引用次数: 1

Performance Investigation on three-classes of MANET Routing Protocols 三类MANET路由协议的性能研究

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554167

M. Abolhasan, T. Wysoeki, J. Lipman

引用次数: 15

Filter Bank Design for DFT Based Transmultiplexers 基于DFT的复用器滤波器组设计

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554206

A. Lim, H. H. Dam, S. Nordholm

{"title":"Filter Bank Design for DFT Based Transmultiplexers","authors":"A. Lim, H. H. Dam, S. Nordholm","doi":"10.1109/APCC.2005.1554206","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554206","url":null,"abstract":"This paper investigates the application of filter bank design techniques on the DFT based transmultiplexers to ameliorate the effects of in-band aliasing and consequently improve the performance of the system. With this approach, one is allowed flexibility in the design of the synthesis and analysis filters. Hence, a suitable prototype filter can be selected and specific values assigned to its parameters, namely the cut-off frequency, main lobe width and side lobe amplitudes so as to construct an ideal filter for optimal recovery. Investigation results depict that increasing the cut-off frequency of the prototype filter by a small increment delta, enhances system performance through the widening of the stopband tolerance region which reduces the effect of aliasing. Simulations also show that using a Kaiser prototype filter with a wide main lobe and low side lobe amplitudes generates the most favorable results. Moreover, it was observed that the performance of the transmultiplexer can be improved by increasing the number of sub-carriers and oversampling factor. The evaluation of the transmultiplexer structure for this paper was assessed in terms of its bit error rate (BER) performance","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126286006","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}

引用次数: 5

Capacity Utilization versus Congestion Levels in Wavelength Routing for Large Scale WDM Networks 大规模WDM网络波长路由中的容量利用率与拥塞水平

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI: 10.1109/APCC.2005.1554177

Q. V. Phung, E. Cowan

{"title":"Capacity Utilization versus Congestion Levels in Wavelength Routing for Large Scale WDM Networks","authors":"Q. V. Phung, E. Cowan","doi":"10.1109/APCC.2005.1554177","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554177","url":null,"abstract":"Wavelength routing (WR) has been a key issue in WDM optical networks which carry huge amount of traffic aggregated from Internet protocol (IP), asynchronous transfer mode (ATM) and SDH/SONET layers. The problem, however, has been proved NP-hard. The time complexity and the optimality of solutions are two conflicting metrics. In addition, for optimization purposes, capacity utilization and network congestion level can be compromised to reduce the blocking probability of future connections. In this paper, we propose a heuristic approach for WR in large scale networks based on a balanced model developed for the capacity utilization and the congestion level. This is a two step approach, i.e K shortest paths (KSP) algorithm and a path selection algorithm (PSA), and is applicable not only at network design phase but also for online provisioning where a number of traffic connections may be requested simultaneously. We investigate the time complexity and the optimality of solutions as metrics for comparing our approach and the ILP formulation for wavelength routing. Simulation results show that our approach yields very promising results in terms of the optimality of solutions whilst also applicable to very large scale networks, say 500 nodes or more","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129513374","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}

引用次数: 5