Artykuły w czasopismach: „Multicast”

1

Chen, Yue, Hongyong Jia, Kaixiang Huang, Julong Lan i Xincheng Yan. "A Secure Network Coding Based on Broadcast Encryption in SDN". Mathematical Problems in Engineering 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/7145138.

Pełny tekst źródła

Streszczenie:

By allowing intermediate nodes to encode the received packets before sending them out, network coding improves the capacity and robustness of multicast applications. But it is vulnerable to the pollution attacks. Some signature schemes were proposed to thwart such attacks, but most of them need to be homomorphic that the keys cannot be generated and managed easily. In this paper, we propose a novel fast and secure switch network coding multicast (SSNC) on the software defined networks (SDN). In our scheme, the complicated secure multicast management was separated from the fast data transmission based on the SDN. Multiple multicasts will be aggregated to one multicast group according to the requirements of services and the network status. Then, the controller will route aggregated multicast group with network coding; only the trusted switch will be allowed to join the network coding by using broadcast encryption. The proposed scheme can use the traditional cryptography without homomorphy, which greatly reduces the complexity of the computation and improves the efficiency of transmission.

Style APA, Harvard, Vancouver, ISO itp.

2

Shi, Lianmin, Yihuai Wang, Zhengqing Wen i Tao Peng. "Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things". Security and Communication Networks 2018 (13.06.2018): 1–13. http://dx.doi.org/10.1155/2018/3729046.

Pełny tekst źródła

Streszczenie:

With the rapid developments of Internet of Things (IoT), tremendous number of sensors are deployed in the environment to monitor and collect different types of information. When a group of sensors located with the same location (or area) should deliver their data to a set of users and they have connected with the same network device, e.g., base station or access point, the data delivery between them and their users can be treated as a single source multicast in the core network from the network device connected with them to the network devices connected with their users. Generally, in such a case, multiple multicast sessions exist in the network simultaneously. In this paper, we study two major considerations, i.e., transmission throughput and information security, for multiple multicasts with multiple streams in IoT by using linear network coding (LNC). Specifically, we jointly consider the transmission rate allocation, transmission topology selection, and secure LNC design for multiple multicasts to maximize the total secure weighted throughput (SWT), which is referred to as the secure delivery for multiple multicasts with multiple streams (SMMS) problem. To this end, we firstly consider the SMMS problem in the case that each sensor is connected with a fixed network device. We then study the SMMS problem when the source of each multicast can be selected from a set of nodes. For the first case, we formulate it to be a linear programming (LP), based on which we give the MORT algorithm to optimally solve it. On the other hand, for the second case, we first formulate it to be an integer linear programming (ILP) and then propose an efficient MBLP algorithm based on linear programming relaxation to obtain a suboptimal solution. Finally, we conduct extensive simulations to show the effectiveness and efficiency of the proposed algorithms.

Style APA, Harvard, Vancouver, ISO itp.

3

Yin, Wen Hua, Xiang Yu Bai i Xue Bin Ma. "Multicast Routing Protocols in Delay Tolerant Networks". Applied Mechanics and Materials 614 (wrzesień 2014): 490–96. http://dx.doi.org/10.4028/www.scientific.net/amm.614.490.

Pełny tekst źródła

Streszczenie:

Delay Tolerant Networks (DTNs) are characterized by intermittent connectivity, frequent partitions and extremely high latency. As a result, multicast routing protocols are difficult to implement in DTNs. Multicast can not only save network bandwidth, but also can reduce communication cost and improve the efficiency of data transfer. In recent years, various multicast routing protocols are proposed for DTNs. In order to provide a comprehensive understanding of these multicast routing protocols designed for DTNs, a survey of the multicast routing protocols was discussed in this paper. We analyzed two types of multicast routing protocols: the knowledge-based multicast routing protocol and the probability-based multicast protocol. We conclude the future research directions by discussing the advantages and disadvantages of various multicast routing protocols for DTNs, and provide some reference value for the further studies of multicast routing protocols of DTNs. Furthermore, in order to resolve the existing problems of DTNs (such as energy optimization); we will propose a social-aware energy constrained multicast routing algorithm in the future.

Style APA, Harvard, Vancouver, ISO itp.

4

Li, Bo, i Jinlin Wang. "An Identifier and Locator Decoupled Multicast Approach (ILDM) Based on ICN". Applied Sciences 11, nr 2 (8.01.2021): 578. http://dx.doi.org/10.3390/app11020578.

Pełny tekst źródła

Streszczenie:

Many bandwidth-intensive applications (such as online live, online games, etc.) are more suitable for using multicast to transmit information. Due to the advantages in scalability, Shared Tree (ST) is more suitable for large-scale deployment than Source-Based Tree (SBT). However, in ST-based multicast, all multicast sources need to send multicast data to a center node called a core, which will lead to core overload and traffic concentration. Besides, most existing multicast protocols use the shortest path between the source or the core and each receiver to construct the multicast tree, which will result in traffic overload on some links. In this paper, we propose an Identifier and Locator Decoupled Multicast approach (ILDM) based on Information-Centric Networking (ICN). ILDM uses globally unique names to identify multicast services. For each multicast service, the mapping between the multicast service name and the addresses of multicast tree nodes is stored in the Name Resolution System (NRS). To avoid core overload and traffic aggregation, we presented a dynamic core management and selection mechanism, which can dynamically select a low-load core for each multicast service. Furthermore, we designed a path state-aware multicast tree node selection mechanism to achieve traffic load balancing by using low-load links more effectively. Experimental results showed that our proposed multicast approach outperformed some other multicast methods in terms of core load, number of join requests, link load, traffic concentration, and routing state.

Style APA, Harvard, Vancouver, ISO itp.

5

Li, Bo, i Jinlin Wang. "An Identifier and Locator Decoupled Multicast Approach (ILDM) Based on ICN". Applied Sciences 11, nr 2 (8.01.2021): 578. http://dx.doi.org/10.3390/app11020578.

Pełny tekst źródła

Streszczenie:

Many bandwidth-intensive applications (such as online live, online games, etc.) are more suitable for using multicast to transmit information. Due to the advantages in scalability, Shared Tree (ST) is more suitable for large-scale deployment than Source-Based Tree (SBT). However, in ST-based multicast, all multicast sources need to send multicast data to a center node called a core, which will lead to core overload and traffic concentration. Besides, most existing multicast protocols use the shortest path between the source or the core and each receiver to construct the multicast tree, which will result in traffic overload on some links. In this paper, we propose an Identifier and Locator Decoupled Multicast approach (ILDM) based on Information-Centric Networking (ICN). ILDM uses globally unique names to identify multicast services. For each multicast service, the mapping between the multicast service name and the addresses of multicast tree nodes is stored in the Name Resolution System (NRS). To avoid core overload and traffic aggregation, we presented a dynamic core management and selection mechanism, which can dynamically select a low-load core for each multicast service. Furthermore, we designed a path state-aware multicast tree node selection mechanism to achieve traffic load balancing by using low-load links more effectively. Experimental results showed that our proposed multicast approach outperformed some other multicast methods in terms of core load, number of join requests, link load, traffic concentration, and routing state.

Style APA, Harvard, Vancouver, ISO itp.

6

Wang, Ling Xiu, i Ye Wen Cao. "Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks". Advanced Materials Research 204-210 (luty 2011): 1399–402. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1399.

Pełny tekst źródła

Streszczenie:

IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.

Style APA, Harvard, Vancouver, ISO itp.

7

Li, Bo, Jinlin Wang, Xiaoyong Zhu, Jiali You i Linlin Hu. "An Adaptive Hierarchical Hybrid Multicast Based on Information-Centric Networking". Electronics 10, nr 23 (2.12.2021): 3002. http://dx.doi.org/10.3390/electronics10233002.

Pełny tekst źródła

Streszczenie:

Many information-centric services have emerged, such as IPTV and video conferencing. These services put a lot of demands on scalable multicast communication. However, traditional IP multicast has low adoption because of its poor scalability. Therefore, some stateless multicast methods were proposed, which encapsulate the destination’s information into the packet header without requiring routers to maintain the multicast forwarding state. However, stateless multicast also faces some problems, such as ingress router overload, high forwarding overhead, packet redundancy, etc. In addition, most multicast methods cannot optimize the multicast tree because the multicast flow is simply forwarded along the shortest path tree from the source to receivers. This paper proposes an Adaptive Hierarchical Hybrid Multicast (AHHM) based on Information-Centric Networking. To balance the forwarding states and forwarding overhead, AHHM is designed as a two-layer structure, in which the upper layer establishes a stateful main tree and the lower layer establishes several stateless sub trees. The router on the main tree is defined as the multicast join node (MJN), and AHHM uses the Name Resolution System to maintain the mapping between each multicast group name and corresponding MJNs. To optimize the multicast transmission path, we designed the minimum cost selection strategy for users to select the appropriate MJN to join. Simulation results show that compared with Source-Specific Multicast (SSM) and Bit Index Explicit Replication (BIER), AHHM can not only reduce the multicast forwarding states but also reduce the control overhead and link load.

Style APA, Harvard, Vancouver, ISO itp.

8

Jiao, Yang. "Research of Tree-based Multicast Routing Protocols for Ad Hoc Networks". MATEC Web of Conferences 232 (2018): 01038. http://dx.doi.org/10.1051/matecconf/201823201038.

Pełny tekst źródła

Streszczenie:

Multicast is an important function of Ad Hoc network. It is a point to multipoint or multipoint to multipoint packet transmitting mode. Group management and maintenance, multicast packet routing are two factors of multicast protocol. This paper analyzes the classification of multicast protocols and focuses on tree based multicast protocols, compares several protocols and analyzes the advantages and disadvantages of tree based multicast protocols.

Style APA, Harvard, Vancouver, ISO itp.

9

Tian, Zhenyu, Jiali You i Linlin Hu. "A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method". Future Internet 15, nr 5 (23.04.2023): 156. http://dx.doi.org/10.3390/fi15050156.

Pełny tekst źródła

Streszczenie:

Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multicast tree (known as a multicast joining node, or MJN) to establish a multicast distribution path from the MJN to itself. The MJN selection method runs on the DR and has a significant impact on the distribution of the multicast tree, that directly affects the load distribution in the network. However, the current MJN selection method cannot effectively detect the load status of the downlink multicast path in the case of asymmetric routing, leading to network congestion and limiting the number of multicast groups that the network can accommodate (multicast capacity). To solve this problem, we propose an MJN selection method based on the reverse shortest path tree (RSPT). RSPT can effectively detect the load status of downlink multicast paths in case of routing asymmetry. Based on the detection results of RSPT, DR can select the MJN with the lowest path load to join the multicast tree. Our experimental results indicate that compared to existing multicast methods, our method has a lower cost and delay, and can effectively balance the network load in the case of asymmetric routing, increasing multicast capacity by more than two times.

Style APA, Harvard, Vancouver, ISO itp.

10

Jin, Xing, Kan-Leung Cheng i S. H. Gary Chan. "Scalable Island Multicast for Peer-to-Peer Streaming". Advances in Multimedia 2007 (2007): 1–9. http://dx.doi.org/10.1155/2007/78913.

Pełny tekst źródła

Streszczenie:

Despite the fact that global multicast is still not possible in today's Internet, many local networks are already multicast-capable (the so-called multicast “islands”). However, most application-layer multicast (ALM) protocols for streaming have not taken advantage of the underlying IP multicast capability. As IP multicast is more efficient, it would be beneficial if ALM can take advantage of such capability in building overlay trees. In this paper, we propose a fully distributed protocol called scalable island multicast (SIM), which effectively integrates IP multicast and ALM. Hosts in SIM first form an overlay tree using a scalable protocol. They then detect IP multicast islands and employ IP multicast whenever possible. We study the key issues in the design, including overlay tree construction, island management, and system resilience. Through simulations on Internet-like topologies, we show that SIM achieves lower end-to-end delay, lower link stress, and lower resource usage than traditional ALM protocols.

Style APA, Harvard, Vancouver, ISO itp.

11

JIANG, La-lin, Wei-hong XU, Feng YU i Jun-qing FAN. "Reliable multicast architecture based on multicast gateway". Journal of Computer Applications 29, nr 9 (30.10.2009): 2428–31. http://dx.doi.org/10.3724/sp.j.1087.2009.02428.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Kasera, S. K., G. Hjalmtusson, D. F. Towsley i J. F. Kurose. "Scalable reliable multicast using multiple multicast channels". IEEE/ACM Transactions on Networking 8, nr 3 (czerwiec 2000): 294–310. http://dx.doi.org/10.1109/90.851976.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Kasera, Sneha K., Jim Kurose i Don Towsley. "Scalable reliable multicast using multiple multicast groups". ACM SIGMETRICS Performance Evaluation Review 25, nr 1 (czerwiec 1997): 64–74. http://dx.doi.org/10.1145/258623.258676.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Li, Jian Bing, Xiao Ping Li, Fan Yang i Qing Kuan Dong. "An IPv6 Security Multicast System Based on CA Authentication". Advanced Materials Research 989-994 (lipiec 2014): 4519–23. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4519.

Pełny tekst źródła

Streszczenie:

To deploy network components of a security multicast which is based on the multicast group security architecture and its key management architecture, an IPv6 security multicast system using CA authentication is designed. The multicast group members use CA certificate to access network, while the role of Group Controller/key Server deployed in the network is to establish and manage the group key and negotiate SA with multicast source. The proposed scheme solves the problem of components deployment of multicast system with security, and has strong scalability as well which means various multicast protocols and group management protocols can run on this system.

Style APA, Harvard, Vancouver, ISO itp.

15

Yue, Xue Jun, Tian Sheng Hong, Kun Cai i Jia Nian Li. "Study on Schemes for Seamless Multicast Handover in the Proxy Mobile IPv6 Based on Wireless Networks". Advanced Materials Research 129-131 (sierpień 2010): 1405–9. http://dx.doi.org/10.4028/www.scientific.net/amr.129-131.1405.

Pełny tekst źródła

Streszczenie:

The research was carried on centered about the key technology in the Proxy Mobile Ipv6 networks. The frame based on multi-level domains multicast agent was proposed. And the multi-level domains multicast agent who can be collocated easily was also introduced. The different service area of multi-level domains multicast agent is overlapped which can avoid “single point of failure.” The router advertisements of Ipv6 discovered the dynamic change of availed multi-level domains multicast agent and network topology. An ASMM (Auto Study Mobile Multicast) program was proposed on the based frame of multi-level domains multicast agent. The way of sending multicast data in outer region can be chosen neatly taking advantage of the number of mobile host in outer region according to the network situation in this program instead of sending multicast data in only one mode which achieved seamless handover. In recent years, the rapid development of internet and mobile networks makes people demand the combination of internet and mobile networks more and more eagerly which can provide extensive business for mobile users. And multicast is a very promising technology in mobile network. It can enable a group of mobile users to receive the message from the same business source at the same time which improved network efficiency greatly [1]. The mobile multicast technology is facing many problems. Firstly, all multicast technology was designed for fixed host; the multicast tree established on these agreements can be changed easily. And it will cost much if it is changed; Secondly, The mobile multicast technology not only considers the dynamic change of every group members but also the location dynamic change of every group members [2, 3]. So, the mobile multicast technology is a research focus at present. IETF and many researchers proposed much mobile multicast agreement. But these agreements have different inadequateness.

Style APA, Harvard, Vancouver, ISO itp.

16

Yu, Yun Xia, Wei Qun Han i Xiao Xuan Tian. "Multicast Address Allocation Based on Interest Constraints". Applied Mechanics and Materials 347-350 (sierpień 2013): 2111–16. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2111.

Pełny tekst źródła

Streszczenie:

Multicast address allocation is a key and difficult points of HLA simulation system. Multicast address allocation need to select or improve according to the actual application needs. In the data distribution management based HLA simulation grid, for the contradiction of redundant data receives and multicast address demand , we put forward a multicast address allocation of HLA hierarchy structure and described the data forwarding algorithm. Within the site, multicast address allocation use the method based on the data receiver and forwarding server contains a filter allocation table based on the receiver's multicast address.When there is a data access, RTIA according to assign tables to forward the data to the appropriate multicast addresses. Using this method, you can avoid node receives data not related to.The simulation experiment and results analysis show that: the maximum level of nodes in the multicast reception of the message overhead can be significantly enhanced; using the hierarchical multicast routing aggregation, and based on the aggregation of routing information that is both feasible and effective.

Style APA, Harvard, Vancouver, ISO itp.

17

Chakravarthy, Ruban, i G. Ranganathan. "Adaptive Link Aware on-demand Multicast Routing Scheme in MANET". Indonesian Journal of Electrical Engineering and Computer Science 9, nr 1 (1.01.2018): 56. http://dx.doi.org/10.11591/ijeecs.v9.i1.pp56-59.

Pełny tekst źródła

Streszczenie:

The main objective of this paper is to propose a new multicast routing scheme to adopt with the dynamic topology of MANET at the same time to provide high multicast efficiency and packet delivery ratio. The proposed scheme is named as Link Aware on Demand Multicast Routing (LAOMR) scheme. In this scheme, initially the source node forms the multicast group by announcing itself as a multicast source agent to all the nodes in the network. The nodes which are eager to join in the group are sending the join request to the source node. Then the source node finds the route to reach the multicast group through some intermediate nodes. The intermediate nodes are not interested to hear the multicast message but they are act as the routers to forward the packets to the multicast group. The intermediate nodes are chosen based on the link residual life (LRL) of the nodes. The node which has the highest LRL and closer to the multicast group is selected as the forwarder node. So, the proposed scheme reduces the link failure in the multicast route and increases the multicast efficiency, throughput. The performance is evaluated by using the simulation results obtained from NS2 Simulator.

Style APA, Harvard, Vancouver, ISO itp.

18

Kwon, Doyle, i Duk Kyung Kim. "Optimal Resource Allocation for a Single-Cell Multicast Transmission Scheme with a Supplementary Multicast Channel". Electronics 8, nr 6 (22.06.2019): 704. http://dx.doi.org/10.3390/electronics8060704.

Pełny tekst źródła

Streszczenie:

Multicast transmission is an attractive solution when a large number of users receive the same content in a wide area, for example, as with mobile TV. Ever since the multimedia broadcast multicast service (MBMS) was introduced in the 3rd Generation Partnership Project (3GPP), continuing work on the multicast transmission has been done and its importance is growing in the fifth generation (5G) cellular networks. The use cases of multicast transmission have been enlarged from mobile TV and public safety to vehicular-to-everything (V2X) and unmanned aerial vehicles (UAV). Recently, for group communications in public safety networks and for geographical information sharing in automotive, airborne and social networks, multicast transmission has been targeted at fewer users in a relatively small area, which has stimulated extensive research on the single-cell multicast transmission scheme. In the proposed single-cell multicast transmission scheme, a supplementary multicast channel is additionally assigned in a single-cell multicast transmission scheme to exploit channel diversity. The resource allocation is adaptive to the channel variations of the users (responsive to users QoS needs), using channel feedback from the users, in contrast with previous approaches where resources were determined conservatively. An optimal resource allocation problem to minimize the required bandwidth while enabling every user to obtain the target multicast rate is formulated as a convex problem and an iterative algorithm is proposed in a computationally efficient way. Performance is evaluated mathematically and through intensive simulations, where other cell interference is considered using a fluid model. The proposed single-cell multicast transmission scheme provides benefits in comparison to existing multicast schemes in the simulations, under a set of various parameters including the number of multicast users and channel correlation between the multicast channels.

Style APA, Harvard, Vancouver, ISO itp.

19

Liu, Huanlin, Qinren Shen i Yong Chen. "An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks". International Journal of Optics 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/693807.

Pełny tekst źródła

Streszczenie:

Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the formerKshortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

Style APA, Harvard, Vancouver, ISO itp.

20

Sridevi, Sridevi, i Dr Manjaiah D. H. Dr.Manjaiah D.H. "Security in Multicast DNS". International Journal of Scientific Research 2, nr 7 (1.06.2012): 88–90. http://dx.doi.org/10.15373/22778179/july2013/30.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Tahir, Muhammad Atif, Asif Jamshed, Habib-ur Rehman i Yassine Daadaa. "Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees". Journal of Intelligent Systems 24, nr 4 (1.12.2015): 479–89. http://dx.doi.org/10.1515/jisys-2014-0043.

Pełny tekst źródła

Streszczenie:

AbstractIn a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.

Style APA, Harvard, Vancouver, ISO itp.

22

Wang, Min, Shu Guang Zhang, Qiao Yun Sun i Yu Zhang. "Resources Allocation Scheme Based on Mode Switch for Multicast Services in MBSFN". Applied Mechanics and Materials 543-547 (marzec 2014): 3044–48. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3044.

Pełny tekst źródła

Streszczenie:

The multimedia broadcast and multicast services (MBMS) in 3GPP LTE is characterized by multicast broadcast single frequency network (MBSFN) operation. The multicast services are transmitted by single frequency network (SFN) mode, and the unicast services are delivered with point-to-point (PTP) mode. To avoid the network congestion of the multicast services in MBSFN, a novel resources allocation scheme (RAS) based on mode switch for the multicast services is proposed. The RAS takes advantages of the mode switch between SFN and PTP for the multicast services and minimizes the demanded radio resources of the maximum load cell. The simulation results show that the proposed RAS needs less demanded radio resources of the maximum load cell than SFN mode for all the multicast services.

Style APA, Harvard, Vancouver, ISO itp.

23

Duan, Yingjie, Hong Ni i Xiaoyong Zhu. "A Dynamic Cache Allocation Mechanism (DCAM) for Reliable Multicast in Information-Centric Networking". Future Internet 14, nr 4 (25.03.2022): 105. http://dx.doi.org/10.3390/fi14040105.

Pełny tekst źródła

Streszczenie:

As a new network architecture, information-centric networking (ICN) decouples the identifiers and locators of network entities and makes full use of in-network cache technology to improve the content distribution efficiency. For reliable multicast, ICN in-network cache can help reduce the loss recovery delay. However, with the development of applications and services, a multicast tree node often serves multiple reliable multicast groups. How to reasonably allocate cache resources for each multicast group will greatly affect the performance of reliable multicast. In order to improve the overall loss recovery performance of reliable multicast, this paper designs a dynamic cache allocation mechanism (DCAM). DCAM considers the packet loss probability, the node depth of the multicast tree, and the multicast transmission rate of multicast group, and then allocates cache space for multicast group based on the normalized cache quota weight. We also explore the performance of three cache allocation mechanisms (DCAM, AARM, and Equal) combined with four cache strategies (LCE, CAPC, Prob, and ProbCache), respectively. Experimental results show that DCAM can adjust cache allocation results in time according to network changes, and its combinations with various cache strategies outperform other combinations. Moreover, the combination of DCAM and CAPC can achieve optimal performance in loss recovery delay, cache hit ratio, transmission completion time, and overhead.

Style APA, Harvard, Vancouver, ISO itp.

24

John, Jacob, i S. Sakthivel. "Brain Storm Water Optimisation-Driven Secure Multicast Routing and Route Maintenance in IoT". Journal of Information & Knowledge Management 20, Supp01 (luty 2021): 2140010. http://dx.doi.org/10.1142/s0219649221400104.

Pełny tekst źródła

Streszczenie:

In several Internet of Things (IoT) applications, messages are disseminated to some objects or nodes based on multicast transmissions. However, previous multicast routing schemes in IoT focussed mainly on the ad-hoc sensor network, but they are not robust and responsive in the IoT environment. Hence, this paper introduces the multicast routing protocol based on the proposed optimisation algorithm, named Brain Storm Water Optimisation (BSWO), in the IoT network. By the multicast routing protocol, the multicast path is designed from a multicast source node to various destinations. The multicast source node forwards packet to multiple destinations simultaneously. Initially, the nodes in the IoT network are simulated together and perform the multicast routing process effectively using the proposed optimisation framework. The multicast routing protocol performs the multicast routing mechanism using the multiobjective factors, such as distance, delay, energy, link-quality factor and trust. The multicast routing path is effectively chosen based on the developed BSWO through fitness measures. The proposed BSWO is designed by integrating the Brain Storm Optimisation (BSO) and Water Wave Optimisation (WWO), respectively. The path with the minimum distance is selected as an optimal path using the fitness parameters like delay, distance, trust, energy and link-quality factor. The proposed optimisation algorithm effectively performs the multicast routing mechanism by integrating the parametric features from both the optimisation algorithms. Once the multicast routing mechanism is done, the route maintenance process is carried out in the simulated IoT network to recover the link breakage. The proposed BSWO outperformed other methods with the minimal delay of 0.0682[Formula: see text]s, minimal average routing distance of 178.4[Formula: see text]m, maximal energy of 39.59[Formula: see text]J, maximal throughput of 87.75% and maximal trust of 90%, respectively.

Style APA, Harvard, Vancouver, ISO itp.

25

Kim, Daehee, Sejun Song i Baek-Young Choi. "Energy-Efficient Adaptive Geosource Multicast Routing for Wireless Sensor Networks". Journal of Sensors 2013 (2013): 1–14. http://dx.doi.org/10.1155/2013/142078.

Pełny tekst źródła

Streszczenie:

We propose an energy-efficient adaptive geosource multicast routing (EAGER) for WSNs. It addresses the energy and scalability issues of previous location based stateless multicast protocols in WSNs. EAGER is a novel stateless multicast protocol that optimizes location-based and source-based multicast approaches in various ways. First, it uses the receiver's geographic location information to save the cost of building a multicast tree. The information can be obtained during the receiver's membership establishment stage without flooding. Second, it reduces packet overhead, and in turn, energy usage by encoding with a small sized node ID instead of potentially large bytes of location information and by dynamically using branch geographic information for common source routing path segments. Third, it decreases computation overhead at each forwarding node by determining the multicast routing paths at a multicast node (or rendezvous point (RP)). Our extensive simulation results validate that EAGER outperforms existing stateless multicast protocols in computation time, packet overhead, and energy consumption while maintaining the advantages of stateless protocols.

Style APA, Harvard, Vancouver, ISO itp.

26

Si, Jing Jing. "A Hierarchical Multicast Scheme for Heterogeneous Receivers". Advanced Materials Research 108-111 (maj 2010): 57–62. http://dx.doi.org/10.4028/www.scientific.net/amr.108-111.57.

Pełny tekst źródła

Streszczenie:

We investigate inter-session network coding for networks with heterogeneous receivers in this paper. Based on layered source coding, we define the hierarchical inter-layer random network codes, and propose a hierarchical multicast scheme. Moreover, we compare our hierarchical multicast scheme with the layered multicast schemes in theory and with simulations. Simulation results show that our hierarchical multicast scheme can achieve the optimal aggregate throughput for some networks where the layered multicast schemes are suboptimal.

Style APA, Harvard, Vancouver, ISO itp.

27

Bilir, E. Ender, Ross M. Dickson, Ying Hu, Manoj Plakal, Daniel J. Sorin, Mark D. Hill i David A. Wood. "Multicast snooping". ACM SIGARCH Computer Architecture News 27, nr 2 (maj 1999): 294–304. http://dx.doi.org/10.1145/307338.301004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Maihöfer, Christian. "Multicast Communication". Computer Communications 25, nr 3 (luty 2002): 342. http://dx.doi.org/10.1016/s0140-3664(01)00343-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Pinto, Antonio, i Manuel Ricardo. "Multicast deflector". Telecommunication Systems 37, nr 4 (kwiecień 2008): 145–56. http://dx.doi.org/10.1007/s11235-008-9108-y.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Dao, Son, Eddie Shek, Asha Vellaikal, Richard R. Muntz, Lixia Zhang, Miodrag Potkonjak i Ouri Wolfson. "Semantic multicast". ACM Computing Surveys 31, nr 2es (czerwiec 1999): 3. http://dx.doi.org/10.1145/323216.323221.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Birman, Kenneth P., Mark Hayden, Oznur Ozkasap, Zhen Xiao, Mihai Budiu i Yaron Minsky. "Bimodal multicast". ACM Transactions on Computer Systems 17, nr 2 (maj 1999): 41–88. http://dx.doi.org/10.1145/312203.312207.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Amuthan, A., R. Kaviarasan i S. Parthiban. "Secluding Efficient Geographic Multicast Protocol against Multicast Attacks". International Journal of Information Technology and Computer Science 5, nr 10 (1.09.2013): 92–102. http://dx.doi.org/10.5815/ijitcs.2013.10.10.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Park, J., Seok Joo Koh, Shin Gak Kang i Dae Young Kim. "Multicast delivery based on unicast and subnet multicast". IEEE Communications Letters 5, nr 4 (kwiecień 2001): 181–83. http://dx.doi.org/10.1109/4234.917107.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Myung-Ki Shin, Ki-Il Kim, Dong-Kyun Kim i Sang-Ha Kim. "Multicast delivery using explicit multicast over IPv6 networks". IEEE Communications Letters 7, nr 2 (luty 2003): 91–93. http://dx.doi.org/10.1109/lcomm.2002.808396.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Chen, Xiao, Hua-gang Shao i Wei-nong Wang. "Topology-aware overlay multicast over IP multicast networks". Journal of Shanghai Jiaotong University (Science) 13, nr 1 (luty 2008): 91–96. http://dx.doi.org/10.1007/s12204-008-0091-y.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Kim, Byungsoon, i Kilwoong Jang. "Explicit Multicast Extension for a Large Multicast Group". IETE Technical Review 22, nr 3 (maj 2005): 183–88. http://dx.doi.org/10.1080/02564602.2005.11657900.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Nekovee, Maziar, Marinho P. Barcellos i Michael Daw. "Reliable multicast for the Grid: a case study in experimental computer science". Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 363, nr 1833 (18.07.2005): 1775–91. http://dx.doi.org/10.1098/rsta.2005.1606.

Pełny tekst źródła

Streszczenie:

In its simplest form, multicast communication is the process of sending data packets from a source to multiple destinations in the same logical multicast group. IP multicast allows the efficient transport of data through wide-area networks, and its potentially great value for the Grid has been highlighted recently by a number of research groups. In this paper, we focus on the use of IP multicast in Grid applications, which require high-throughput reliable multicast. These include Grid-enabled computational steering and collaborative visualization applications, and wide-area distributed computing. We describe the results of our extensive evaluation studies of state-of-the-art reliable-multicast protocols, which were performed on the UK's high-speed academic networks. Based on these studies, we examine the ability of current reliable multicast technology to meet the Grid's requirements and discuss future directions.

Style APA, Harvard, Vancouver, ISO itp.

38

Yin, Long, Jinsong Gui i Zhiwen Zeng. "Improving Energy Efficiency of Multimedia Content Dissemination by Adaptive Clustering and D2D Multicast". Mobile Information Systems 2019 (14.03.2019): 1–16. http://dx.doi.org/10.1155/2019/5298508.

Pełny tekst źródła

Streszczenie:

While achieving desired performance, there exist still many challenges in current cellular networks to support the multimedia content dissemination services. The conventional multimedia transmission schemes tend to serve all multicast group members with the data rate supported by the receiving user with the worst channel condition. The recent work discusses how to provide satisfactory quality of service (QoS) for all receiving users with different quality of experience (QoE) requirements, but the energy efficiency improvement of multimedia content dissemination is not its focus. In this paper, we address it based on adaptive clustering and device-to-device (D2D) multicast and propose an energy-efficient multimedia content dissemination scheme under a consistent QoE constraint. Our scheme extends the recent work with the proposed K-means-based D2D clustering method and the proposed game-based incentive mechanism, which can improve energy efficiency of multimedia content dissemination on the premise of ensuring the desired QoE for most multicast group members. In the proposed scheme, we jointly consider the cellular multicast, intracluster D2D multicast, and intercluster D2D multicast for designing the energy-efficient multimedia content dissemination scheme. In particular, we formulate the energy-efficient multicast transmission problem as a Stackelberg game model, where the macro base station (MBS) is the leader and the candidate D2D cluster heads (DCHs) are the followers. Also, the MBS acts as the buyer who buys the power from the candidate DCHs for intracluster and intercluster D2D multicast communications, and the candidate DCHs act as the sellers who earn reward by helping the MBS with D2D multicast communications. Through analyzing the above game model, we derive the Stackelberg equilibrium as the optimal allocation for cellular multicast power, intracluster D2D multicast power, and intercluster D2D multicast power, which can maximize the MBS’s utility function. Finally, the proposed scheme is verified through the simulation experiments designed in this paper.

Style APA, Harvard, Vancouver, ISO itp.

39

Sun, Jia Lin, i Xiao Lei Dong. "Application of EPON Multicast Technology over IPTV". Advanced Materials Research 971-973 (czerwiec 2014): 1557–60. http://dx.doi.org/10.4028/www.scientific.net/amr.971-973.1557.

Pełny tekst źródła

Streszczenie:

In this paper, we propose an IPTV controllable multicast solution, which combines the technology of SCB, IGMP and the extended OAM. SCB and IGMP are responsible for the distribution of multicast service. A method that based on the extended OAM multicast control packets is used to realize the functions of control and management in multicast service. We also explain the bandwidth design methods of the EPON system. In the end, the implementation scheme of EPON controllable multicast in IPTV application is proposed.

Style APA, Harvard, Vancouver, ISO itp.

40

Nguyen, Hoai Son, Ngoc Anh Nguyen i Huong Bui Thi Lan. "BAM-Chord". International Journal of Distributed Systems and Technologies 4, nr 1 (styczeń 2013): 43–55. http://dx.doi.org/10.4018/jdst.2013010104.

Pełny tekst źródła

Streszczenie:

In recent years, there has been considerable interest in applying Distributed Hash Tables (DHTs) to application-level multicast since DHTs have many advantages that are good for multicast applications: decentralization, scalability, fault tolerance, load balancing, and good routing performances. However, an effective bandwidth utilization method is required for DHT-based multicast systems because of a number of technical issues such as heterogeneous node capacity and dynamic membership. In this paper, the authors propose their BAM-Chord (i.e., Bandwidth Adaptive Multicast over Chord), a DHT-based multicast system that focuses on host heterogeneity, network scalability and effective bandwidth utilization. In the authors’ system, when a node joins into the system, it will find out an appropriate position (i.e., node identifier) on a BAM-Chord ring and create links to neighbor nodes based on node’s bandwidth capacity such that the multicast tree can be built efficiently and balanced. Therefore, their system can utilize bandwidth of every node efficiently to reduce the depth of the multicast tree, increase network scalability and take advantages of DHTs in maintaining the multicast tree.

Style APA, Harvard, Vancouver, ISO itp.

41

Zheng, Xin Wei, Xiao Yun Wu i Zhi Bin Yuan. "A Media Stream Multicast Model Based on Proxy". Applied Mechanics and Materials 263-266 (grudzień 2012): 1818–21. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1818.

Pełny tekst źródła

Streszczenie:

Although Application-level multicast is a new multi-point data transmission model, there is no mature and effective scheme for network heterogeneity problem. This paper proposes an agent-based adaptive media multicast system, i.e., the so-called iPALM system (Proxy based Application-level Multicast). It uses efficiently data transmission of IP multicast in LAN, and every IP multicast area sets one agent server named MPN, the backbone network composed of MPNs transmits data using application-level multicast. At the same time, iPALM provides the head format of system protocol, and the definition of transmission message in XML format which demonstrates that iPALM system can satisfy every different application requirement, and improves the media service quality in heterogeneous environment.

Style APA, Harvard, Vancouver, ISO itp.

42

Duan, Yingjie, Hong Ni i Xiaoyong Zhu. "Reliable Multicast Based on Congestion-Aware Cache in ICN". Electronics 10, nr 13 (30.06.2021): 1579. http://dx.doi.org/10.3390/electronics10131579.

Pełny tekst źródła

Streszczenie:

Reliable multicast distribution is essential for some applications such as Internet of Things (IoT) alarm information and important file distribution. Traditional IP reliable multicast usually relies on multicast source retransmission for recovery losses, causing huge recovery delay and redundancy. Moreover, feedback implosion tends to occur towards multicast source as the number of receivers grows. Information-Centric Networking (ICN) is an emerging network architecture that is efficient in content distribution by supporting multicast and in-network caching. Although ubiquitous in-network caching provides nearby retransmission, the design of cache strategy greatly affects the performance of loss recovery. Therefore, how to recover losses efficiently and quickly is an urgent problem to be solved in ICN reliable multicast. In this paper, we first propose an overview architecture of ICN-based reliable multicast and formulate a problem using recovery delay as the optimization target. Based on the architecture, we present a Congestion-Aware Probabilistic Cache (CAPC) strategy to reduce recovery delay by caching recently transmitted chunks during multicast transmission. Then, we propose NACK feedback aggregation and recovery isolation scheme to decrease recovery overhead. Finally, experimental results show that our proposal can achieve fully reliable multicast and outperforms other approaches in recovery delay, cache hit ratio, transmission completion time, and overhead.

Style APA, Harvard, Vancouver, ISO itp.

43

Maiga, Ali, Jean-Yves Baudais i Jean-François Hélard. "Bit Rate Optimization with MMSE Detector for Multicast LP-OFDM Systems". Journal of Electrical and Computer Engineering 2012 (2012): 1–12. http://dx.doi.org/10.1155/2012/232797.

Pełny tekst źródła

Streszczenie:

We propose a new resource allocation algorithm with minimum mean square error (MMSE) detector for multicast linear precoded orthogonal frequency division multiplexing (LP-OFDM) systems. To increase the total multicast bit rate, this algorithm jointly uses the LP-OFDM modulation technique and an adaptation of the OFDM-based multicast approaches to exploit the transmission link diversities of users. The LP technique applied to multicast OFDM systems with zero forcing (ZF) detector has already proved its ability to increase the unirate multicast system bit rate in a power line communication (PLC) context. The new MMSE detector and the new related bit-loading algorithm are developed to enhance the ZF detector results. To improve both the bit rate and the fairness among multicast users, the utilization of the LP component in multirate multicast systems is then investigated. Simulations are run over indoor PLC channels, and it is shown that the proposed LP-based methods outperform the OFDM-based methods in terms of total bit rate and fairness index for both unirate and multirate multicast systems. Additionally, it is shown that the proposed bit-loading algorithm with MMSE detector outperforms the ZF detector and the OFDM-based receiver in terms of total multicast bit rate and fairness among users.

Style APA, Harvard, Vancouver, ISO itp.

44

Chen, Liang Bin, Qiang Li i Xiang Feng. "Research on Multicast Routing Algorithm for P2P Overlay Network". Applied Mechanics and Materials 347-350 (sierpień 2013): 2293–97. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2293.

Pełny tekst źródła

Streszczenie:

Multicast routing is a critical problem in the P2P network. The main task for multicast routing is to establish a multicast tree with good performance, to satisfy the various qualities of service requirements, such as improving the streaming media service quality, and the utilization rate of cyber source. Many efficient overlay multicast routing algorithms are proposed to face the new challenge in current P2P network. This paper attempts to survey the current problems, the solutions for overlay multicast routing algorithms, and points out the further research directions.

Style APA, Harvard, Vancouver, ISO itp.

45

Wang, Yan. "An Advanced P2P Multicast Algorithm Based on Scribe". Advanced Materials Research 816-817 (wrzesień 2013): 606–9. http://dx.doi.org/10.4028/www.scientific.net/amr.816-817.606.

Pełny tekst źródła

Streszczenie:

This paper presents an advanced multicast algorithm to the question of low multicast efficiency and poor game states synchronization in the SCRIBE algorithm based on P2P for MMOG. This algorithm constructs a multicast tree mainly considering node heterogeneity on bandwidth resource, computing resource and storage resource, moreover it approximately balances multicast tree by looking for a sub-tree which its high is lower. The experiment results show this algorithm can reduce message redundancy and multicast delay to a greater extent, and greatly improve game state synchronization.

Style APA, Harvard, Vancouver, ISO itp.

46

Miloucheva, Ilka, Olaf Menzel, Karl Jonas i Rui L. Aguiar. "Efficient QoS based mobile multicast using context transfer". Journal of Communications Software and Systems 2, nr 2 (5.04.2017): 99. http://dx.doi.org/10.24138/jcomss.v2i2.293.

Pełny tekst źródła

Streszczenie:

New challenging applications and scenarios for converged fixed and mobile Internet infrastructures, require efficient technologies adapting the multicast services for fixed IPv6 infrastructures to heterogeneous mobile environment. This paper discusses architecture aimed to support QoS based mobile multicast in heterogeneous mobile IPv6 environmentusing context transfer between access routers for seamlesshandover of mobile multicast applications. The architecture includes components for policy based QoS management of mobile multicast, reliable mobile multicast support at access routers and optimised handover based on learning of capabilities of access routers and networks.

Style APA, Harvard, Vancouver, ISO itp.

47

H.-J. Bongartz, Harald, i Thomas Bachran. "A static test-bed for the evaluation and optimization of multihop wireless network protocols". Journal of Telecommunications and Information Technology, nr 2 (25.06.2023): 62–69. http://dx.doi.org/10.26636/jtit.2008.2.873.

Pełny tekst źródła

Streszczenie:

We investigate the performance of multicast transmissions in a simple stationary wireless multihop ad hoc network test-bed. We compare several methods for MANET multicast using implementations for the protocols MOLSR, SMOLSR and SMF with an approach that uses explicit multicast and link-layer retries for reliable multicast. Results from the test-bed are compared with simulation results. We find that implementing a combination of explicit multicast with a retry mechanism gives the most promising results in test-bed and simulation compared with other approaches.

Style APA, Harvard, Vancouver, ISO itp.

48

Im, Illkyun, i Jongpil Jeong. "Cost-Effective and Fast Handoff Scheme in Proxy Mobile IPv6 Networks with Multicasting Support". Mobile Information Systems 10, nr 3 (2014): 287–305. http://dx.doi.org/10.1155/2014/131030.

Pełny tekst źródła

Streszczenie:

With recent advancements in wireless communication technologies, mobile multicasting is becoming important, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was on the costs needed for network delivery to provide multicast services, as well as on minimizing the multicast handover delay. However, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence for techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol. To resolve these problems, the network-based mobility management protocol PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from problems of handover delay and tunnel convergence. To overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed in this paper, for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. It was found that, compared to other types of multicast techniques, LFH reduces multicast delay, and requires lower cost.

Style APA, Harvard, Vancouver, ISO itp.

49

Wang, Yan, Jifei Cai, Mingming Zhang i Mingzhi Cheng. "A New IPTV Multicast Fast Reroute Method". International Journal of Online Engineering (iJOE) 14, nr 04 (26.04.2018): 82. http://dx.doi.org/10.3991/ijoe.v14i04.8379.

Pełny tekst źródła

Streszczenie:

This document proposes an IP multicast fast convergence method based on differentiating primary and backup PIM(Protocol Independent Multicast) join. The multicast stream is only sent along one of the multicast primary and backup path, which enables the efficient multicast delivery under both normal and abnormal conditions. The Single stream FRR(Fast Re-Route) solution has the advantages of implementing fast multicast protection and of avoiding double multicast bandwidth occupation in both normal and abnormal situations.

Style APA, Harvard, Vancouver, ISO itp.

50

Xu, Yanli. "A Device-to-Device Multicast Scheme for Delay-Constraint Content Delivery". Mobile Information Systems 2017 (2017): 1–12. http://dx.doi.org/10.1155/2017/8012517.

Pełny tekst źródła

Streszczenie:

Motivated by the explosive increase of mobile traffic, study on the device-to-device (D2D) communication is kicked off for content delivery through proximal transmission among users. D2D multicast has advantage on serving multiple users simultaneously with less resource cost. However, when D2D multicast is appropriate for content delivery and how to make it serve delay-constraint traffic are still unclear. In this paper, parameters impacting on D2D multicast content delivery is investigated to find good chances for utilizing D2D multicast. Furthermore, some rules to be obeyed are proposed for the content caching and delivery of D2D multicast to satisfy delay constraints. Based on these analyses, a delay-aware multicast scheme is proposed to maximize the network performance utility while satisfying delay constraints of contents. Simulations results verify our analyses and show that the proposed scheme can significantly improve multicast efficiency with guaranteed delay.

Style APA, Harvard, Vancouver, ISO itp.

Artykuły w czasopismach na temat „Multicast”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych