{"title":"Dynamic multicast routing for distributing hierarchically encoded video data","authors":"Hwa-Chun Lin, Mei-Yu Liu","doi":"10.1109/GLOCOM.1998.776629","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776629","url":null,"abstract":"In this paper, the dynamic multicast routing problem for distributing hierarchically encoded video data is studied. The video signal is encoded hierarchically into a number of layers with the first layer containing the essential information such that the least capable receivers can reconstruct the video signal with lower quality. Each of the higher layers contains information which can further enhance the quality of the video signal. The cost associated with a network link is dependent on the number of layers of video signal it is carrying. The nodes in the network may be allowed to join or leave the multicast connection dynamically for some network applications. The problem is to find a path to attach a node which wishes to join the multicast connection to the existing multicast tree such that a certain performance measure is optimized. Two heuristic algorithms, namely, shortest path minimum additional cost (SP-MAC) and minimum additional cost (MAC) algorithms are proposed for this problem. The performances of the proposed algorithms are compared with those of the shortest path and dynamic greedy algorithms by extensive simulations. Our results show that the proposed algorithms outperform the shortest path and dynamic greedy algorithms.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127447344","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}
{"title":"RRR: recursive round robin scheduler","authors":"R. Garg, Xiaoqiang Chen","doi":"10.1109/GLOCOM.1998.775767","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775767","url":null,"abstract":"Scheduling has been an interesting problem since its inception. In the context of real-time networks, a scheduling algorithm is concerned with dispatching streams of packets sharing the same bandwidth such that certain guaranteed performance for each stream like rate and delay bound is provided. This function has a wide range of applications in network elements such as host adaptors, routers and switches. This paper proposes and describes a new scheduling algorithm named as recursive round robin (RRR) scheduler for scheduling fixed sized packets. It is based on the concept of the construction of a scheduling tree in which distinct cell streams are scheduled recursively. Special emphasis is placed on the design and analysis of the scheduler. A delay bound is analytically derived for the scheduler and verified using simulation. It is shown that the work conserving version of the scheduler is fair. Fairness indexes for the work conserving scheduler are analytically derived. The simple nature of this algorithm makes it possible to implement it at very high speeds, while considerably reducing the implementation cost.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125090200","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}
{"title":"On the support of bandwidth on demand service over wide-area WDM optical networks","authors":"N. Huang, Yao-Tzung Wang, Bo Li, Te-Lung Liu","doi":"10.1109/GLOCOM.1998.775753","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775753","url":null,"abstract":"Future broadband networks must support integrated services and offer flexible bandwidth usage. Most existing proposals for wide-area wavelength division multiplexed (WDM) networks employ circuit switching adopting the concept of lightpath, in which each circuit or lightpath occupies an entire wavelength. This, however, is not suited for end-to-end transport of information streams, typically with each stream having its unique traffic characteristics such as the bandwidth needed, different traffic bursty nature, and diverse service requirements. We explore the extensions of the functions of what we refer as the optical link control (OLC) layer, native on top of optical layer, to offer finer granularity of wavelength usage and further enable the possibility of bandwidth on-demand (BoD) service directly over WDM networks. The objective is to facilitate the support of integrated services over WDM networks and to mitigate the changes needed in the upper layers as well. The proposed approach attempts to exploit the strengths of both optics and electronics, in which packets are either routed end-to-end over a lightpath transparently, or forwarded from wavelength to wavelength by electronic switching, whenever required. Furthermore, in order to establish an end-to-end BoD connection, the issue of how to select the best wavelength to route the given connection is also investigated. The effectiveness of the proposal is evaluated by simulation.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125137520","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}
{"title":"New state dependent multicast routing for single rate loss networks","authors":"C. Cheung, D. Tsang, S. Gupta","doi":"10.1109/GLOCOM.1998.776884","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776884","url":null,"abstract":"In this paper, we investigate the dynamic multicast routing problem for single rate loss networks and briefly discuss the dynamic multicast routing algorithm called least load multicast routing (LLMR). We propose a new multicast routing algorithm called maximum mean number of new calls accepted before blocking multicast routing (MCBMR), which can more accurately reflect the current and future loading of a network. Simulation results show that this algorithm, compared with LLMR, not only has a smaller network revenue loss, but also results in smaller call blocking probabilities for all classes of traffic.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166769","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}
{"title":"Carrier recovery scheme for on-board demodulation suited to low E/sub b//N/sub 0/","authors":"C. Morlet, M. Boucheret, I. Buret","doi":"10.1109/GLOCOM.1998.775839","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775839","url":null,"abstract":"In this paper we describe and analyse new feedforward synchronization algorithms suited to on-board digital implementation. Both algorithms studied here (for phase and frequency recovery) have the particularity to perform all calculations in polar coordinates and so to reduce complexity of implementation. A phase estimator operating at very low SNR with no frequency offset is defined. Its performances are close to the Viterbi and Viterbi algorithm. A frequency estimator based on the previous phase estimator is also presented and analysed.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123225114","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}
{"title":"An object-based network simulator","authors":"M. Guo, D. Hoang","doi":"10.1109/GLOCOM.1998.776653","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776653","url":null,"abstract":"The investigation and simulation study of network problems requires substantial amount of effort devoted to implementations of a common network. The paper presents the development of an object-based simulator. In particular, a simulation environment is developed to facilitate a simulation study of computer network problems. The developed simulation environment serves the purpose by providing facilities to assist modeler in preparing simulation configuration, control for running of simulations and graphical result analysis. The simulation system is portable and allows components developed by different modellers to be shared and thus achieved reusability and flexibility.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123579303","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}
{"title":"A novel channel estimation strategy with chaotic coded signals","authors":"A. Muller, J. Elmirghani","doi":"10.1109/GLOCOM.1998.776467","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776467","url":null,"abstract":"A novel dynamic based deconvolution (DBD) algorithm is presented that can be exploited in blind channel estimation as well as in non-blind applications like echo cancellation in telephony circuits. For generating the chaotic signal the unimodal logistic map is employed while the channel is represented by an autoregressive (AR) model. The applicability is demonstrated in a speech transmission scenario using chaotic coded speech showing a modelling misadjustment improvement (MMI) of 24 dB/100 iterations which is 6 fold that obtained by the LMS for a 128 tap digital adaptive filter (DAF) using a white noise (WN) process.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115508974","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}
{"title":"Associative RAM-based CAM applicable to packet-based broadband systems","authors":"S. Kartalopoulos","doi":"10.1109/GLOCOM.1998.776600","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776600","url":null,"abstract":"Content addressable memories (CAM) are devices for fast pattern recognition of a limited set, as opposed to random access memories (RAM) that execute slow pattern recognition of a large set of patterns. Associative RAM-based content addressable memories (AR-CAM) combine fast pattern recognition and very large pattern sets. In this paper, we describe the applicability of AR-CAMs to ultra-high speed packet-based broadband communications systems with aggregate bandwidths of hundreds of Gbps, such as ATM and Internet.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122379036","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}
{"title":"Channel estimation for wireless OFDM systems","authors":"V. K. Jones, G.C. Raleigh","doi":"10.1109/GLOCOM.1998.776875","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776875","url":null,"abstract":"A channel estimation technique is developed for an OFDM system with multiple transmit and multiple receive antennas. The approach exploits the channel structure in the time domain and the frequency domain. The method is appropriate for OFDM systems operating in a time varying channel. A multi-input-multi-output OFDM (MOFDM) system model is defined, followed by a proposed excitation strategy for sufficient identification of the channel. The estimation strategy is shown to be optimal within the class of linear MMSE estimators. Experimental results of the algorithm are provided.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122380100","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}
{"title":"MPEG video frame discard by fuzzy control","authors":"A. Genco, G. Lombardo","doi":"10.1109/GLOCOM.1998.777067","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.777067","url":null,"abstract":"An expert fuzzy system is discussed which is capable of preventing frame cutting by switching devices. The discussion is driven according to the guidelines of an ATM contract for MPEG video transmission. Quality of service and real time constraints are assumed as the requirement for a traffic shaper whose main task is to avoid congestion. By means of fuzzy logic the traffic shaper receives the incoming MPEG frames sequence, estimates the current degree of congestion, and decides whether to cut some frames according to their influence on the visual result. Its goal is to cut as few frames as possible on the least wasted sequences.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711882","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}