Pub Date : 1997-06-23DOI: 10.1109/HPCS.1997.864024
David K. Y. Yau, S. Lam
In part due to the emergence of continuous media applications having real-time constraints, networking with quality of service (QoS) guarantees has become an increasingly important goal. Towards this goal, we present an end system architecture with the following major components: (1) adaptive rate-controlled (ARC) scheduling for time shared resources in an end system, such as CPTJ and network interface, (2) a framework of Migrating Sockets for user level protocols that minimizes hidden scheduling in protocol processing, and (3) based. on "exclusive" packet receiver information exported by Migrating Sockets, a constant overhead packet demultiplexing mechanism suitable for wide area internetwork communication (active demultiplexing). We have an implementation of our architecture in Solaris 2.5.
{"title":"End system support for networking with quality of service guarantees","authors":"David K. Y. Yau, S. Lam","doi":"10.1109/HPCS.1997.864024","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864024","url":null,"abstract":"In part due to the emergence of continuous media applications having real-time constraints, networking with quality of service (QoS) guarantees has become an increasingly important goal. Towards this goal, we present an end system architecture with the following major components: (1) adaptive rate-controlled (ARC) scheduling for time shared resources in an end system, such as CPTJ and network interface, (2) a framework of Migrating Sockets for user level protocols that minimizes hidden scheduling in protocol processing, and (3) based. on \"exclusive\" packet receiver information exported by Migrating Sockets, a constant overhead packet demultiplexing mechanism suitable for wide area internetwork communication (active demultiplexing). We have an implementation of our architecture in Solaris 2.5.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116924000","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864042
D. Polemi, J. Koulouris, J. Angelopoulos
The prohibitive cost of dedicated fiber local loops for residential customers led to the development of passive optical networks (PONs) for access to broadband services. However the passive splitting of optical signals which gives flexibility, low cost and robustness creates a broadcast physical topology compromising customer privacy. Encryption is the only cost-effective way to prohibit global reception and create the required point-to point logical links restoring confidentiality to the desirable degree. Because of the very high speed of such networks, only solutions amenable to hardware implementations are acceptable. ATM cells are allocated to the system users on a time division basis each encrypted with a different key. A suitable for the PON environment encryption solution based on the summation generator stream cipher is presented with an outline of its hardware implementation.
{"title":"An encryption scheme for high speed passive optical networks","authors":"D. Polemi, J. Koulouris, J. Angelopoulos","doi":"10.1109/HPCS.1997.864042","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864042","url":null,"abstract":"The prohibitive cost of dedicated fiber local loops for residential customers led to the development of passive optical networks (PONs) for access to broadband services. However the passive splitting of optical signals which gives flexibility, low cost and robustness creates a broadcast physical topology compromising customer privacy. Encryption is the only cost-effective way to prohibit global reception and create the required point-to point logical links restoring confidentiality to the desirable degree. Because of the very high speed of such networks, only solutions amenable to hardware implementations are acceptable. ATM cells are allocated to the system users on a time division basis each encrypted with a different key. A suitable for the PON environment encryption solution based on the summation generator stream cipher is presented with an outline of its hardware implementation.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116077077","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864025
Constantinos Vassilakis, M. Paterakis, P. Triantafillou
A large scale, distributed video-on-demand (VOD) system allows geographically dispersed residential and business users to access video services, such as movies and other multimedia programs or documents on demand from video servers on a high speed network. In this paper we demonstrate through analysis and simulation the need for a hierarchical architecture for the video-on-demand distribution network. We assume a hierarchical architecture, which fits the existing tree topology used in today's cable TV (CATV) hybrid fiber/coaxial (HFC) distribution networks. We develop a model for the design, configuration, program placement and performance evaluation of such systems. The model takes into account the user behavior, the fact that the user re quests are transmitted over a shared channel before reaching the video server containing the requested program, the finite input/output (I/O) capacity of the video servers, the exponential storage cost of the multimedia programs imposed by the adopted architecture of the video-on-demand distribution network, and finally the communication cost. In addition, our model allows batching of user requests at the video server and we study the effect of batching on the performance of the video server and on the delivered to the user Quality of Service (QoS). The design and evaluation is based on an extensive analytical and simulation study. The results in this paper contribute to the understanding of the tradeoffs between quality of service, server I/O, storage required, program placement, and commu nication cost. They are helpful in configuring the VOD dis tribution network, optimally placing the programs across the hierarchy of the video servers, and maximizing the performance of the overall system.
{"title":"Modeling, design and performance evaluation of interactive distributed video-on-demand systems","authors":"Constantinos Vassilakis, M. Paterakis, P. Triantafillou","doi":"10.1109/HPCS.1997.864025","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864025","url":null,"abstract":"A large scale, distributed video-on-demand (VOD) system allows geographically dispersed residential and business users to access video services, such as movies and other multimedia programs or documents on demand from video servers on a high speed network. In this paper we demonstrate through analysis and simulation the need for a hierarchical architecture for the video-on-demand distribution network. We assume a hierarchical architecture, which fits the existing tree topology used in today's cable TV (CATV) hybrid fiber/coaxial (HFC) distribution networks. We develop a model for the design, configuration, program placement and performance evaluation of such systems. The model takes into account the user behavior, the fact that the user re quests are transmitted over a shared channel before reaching the video server containing the requested program, the finite input/output (I/O) capacity of the video servers, the exponential storage cost of the multimedia programs imposed by the adopted architecture of the video-on-demand distribution network, and finally the communication cost. In addition, our model allows batching of user requests at the video server and we study the effect of batching on the performance of the video server and on the delivered to the user Quality of Service (QoS). The design and evaluation is based on an extensive analytical and simulation study. The results in this paper contribute to the understanding of the tradeoffs between quality of service, server I/O, storage required, program placement, and commu nication cost. They are helpful in configuring the VOD dis tribution network, optimally placing the programs across the hierarchy of the video servers, and maximizing the performance of the overall system.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122336345","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864033
L. Rizzo, L. Vicisano
Applications requiring the reliable distribution of data to groups of clients would be supported perfectly by reliable multicast protocols. In many cases, the problem of congestion control (a major research issue otherwise) does not exist because downlink bandwidth is "owned" or can be preallocated to a particular server by independent means, but the problems of insuring reliable data delivery to larcre groups, and adaptability to heterogeneous clients, still remain. These problems can be solved at once with the use of FEC techniques. In this paper we show the design of a Reliable Multicast data Distribution Protocol (RMDP) that we have built using these techniques, and discuss the implementation tradeoffs. Experimental results show that, albeit somewhat expensive, doing encoding/decoding in software is affordable for speeds in the Mbit/s range even on low-end PCs. Slower machines can still receive at high speed, thus optimizing network usage, by taking advantage of the fact that decoding needs not to be done in real time. Finally, our RMDP can work even without any feedback from the receivers, thus making it well suited to mobile/wireless systems.
{"title":"A reliable multicast data distribution protocol based on software FEC techniques","authors":"L. Rizzo, L. Vicisano","doi":"10.1109/HPCS.1997.864033","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864033","url":null,"abstract":"Applications requiring the reliable distribution of data to groups of clients would be supported perfectly by reliable multicast protocols. In many cases, the problem of congestion control (a major research issue otherwise) does not exist because downlink bandwidth is \"owned\" or can be preallocated to a particular server by independent means, but the problems of insuring reliable data delivery to larcre groups, and adaptability to heterogeneous clients, still remain. These problems can be solved at once with the use of FEC techniques. In this paper we show the design of a Reliable Multicast data Distribution Protocol (RMDP) that we have built using these techniques, and discuss the implementation tradeoffs. Experimental results show that, albeit somewhat expensive, doing encoding/decoding in software is affordable for speeds in the Mbit/s range even on low-end PCs. Slower machines can still receive at high speed, thus optimizing network usage, by taking advantage of the fact that decoding needs not to be done in real time. Finally, our RMDP can work even without any feedback from the receivers, thus making it well suited to mobile/wireless systems.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124329151","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864041
G. Troullinos
A flexible Digital Signal Processing (DSP) oriented approach for implementing secure facsimile (fax) communications systems is presented. The signal processing techniques for fax coding, data encryption, and automatic cryptographic key management based on Public Key cryptography are discussed. The proposed system architecture can exploit the latest advances in DSP microprocessor technology to offer lower cost, reduced size, and higher performance cryptosystems. This approach was successfully adopted by Intracom S.A. in the design and implementation of the Secline-Fax secure fax communications system.
{"title":"Digital signal processing techniques and architectures in secure facsimile communications","authors":"G. Troullinos","doi":"10.1109/HPCS.1997.864041","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864041","url":null,"abstract":"A flexible Digital Signal Processing (DSP) oriented approach for implementing secure facsimile (fax) communications systems is presented. The signal processing techniques for fax coding, data encryption, and automatic cryptographic key management based on Public Key cryptography are discussed. The proposed system architecture can exploit the latest advances in DSP microprocessor technology to offer lower cost, reduced size, and higher performance cryptosystems. This approach was successfully adopted by Intracom S.A. in the design and implementation of the Secline-Fax secure fax communications system.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124910323","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864043
G. Prezerakos, C. D. Anagnostakis, I. Venieris
In this paper we provide a comprehensive methodology for the specification and design of broadband multiatedia telecommunication services with IN capabilities. Initially the key concepts of an integrated IN / B-ISDN architecture are presented aiming at the provision of novel multirnedia features such as the coordination of different calls in a session as well as call / connection separation. The paper proposes alternative ways of producing IN service models from the prose description of the services. Consequently we examine the available options for distributing service logic in the various network nodes followed by a discussion on service data tables and the specification of rnessage flows across interfaces. Finally a mapping from a formal service specification in SDL towards a an actual service design is provided by means of a Service Creation and Simulation Environment. Throughout the paper two services are used for providing practical examples of the proposed methodology - a Video on Demand (VoD) service which is a true IN service and a Broadband Video Conference Service (B-VC) which is based on an existing implementation originally targeted for a TCP IP network platform.
{"title":"Broadband multimedia services design and implementation exploiting IN features","authors":"G. Prezerakos, C. D. Anagnostakis, I. Venieris","doi":"10.1109/HPCS.1997.864043","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864043","url":null,"abstract":"In this paper we provide a comprehensive methodology for the specification and design of broadband multiatedia telecommunication services with IN capabilities. Initially the key concepts of an integrated IN / B-ISDN architecture are presented aiming at the provision of novel multirnedia features such as the coordination of different calls in a session as well as call / connection separation. The paper proposes alternative ways of producing IN service models from the prose description of the services. Consequently we examine the available options for distributing service logic in the various network nodes followed by a discussion on service data tables and the specification of rnessage flows across interfaces. Finally a mapping from a formal service specification in SDL towards a an actual service design is provided by means of a Service Creation and Simulation Environment. Throughout the paper two services are used for providing practical examples of the proposed methodology - a Video on Demand (VoD) service which is a true IN service and a Broadband Video Conference Service (B-VC) which is based on an existing implementation originally targeted for a TCP IP network platform.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114021864","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864039
M. Katevenis
Credit-based flow control (FQ offers significant advantages for data communication over networks such as ATM. One concern is the buffer memory requirement of credit FC, which is high when static, per-connection buffer allocation is used. The memory size can be reduced by dynamically sharing the buffer among the connections. We formulate and prove a new upper bound for the dynamically-shared buffer size, which applies when the downstream network guarantees that it will never throttle a connection down below a given minimum "draining" rate. This upper bound is inversely proportional to the minimum draining rate, and is independent of the number of connections. The minimum draining rate can be guaranteed by giving to the traffic arriving at a local area through long distance links priority over locally generated traffic in the use of a given fraction of the outgoing network capacity. In practical situations, the new upper bound can be made small, thus providing a new, additional method to reduce the buffer memory cost to a very small percentage of the link cost. Unlike other such methods, no link underutilization may occur and there is no rate ramp-up delay.
{"title":"Buffer requirements of credit-based flow control when a minimum draining rate is guaranteed","authors":"M. Katevenis","doi":"10.1109/HPCS.1997.864039","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864039","url":null,"abstract":"Credit-based flow control (FQ offers significant advantages for data communication over networks such as ATM. One concern is the buffer memory requirement of credit FC, which is high when static, per-connection buffer allocation is used. The memory size can be reduced by dynamically sharing the buffer among the connections. We formulate and prove a new upper bound for the dynamically-shared buffer size, which applies when the downstream network guarantees that it will never throttle a connection down below a given minimum \"draining\" rate. This upper bound is inversely proportional to the minimum draining rate, and is independent of the number of connections. The minimum draining rate can be guaranteed by giving to the traffic arriving at a local area through long distance links priority over locally generated traffic in the use of a given fraction of the outgoing network capacity. In practical situations, the new upper bound can be made small, thus providing a new, additional method to reduce the buffer memory cost to a very small percentage of the link cost. Unlike other such methods, no link underutilization may occur and there is no rate ramp-up delay.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115437954","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864032
J. Zissopoulos, J. Soldatos, E. Vayias, G. Branis, N. Mitrou
This paper presents an architecture for a multimedia application platform able to support real-time group communication activities (such as: Videophone, Teletraining, Computer Supported Collaborative Work) between remotely located members of groups by delivering multimedia communication capabilities directly at their personal computers ("desktops"). The paper focuses on a component-based design approach that gives the potential to integrate into the platform various Application Components (Audio, Video, Text chat, File transfer, Slide show, Shared Whiteboard or text editor, etc.) depending on the activity supported and thus permitting to customise the platform for the specilic activity. Apart from the basic architecture, alternative connection schemes depending on the capabilities of the network are surveyed. A discussion of the advantages and disadvantages of the described architecture is also given andfinally, an-implernentation aiming to support Teletraining activities is presented.
{"title":"An architecture for group communications-support networked multimedia applications","authors":"J. Zissopoulos, J. Soldatos, E. Vayias, G. Branis, N. Mitrou","doi":"10.1109/HPCS.1997.864032","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864032","url":null,"abstract":"This paper presents an architecture for a multimedia application platform able to support real-time group communication activities (such as: Videophone, Teletraining, Computer Supported Collaborative Work) between remotely located members of groups by delivering multimedia communication capabilities directly at their personal computers (\"desktops\"). The paper focuses on a component-based design approach that gives the potential to integrate into the platform various Application Components (Audio, Video, Text chat, File transfer, Slide show, Shared Whiteboard or text editor, etc.) depending on the activity supported and thus permitting to customise the platform for the specilic activity. Apart from the basic architecture, alternative connection schemes depending on the capabilities of the network are surveyed. A discussion of the advantages and disadvantages of the described architecture is also given andfinally, an-implernentation aiming to support Teletraining activities is presented.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121889800","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864026
C. Bisdikian, S. Brady, Y. Doganata, D. Foulger, F. Marconcini, M. Mourad, H. Operowsky, G. Pacifici, A. Tantawi
Contrary to the increasingly popularity of one-on-one interactions between subscribers of on-line services and the services they access, business transactions usually involve some sort of multi-party collaboration and interaction. Hence, for business oriented on-line services, multimedia versions of office environments and meeting-rooms need to be developed on desktop computers. These business environment recreations would allow people to collaborate remotely in virtual office surroundings existing only on their desktops and to meet and conduct business with their colleagues, peers, and business associates on-line.
{"title":"A web-based multimedia collaboration system","authors":"C. Bisdikian, S. Brady, Y. Doganata, D. Foulger, F. Marconcini, M. Mourad, H. Operowsky, G. Pacifici, A. Tantawi","doi":"10.1109/HPCS.1997.864026","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864026","url":null,"abstract":"Contrary to the increasingly popularity of one-on-one interactions between subscribers of on-line services and the services they access, business transactions usually involve some sort of multi-party collaboration and interaction. Hence, for business oriented on-line services, multimedia versions of office environments and meeting-rooms need to be developed on desktop computers. These business environment recreations would allow people to collaborate remotely in virtual office surroundings existing only on their desktops and to meet and conduct business with their colleagues, peers, and business associates on-line.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121899974","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 : 1997-06-23DOI: 10.1109/HPCS.1997.864034
M. Faloutsos, R. Panka, K. Sevcik
In the common multicast problem, it is funda mental that destinations receive exactly the same information. In this paper, we examine the heterogeneous problem where destinations receive subsets of common information. It is worth noting that this scenario can be met in practice in audio and video sessions, as long as the data is encoded with the hierarchical encoding scheme. In this paper, we focus on the case where each destination requires a specific subset of the total information. For this problem, we design polynomial algorithms that meet some efficiency criteria. Theoretical and experimental work demon strates the advantage of the proposed algorithms over previous solutions.
{"title":"Multicast routing with heterogeneous quality","authors":"M. Faloutsos, R. Panka, K. Sevcik","doi":"10.1109/HPCS.1997.864034","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864034","url":null,"abstract":"In the common multicast problem, it is funda mental that destinations receive exactly the same information. In this paper, we examine the heterogeneous problem where destinations receive subsets of common information. It is worth noting that this scenario can be met in practice in audio and video sessions, as long as the data is encoded with the hierarchical encoding scheme. In this paper, we focus on the case where each destination requires a specific subset of the total information. For this problem, we design polynomial algorithms that meet some efficiency criteria. Theoretical and experimental work demon strates the advantage of the proposed algorithms over previous solutions.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122187338","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
扫码关注我们
求助内容：
应助结果提醒方式：