Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700136
P. Sarigiannidis, M. Louta, D. Stratogiannis, Georgios I. Tsiropoulos
IEEE 802.16 (WiMAX) is considered as one of the most promising wireless access technologies supporting high-capacity and long-distance communications as well as user mobility. A problem that should be addressed in the context of multi-access communications is the efficient accommodation of traffic requests to the downlink subframe. The allocation operation in downlink sub-frame is not standardized, while only restrictions on the usage of downlink sub-frame's bandwidth are defined. The most noticeable restriction is the rectangular restriction, requiring all downlink allocations to be mapped in a two-dimensions rectangular shaping. This study is a first step towards defining a QoS-aware mapping scheme, prioritizing traffic requests in accordance with the strict delay requirements they pose. The mapping scheme applies horizon scheduling, permitting bursts to be scheduled efficiently and in a simple way, following the horizons as pilots. The QoS-aware mapping scheme is evaluated by means of simulation experiments, which indicate that the proposed scheme operates effectively and efficiently, by reducing the number of unserviced users and traffic requests, and the portion of the dropped real-time traffic.
{"title":"Towards a QoS-Aware IEEE 802.16 downlink sub-frame mapping scheme","authors":"P. Sarigiannidis, M. Louta, D. Stratogiannis, Georgios I. Tsiropoulos","doi":"10.1109/GLOCOMW.2010.5700136","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700136","url":null,"abstract":"IEEE 802.16 (WiMAX) is considered as one of the most promising wireless access technologies supporting high-capacity and long-distance communications as well as user mobility. A problem that should be addressed in the context of multi-access communications is the efficient accommodation of traffic requests to the downlink subframe. The allocation operation in downlink sub-frame is not standardized, while only restrictions on the usage of downlink sub-frame's bandwidth are defined. The most noticeable restriction is the rectangular restriction, requiring all downlink allocations to be mapped in a two-dimensions rectangular shaping. This study is a first step towards defining a QoS-aware mapping scheme, prioritizing traffic requests in accordance with the strict delay requirements they pose. The mapping scheme applies horizon scheduling, permitting bursts to be scheduled efficiently and in a simple way, following the horizons as pilots. The QoS-aware mapping scheme is evaluated by means of simulation experiments, which indicate that the proposed scheme operates effectively and efficiently, by reducing the number of unserviced users and traffic requests, and the portion of the dropped real-time traffic.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128223666","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700147
M. Huemer, Christian Hofbauer, J. Huber
The concept of using unique word (UW) prefixes instead of cyclic prefixes (CPs) is already well investigated for single carrier systems with frequency domain equalization (SC/FDE). In OFDM (orthogonal frequency division multiplexing), where the data symbols are specified in frequency domain, the introduction of UWs — which are specified in time domain — is not that straight forward. In this paper we show how unique words can also be introduced in OFDM symbols. In OFDM our proposed method introduces correlations between subcarrier symbols. This allows to apply a highly efficient LMMSE (linear minimum mean square error) receiver. Throughout this paper we discuss the similarities and differences of UW-SC/FDE and UW-OFDM transmitter/receiver processing, and we present simulation results in indoor multipath environments.
{"title":"Unique word prefix in SC/FDE and OFDM: A comparison","authors":"M. Huemer, Christian Hofbauer, J. Huber","doi":"10.1109/GLOCOMW.2010.5700147","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700147","url":null,"abstract":"The concept of using unique word (UW) prefixes instead of cyclic prefixes (CPs) is already well investigated for single carrier systems with frequency domain equalization (SC/FDE). In OFDM (orthogonal frequency division multiplexing), where the data symbols are specified in frequency domain, the introduction of UWs — which are specified in time domain — is not that straight forward. In this paper we show how unique words can also be introduced in OFDM symbols. In OFDM our proposed method introduces correlations between subcarrier symbols. This allows to apply a highly efficient LMMSE (linear minimum mean square error) receiver. Throughout this paper we discuss the similarities and differences of UW-SC/FDE and UW-OFDM transmitter/receiver processing, and we present simulation results in indoor multipath environments.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127294751","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700372
M. Seredynski, P. Bouvry
Reciprocity-based cooperation on packet relaying in mobile ad hoc networks discourages nodes from behaving selfishly. Before passing on a packet to the next hop a node verifies whether the sender of the packet is trustworthy (cooperative) or not. The quality of the evaluation of the trustworthiness relies on types of data used for description of the behaviour of the sender. In the literature a distinction was made between first-hand observations and observations obtained from third parties. This paper demonstrates that further distinction of such data into personal and general can help to create better protection against clique building among nodes. The former takes into account the status of packets originated by a node itself, while in the latter the status of packets originated by other nodes is considered. Computational experiments demonstrate that in the presence of a large number of selfish and colluding nodes prioritising the personal data improves the performance of cooperative nodes and creates a better defence against colluding free-riders.
{"title":"Trust management for collusion prevention in mobile ad hoc networks","authors":"M. Seredynski, P. Bouvry","doi":"10.1109/GLOCOMW.2010.5700372","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700372","url":null,"abstract":"Reciprocity-based cooperation on packet relaying in mobile ad hoc networks discourages nodes from behaving selfishly. Before passing on a packet to the next hop a node verifies whether the sender of the packet is trustworthy (cooperative) or not. The quality of the evaluation of the trustworthiness relies on types of data used for description of the behaviour of the sender. In the literature a distinction was made between first-hand observations and observations obtained from third parties. This paper demonstrates that further distinction of such data into personal and general can help to create better protection against clique building among nodes. The former takes into account the status of packets originated by a node itself, while in the latter the status of packets originated by other nodes is considered. Computational experiments demonstrate that in the presence of a large number of selfish and colluding nodes prioritising the personal data improves the performance of cooperative nodes and creates a better defence against colluding free-riders.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128983562","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700186
Tharinda Nishantha Vidanagama, H. Nakazato
Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as “living room TV”, “kitchen oven”, etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.
{"title":"Mobility in a description based clustered ad hoc network","authors":"Tharinda Nishantha Vidanagama, H. Nakazato","doi":"10.1109/GLOCOMW.2010.5700186","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700186","url":null,"abstract":"Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as “living room TV”, “kitchen oven”, etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993267","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700394
Vassilis Merekoulias, V. Pouli, Y. Rebahi, Sheila Becker, Krzysztof Cabaj, G. Aristomenopoulos, S. Papavassiliou
The proliferation and integration of communication networks in social life has increased the need for trusted systems of advanced and intelligent capabilities. Future networks are calling for new ways to efficient management, operation and service provisioning. Autonomicity becomes an enabler for self-manageability of future networks and therefore autonomic networking provides the necessary new paradigm for these networks to become manageable and scalable. Autonomic entities base their decision within a network on experience gathered and information exchanged. Trust management mechanisms can provide the necessary security framework in such an environment towards robust coherent autonomic networking. In this paper we present trust models and sketch a trust management architecture, applicable to complex future networking environments. We handle the special requirements set by autonomicity and try to strengthen the autonomic characteristics of the nodes as well as the robustness of service provisioning.
{"title":"A trust management architecture for autonomic Future Internet","authors":"Vassilis Merekoulias, V. Pouli, Y. Rebahi, Sheila Becker, Krzysztof Cabaj, G. Aristomenopoulos, S. Papavassiliou","doi":"10.1109/GLOCOMW.2010.5700394","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700394","url":null,"abstract":"The proliferation and integration of communication networks in social life has increased the need for trusted systems of advanced and intelligent capabilities. Future networks are calling for new ways to efficient management, operation and service provisioning. Autonomicity becomes an enabler for self-manageability of future networks and therefore autonomic networking provides the necessary new paradigm for these networks to become manageable and scalable. Autonomic entities base their decision within a network on experience gathered and information exchanged. Trust management mechanisms can provide the necessary security framework in such an environment towards robust coherent autonomic networking. In this paper we present trust models and sketch a trust management architecture, applicable to complex future networking environments. We handle the special requirements set by autonomicity and try to strengthen the autonomic characteristics of the nodes as well as the robustness of service provisioning.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130271784","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700283
Muhammed S. Khairy, Amin Khajeh, A. Eltawil, F. Kurdahi
In the widely used OFDM (Orthogonal Frequency Division Multiplexing) systems, the FFT and IFFT pair are integral parts used to modulate and demodulate the data constellation on the sub-carriers. Within such systems, embedded buffering memories occupy a large portion of the area and hence directly control the overall metrics of the system including power consumption and cost. This paper presents a unified statistical model that accurately reflects the impact of random embedded memory failures due to power management policies on the overall performance of an OFDM-based communication system. The proposed model expands the design space, by allowing the designer to replace the faulty hardware with perfect hardware while propagating the resulting distribution (due to voltage overscaling) through the system. The proposed framework enables system designers to efficiently and accurately determine the effectiveness of novel power management techniques and algorithms that are designed to manage both hardware failures and communication channel noise, without the added cost of lengthy system simulations that are inherently limited and suffer from lack of scalability.
{"title":"FFT processing through faulty memories in OFDM based systems","authors":"Muhammed S. Khairy, Amin Khajeh, A. Eltawil, F. Kurdahi","doi":"10.1109/GLOCOMW.2010.5700283","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700283","url":null,"abstract":"In the widely used OFDM (Orthogonal Frequency Division Multiplexing) systems, the FFT and IFFT pair are integral parts used to modulate and demodulate the data constellation on the sub-carriers. Within such systems, embedded buffering memories occupy a large portion of the area and hence directly control the overall metrics of the system including power consumption and cost. This paper presents a unified statistical model that accurately reflects the impact of random embedded memory failures due to power management policies on the overall performance of an OFDM-based communication system. The proposed model expands the design space, by allowing the designer to replace the faulty hardware with perfect hardware while propagating the resulting distribution (due to voltage overscaling) through the system. The proposed framework enables system designers to efficiently and accurately determine the effectiveness of novel power management techniques and algorithms that are designed to manage both hardware failures and communication channel noise, without the added cost of lengthy system simulations that are inherently limited and suffer from lack of scalability.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130511476","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700463
Yiting Liao, J. Gibson
This paper proposes a cross-layer approach called routing-aware multiple description coding with multipath transport to support video communications over mobile ad-hoc networks. This approach establishes a packet loss model based on the MAC access mechanism and network parameters, and utilizes it along with the routing messages from multipath routing to estimate the packet loss probability of transmitted video packets. Then the estimated results are passed to the application layer to assist reference frame selection for multiple description coding in order to mitigate error propagation introduced in the motion-compensated loop. Results show that this is an effective approach to improve error resilience of video transmission over mobile ad-hoc networks and enhance the video experience for multiple users.
{"title":"Routing-aware multiple description coding with multipath transport for video delivered over mobile ad-hoc networks","authors":"Yiting Liao, J. Gibson","doi":"10.1109/GLOCOMW.2010.5700463","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700463","url":null,"abstract":"This paper proposes a cross-layer approach called routing-aware multiple description coding with multipath transport to support video communications over mobile ad-hoc networks. This approach establishes a packet loss model based on the MAC access mechanism and network parameters, and utilizes it along with the routing messages from multipath routing to estimate the packet loss probability of transmitted video packets. Then the estimated results are passed to the application layer to assist reference frame selection for multiple description coding in order to mitigate error propagation introduced in the motion-compensated loop. Results show that this is an effective approach to improve error resilience of video transmission over mobile ad-hoc networks and enhance the video experience for multiple users.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131683434","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700190
K. Walkowiak
Streaming services have been gaining much popularity in the Internet. The widespread adoption of broadband residential access enables individual users to use new bandwidth demanding services. Peer-to-Peer (P2P) multicasting approach using an overlay network to provide communication between peers is a valuable proposal for streaming since it provides rapid deployment at relatively low cost. Most of previous research on optimization problems related to P2P multicasting is limited only to optimization of network flows. In this work we focus on a new problem of P2P multicasting network design, i.e. flows and links' capacity are optimized jointly. We assume that the P2P multicasting system is static with low membership change rate (e.g. corporate videoconferencing, distance learning, delivery of important messages). The objective is to minimize the overlay network cost. We propose an effective heuristic algorithm. Numerical experiments are run in order to examine the proposed method against optimal results and Lagrangean relaxation algorithm as well as to illustrate the dependency of the network cost on various parameters related to P2P multicasting. The proposed algorithm can be applied to a wide range of overlay network design problems including not only streaming services but also computing and storage systems using the overlay network approach.
{"title":"P2P multicasting network design problem — Heuristic approach","authors":"K. Walkowiak","doi":"10.1109/GLOCOMW.2010.5700190","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700190","url":null,"abstract":"Streaming services have been gaining much popularity in the Internet. The widespread adoption of broadband residential access enables individual users to use new bandwidth demanding services. Peer-to-Peer (P2P) multicasting approach using an overlay network to provide communication between peers is a valuable proposal for streaming since it provides rapid deployment at relatively low cost. Most of previous research on optimization problems related to P2P multicasting is limited only to optimization of network flows. In this work we focus on a new problem of P2P multicasting network design, i.e. flows and links' capacity are optimized jointly. We assume that the P2P multicasting system is static with low membership change rate (e.g. corporate videoconferencing, distance learning, delivery of important messages). The objective is to minimize the overlay network cost. We propose an effective heuristic algorithm. Numerical experiments are run in order to examine the proposed method against optimal results and Lagrangean relaxation algorithm as well as to illustrate the dependency of the network cost on various parameters related to P2P multicasting. The proposed algorithm can be applied to a wide range of overlay network design problems including not only streaming services but also computing and storage systems using the overlay network approach.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129231633","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700383
D. Wolinsky, A. Prakash, R. Figueiredo
“Give a man a fish, feed him for a day. Teach a man to fish, feed him for a lifetime” — Lau Tzu Grid computing projects such as TeraGrid [1], Grid'5000 [2], and OpenScience Grid [3] provide researchers access to vast amounts of compute resources, but in doing so, require the adaption of their workloads to the environments provided by these systems. Researchers do not have many alternatives as creating these types of systems involve coordination of distributed systems and expertise in networking, operating systems, security, and grid middleware. This results in many research groups creating small, in-house compute clusters where scheduling is often ad-hoc, thus limiting effective resource utilization. To address these challenges we present the “Grid Appliance.” The “Grid Appliance” enables researchers to seamlessly deploy, extend, and share their systems both locally and across network domains for both small and large scale computing grids. This paper details the design of the Grid Appliance and reports on experiences and lessons learned over four years of development and deployment involving wide-area grids.
{"title":"Grid Appliance — On the design of self-organizing, decentralized grids","authors":"D. Wolinsky, A. Prakash, R. Figueiredo","doi":"10.1109/GLOCOMW.2010.5700383","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700383","url":null,"abstract":"“Give a man a fish, feed him for a day. Teach a man to fish, feed him for a lifetime” — Lau Tzu Grid computing projects such as TeraGrid [1], Grid'5000 [2], and OpenScience Grid [3] provide researchers access to vast amounts of compute resources, but in doing so, require the adaption of their workloads to the environments provided by these systems. Researchers do not have many alternatives as creating these types of systems involve coordination of distributed systems and expertise in networking, operating systems, security, and grid middleware. This results in many research groups creating small, in-house compute clusters where scheduling is often ad-hoc, thus limiting effective resource utilization. To address these challenges we present the “Grid Appliance.” The “Grid Appliance” enables researchers to seamlessly deploy, extend, and share their systems both locally and across network domains for both small and large scale computing grids. This paper details the design of the Grid Appliance and reports on experiences and lessons learned over four years of development and deployment involving wide-area grids.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126372688","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700159
R. Cruz, M. Nunes, C. Patrikakis, N. Papaoulakis
This paper presents the design of a platform for distribution of multimedia content streams supported through innovative techniques, both in terms of media encoding and media distribution. The platform architecture accommodates the use of scalable media coding techniques, including both standard and state of the art research methods (wavelets, multiple description coding), combined with new transport and realtime streaming protocols deployed over peer-to-peer networks. Furthermore, discovery of media resources and selection of peer nodes takes into account social networking related information, as this is available in user communities over the Internet. The design of the platform is taking place in the context of the European FP7 project SARACEN.
{"title":"SARACEN: A platform for adaptive, socially aware multimedia distribution over P2P networks","authors":"R. Cruz, M. Nunes, C. Patrikakis, N. Papaoulakis","doi":"10.1109/GLOCOMW.2010.5700159","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700159","url":null,"abstract":"This paper presents the design of a platform for distribution of multimedia content streams supported through innovative techniques, both in terms of media encoding and media distribution. The platform architecture accommodates the use of scalable media coding techniques, including both standard and state of the art research methods (wavelets, multiple description coding), combined with new transport and realtime streaming protocols deployed over peer-to-peer networks. Furthermore, discovery of media resources and selection of peer nodes takes into account social networking related information, as this is available in user communities over the Internet. The design of the platform is taking place in the context of the European FP7 project SARACEN.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126551272","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
扫码关注我们
求助内容：
应助结果提醒方式：