In a distributed multimedia information system (DIMS), synchronization issues involved in the end-to-end presentation of multimedia data can be grouped into three levels, the source, network and user-interface. This paper describes a progressive retrieval strategy which sequentially retrieves independent synchronized entities from the multimedia database. The paper also presents an architecture for the presentation agent which performs the playback of multimedia documents.
{"title":"A presentation agent for a distributed multimedia system over high speed networks","authors":"J. Rody, A. Karmouch","doi":"10.1109/ICC.1995.525232","DOIUrl":"https://doi.org/10.1109/ICC.1995.525232","url":null,"abstract":"In a distributed multimedia information system (DIMS), synchronization issues involved in the end-to-end presentation of multimedia data can be grouped into three levels, the source, network and user-interface. This paper describes a progressive retrieval strategy which sequentially retrieves independent synchronized entities from the multimedia database. The paper also presents an architecture for the presentation agent which performs the playback of multimedia documents.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123491134","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}
Universal access to the Information Superhighway infrastructure is a major principle advanced by the Canadian government to guide the development and implementation of the infrastructure. The ultimate aim of this information revolution is to ensure that everyone will have access to information, anytime, anywhere, at reasonable cost. To this end, satellites are uniquely qualified to ensure universal access to the infrastructure, for the cost of wiring every home, office, hospital, library, and school in many areas not currently served by terrestrial digital networks would be prohibitive. In addition, satellite communications is at a crucial juncture, in that new advanced satellite system designs will dramatically change the cost-structure of satellite communications, making it affordable to residential users. An advanced satcom concept is introduced which could provide a very large user base with small, easy-to-install, low-cost, high-rate terminals, while meeting the high performance requirements associated with wideband multimedia applications.
{"title":"The role of satellites in the Information Superhighway","authors":"A. Grami, K. Gordon, A. Shoamanesh","doi":"10.1109/ICC.1995.524467","DOIUrl":"https://doi.org/10.1109/ICC.1995.524467","url":null,"abstract":"Universal access to the Information Superhighway infrastructure is a major principle advanced by the Canadian government to guide the development and implementation of the infrastructure. The ultimate aim of this information revolution is to ensure that everyone will have access to information, anytime, anywhere, at reasonable cost. To this end, satellites are uniquely qualified to ensure universal access to the infrastructure, for the cost of wiring every home, office, hospital, library, and school in many areas not currently served by terrestrial digital networks would be prohibitive. In addition, satellite communications is at a crucial juncture, in that new advanced satellite system designs will dramatically change the cost-structure of satellite communications, making it affordable to residential users. An advanced satcom concept is introduced which could provide a very large user base with small, easy-to-install, low-cost, high-rate terminals, while meeting the high performance requirements associated with wideband multimedia applications.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123612894","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 detector based on a practical nonlinear model for digital magnetic recording channels is described. The nonlinear model is easy to construct from simple measurements of the isolated transition response and dipulse responses. The new detector has a structure similar to that of the decision feedback equalizer (DFE) except that an add-on nonlinear canceler is used to cancel the trailing nonlinear intersymbol interference (ISI) and a pattern dependent threshold is employed to handle the precursor nonlinear ISI. We compare the detection performance of this new detector with that of the DFE on several experimental channels. The results show that the new detector yields significant performance improvement over its counterpart as measured by the detection signal to noise ratio (SNR).
{"title":"Decision feedback equalizer with pattern dependent threshold for magnetic recording channels","authors":"W. Zeng, J. Moon","doi":"10.1109/ICC.1995.524255","DOIUrl":"https://doi.org/10.1109/ICC.1995.524255","url":null,"abstract":"A new detector based on a practical nonlinear model for digital magnetic recording channels is described. The nonlinear model is easy to construct from simple measurements of the isolated transition response and dipulse responses. The new detector has a structure similar to that of the decision feedback equalizer (DFE) except that an add-on nonlinear canceler is used to cancel the trailing nonlinear intersymbol interference (ISI) and a pattern dependent threshold is employed to handle the precursor nonlinear ISI. We compare the detection performance of this new detector with that of the DFE on several experimental channels. The results show that the new detector yields significant performance improvement over its counterpart as measured by the detection signal to noise ratio (SNR).","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123185924","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 compares the link capacity between GSM and CDMA. Viterbi's paper (see IEEE Journal on Selected Areas in Communications, October 1994) analyzed the CDMA link capacity and found that it can be extended due to the soft handoff operation. When calculating the link budget of CDMA, there is about a 4 dB advantage realistically by utilizing a selective diversity between two neighboring cells in the soft handoff region. A new idea has come from GSM operators that uses a ping-pong handoff arrangement in one handoff region which can achieve the same selective diversity between two neighboring cells. This paper analyzes the performance of this arrangement.
本文对GSM和CDMA的链路容量进行了比较。Viterbi的论文(参见IEEE Journal on Selected Areas in Communications, 1994年10月)分析了CDMA链路容量，发现由于软切换操作，它可以被扩展。在计算CDMA的链路预算时，利用软切换区域两个相邻小区之间的选择性分集，实际上有大约4 dB的优势。GSM运营商提出了一种新的想法，在一个切换区域使用乒乓切换安排，可以在两个相邻的小区之间实现相同的选择分集。本文对这种安排的性能进行了分析。
{"title":"Link capacities between GSM and CDMA","authors":"W.C.-Y. Lee","doi":"10.1109/ICC.1995.524421","DOIUrl":"https://doi.org/10.1109/ICC.1995.524421","url":null,"abstract":"This paper compares the link capacity between GSM and CDMA. Viterbi's paper (see IEEE Journal on Selected Areas in Communications, October 1994) analyzed the CDMA link capacity and found that it can be extended due to the soft handoff operation. When calculating the link budget of CDMA, there is about a 4 dB advantage realistically by utilizing a selective diversity between two neighboring cells in the soft handoff region. A new idea has come from GSM operators that uses a ping-pong handoff arrangement in one handoff region which can achieve the same selective diversity between two neighboring cells. This paper analyzes the performance of this arrangement.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123480829","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}
NetworkJae-Soo Kim, Sahng-Ho Park, Patrick W. Dowd, Nasser M. NasrabadiDepartment
The channel assignment problem has become increasingly important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal assignment problem of channels has become increasingly important. Two optimization methods, the neural networks and the genetic algorithms are applied to the channel assignment problem. To avoid falling into the local minima in the neural networks, certain techniques such as forced assignment and changing the cell list order, are used. In the genetic algorithms approach, the proper genetic operators are developed. All three constraints are also considered for the channel assignments: the co-channel constraint, the adjacent channel constraint and the co-site channel constraint. As simulation results, the average iteration (or generation) numbers, the convergence rates and the CPU times according to the various techniques for the two approaches are presented and compared.
{"title":"Comparison of two optimization techniques for channel assignment in cellular radio network","authors":"NetworkJae-Soo Kim, Sahng-Ho Park, Patrick W. Dowd, Nasser M. NasrabadiDepartment","doi":"10.1109/ICC.1995.524518","DOIUrl":"https://doi.org/10.1109/ICC.1995.524518","url":null,"abstract":"The channel assignment problem has become increasingly important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal assignment problem of channels has become increasingly important. Two optimization methods, the neural networks and the genetic algorithms are applied to the channel assignment problem. To avoid falling into the local minima in the neural networks, certain techniques such as forced assignment and changing the cell list order, are used. In the genetic algorithms approach, the proper genetic operators are developed. All three constraints are also considered for the channel assignments: the co-channel constraint, the adjacent channel constraint and the co-site channel constraint. As simulation results, the average iteration (or generation) numbers, the convergence rates and the CPU times according to the various techniques for the two approaches are presented and compared.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"1995 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130385241","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 a high-speed backbone network, each node may act as a router/gateway which connects several LANs as well as hosts. Usually, the routers/gateways might incur congestion due to the transmission rates between the high-speed backbone and the low-speed LANs being mismatched. Because the existance of high-speed LANs becomes possible, the congestion may occur on the routers owing to the limitation of transmission rate to access the backbone network and available buffer spaces on it. To release the congestion, it is desirable to have some congestion control algorithms for the routers. In this paper, we propose a simple and efficient congestion control MAC protocol for dual bus high-speed networks. Based on this protocol, all the buffers in the network can be fully shared so that the transmission rate of each node is proportional to its load. In other words, a heavy loaded node obtains a faster transmission rate to send the packets in its buffer so that the congestion can be prevented. At the same time, each of the uncongested nodes will slow down its transmission and store the new incoming messages into its buffer. This implies that the buffers on the network can be shared dynamically. Simulation results show that compared to the DQDB MAC protocol, the proposed protocol significantly reduces the message queueing delay and message loss rate, and provides an attractive high throughput in the backbone network.
{"title":"A waste-free congestion control scheme for dual bus high-speed networks","authors":"N. Huang, Shiann-Tsong Sheu","doi":"10.1109/ICC.1995.524240","DOIUrl":"https://doi.org/10.1109/ICC.1995.524240","url":null,"abstract":"In a high-speed backbone network, each node may act as a router/gateway which connects several LANs as well as hosts. Usually, the routers/gateways might incur congestion due to the transmission rates between the high-speed backbone and the low-speed LANs being mismatched. Because the existance of high-speed LANs becomes possible, the congestion may occur on the routers owing to the limitation of transmission rate to access the backbone network and available buffer spaces on it. To release the congestion, it is desirable to have some congestion control algorithms for the routers. In this paper, we propose a simple and efficient congestion control MAC protocol for dual bus high-speed networks. Based on this protocol, all the buffers in the network can be fully shared so that the transmission rate of each node is proportional to its load. In other words, a heavy loaded node obtains a faster transmission rate to send the packets in its buffer so that the congestion can be prevented. At the same time, each of the uncongested nodes will slow down its transmission and store the new incoming messages into its buffer. This implies that the buffers on the network can be shared dynamically. Simulation results show that compared to the DQDB MAC protocol, the proposed protocol significantly reduces the message queueing delay and message loss rate, and provides an attractive high throughput in the backbone network.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130525585","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 execution time of Dijkstra's (1959) algorithm for shortest path routing strongly depends upon the underlying priority queue data structure used to store intermediate path costs for the graph during the algorithm's iterations. In particular, the efficiency is determined by how quickly the data structure can execute the operations of EXTRACT-MIN and DECREASE-KEY. Using Dijkstra's algorithm on graphs of various sizes and topologies, this paper compares the actual performance of the standard implicit binary heap with that of several proposed data structures: the binomial heap, relaxed heap, run relaxed heap, Fibonacci heap and splay tree. In particular, we compare the data structures' performance of the key operations, EXTRACT-MIN and DECREASE-KEY.
{"title":"Fast data structures for shortest path routing: a comparative evaluation","authors":"G. Oberhauser, R. Simha","doi":"10.1109/ICC.1995.524471","DOIUrl":"https://doi.org/10.1109/ICC.1995.524471","url":null,"abstract":"The execution time of Dijkstra's (1959) algorithm for shortest path routing strongly depends upon the underlying priority queue data structure used to store intermediate path costs for the graph during the algorithm's iterations. In particular, the efficiency is determined by how quickly the data structure can execute the operations of EXTRACT-MIN and DECREASE-KEY. Using Dijkstra's algorithm on graphs of various sizes and topologies, this paper compares the actual performance of the standard implicit binary heap with that of several proposed data structures: the binomial heap, relaxed heap, run relaxed heap, Fibonacci heap and splay tree. In particular, we compare the data structures' performance of the key operations, EXTRACT-MIN and DECREASE-KEY.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"393 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124667102","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}
Proposes a new media-access protocol for WDM star coupler networks of which the stations have arbitrary distances to the star coupler. The network architecture is called CC-FTFT-FRTR, in which each station sends packets at a unique wavelength using a fixed-tuned transmitter and receives packets using a tunable receiver. The authors propose a novel synchronization scheme which allows stations to have arbitrary (or dynamic) propagation delays to the star coupler. In addition, a new control signalling scheme is also presented to lower the signalling bandwidth demand. A new protocol, called systolic sliding windows (SSW), can yield the same throughput as the protocols in Chen and Yum (1991) and Chipalkatti et al. (1993); compared to the conventional approach that extra delay lines are used to make all stations have the same propagation delay to the star coupler, this protocol is capable of coping with the dynamic change of propagation delays from the stations to the star coupler, incurs less network delay, and requires no accurate measurement of propagation delays from stations to the star coupler. It is the first single-hop protocol based on CC-FTFT-FRTR structure that can achieve higher throughput than DT-WDMA for networks of which the stations can have arbitrary or dynamic propagation delays to the star coupler.
{"title":"A media-access protocol for WDM star-coupler networks with non-equidistant stations","authors":"Duanyang Guo, A. Zhang","doi":"10.1109/ICC.1995.524306","DOIUrl":"https://doi.org/10.1109/ICC.1995.524306","url":null,"abstract":"Proposes a new media-access protocol for WDM star coupler networks of which the stations have arbitrary distances to the star coupler. The network architecture is called CC-FTFT-FRTR, in which each station sends packets at a unique wavelength using a fixed-tuned transmitter and receives packets using a tunable receiver. The authors propose a novel synchronization scheme which allows stations to have arbitrary (or dynamic) propagation delays to the star coupler. In addition, a new control signalling scheme is also presented to lower the signalling bandwidth demand. A new protocol, called systolic sliding windows (SSW), can yield the same throughput as the protocols in Chen and Yum (1991) and Chipalkatti et al. (1993); compared to the conventional approach that extra delay lines are used to make all stations have the same propagation delay to the star coupler, this protocol is capable of coping with the dynamic change of propagation delays from the stations to the star coupler, incurs less network delay, and requires no accurate measurement of propagation delays from stations to the star coupler. It is the first single-hop protocol based on CC-FTFT-FRTR structure that can achieve higher throughput than DT-WDMA for networks of which the stations can have arbitrary or dynamic propagation delays to the star coupler.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116532991","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 scheme for VBR video coding is proposed where encoding bandwidth can be renegotiated between the encoder and the network during the duration of a call. Renegotiation can be initiated by either the encoder or the network. The encoder's bandwidth requirement is characterized by a usage parameter control (UPC) set consisting of peak rate, burst length and sustained rate. An adaptive encoder rate-control algorithm at the network interface card (NIC) computes the necessary UPC parameters to maintain the user specified quality-of-service (QoS). The network may, optionally, set a lower UPC value to deal with congestion. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results suggest that dynamic band-width renegotiation could provide significant quality gains and/or bandwidth savings with graceful degradation during renegotiation transients, even in the presence of relatively large feedback delay.
{"title":"VBR MPEG video coding with dynamic bandwidth renegotiation","authors":"D. Reininger, G. Ramamurthy, D. Raychaudhuri","doi":"10.1109/ICC.1995.524504","DOIUrl":"https://doi.org/10.1109/ICC.1995.524504","url":null,"abstract":"A scheme for VBR video coding is proposed where encoding bandwidth can be renegotiated between the encoder and the network during the duration of a call. Renegotiation can be initiated by either the encoder or the network. The encoder's bandwidth requirement is characterized by a usage parameter control (UPC) set consisting of peak rate, burst length and sustained rate. An adaptive encoder rate-control algorithm at the network interface card (NIC) computes the necessary UPC parameters to maintain the user specified quality-of-service (QoS). The network may, optionally, set a lower UPC value to deal with congestion. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results suggest that dynamic band-width renegotiation could provide significant quality gains and/or bandwidth savings with graceful degradation during renegotiation transients, even in the presence of relatively large feedback delay.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115069808","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}
We describe our investigation on ATM over satellite, where we focus on the impact of the bit error characteristics of a satellite link on ATM. We first analyze the ATM header error correction (HEC) mechanism and calculate the ATM quality of service (QoS) parameters such as the cell loss ratio, the cell error rate, and the cell insertion rate for a satellite link. This analysis was verified by experiments, where a good agreement between the analytical and the experimental results was achieved. We also suggest possible solutions to overcome the problems caused by burst errors.
{"title":"ATM over satellite: analysis of ATM QoS parameters","authors":"S. Ramseier, T. Kaltenschnee","doi":"10.1109/ICC.1995.524464","DOIUrl":"https://doi.org/10.1109/ICC.1995.524464","url":null,"abstract":"We describe our investigation on ATM over satellite, where we focus on the impact of the bit error characteristics of a satellite link on ATM. We first analyze the ATM header error correction (HEC) mechanism and calculate the ATM quality of service (QoS) parameters such as the cell loss ratio, the cell error rate, and the cell insertion rate for a satellite link. This analysis was verified by experiments, where a good agreement between the analytical and the experimental results was achieved. We also suggest possible solutions to overcome the problems caused by burst errors.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133828574","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
扫码关注我们
求助内容：
应助结果提醒方式：