Log in

Relevant bibliographies by topics / Routing / Journal articles

To see the other types of publications on this topic, follow the link: Routing.

Journal articles on the topic 'Routing'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Routing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Jia, Xiaohua, Niki Pissinou, and Kia Makki. "Modeling and Simulations of Multicast Routing Algorithms for Advanced Network Applications." SIMULATION 68, no. 1 (1997): 44–55. http://dx.doi.org/10.1177/003754979706800107.

Full text

Abstract:

Multicast has become an important service in modern network applications. Multicast routing is a difficult issue, particularly under delay or bandwidth constraints. This paper discusses Steiner trees in the modeling of multicast routings and various routing constraints required by applications. It also discusses the existing multicast routing algorithms, especially the routings under constraints, such as delay constraint, limited available bandwidth, and traffic load balancing. Extensive simulations have been conducted to reveal the relationships between the network cost of the routing and eac

APA, Harvard, Vancouver, ISO, and other styles

2

Panaite, Petrişor. "Routing Permutations on a 2D Grid with One-Way Edges." Parallel Processing Letters 07, no. 03 (1997): 225–35. http://dx.doi.org/10.1142/s0129626497000243.

Full text

Abstract:

We deal with the permutation routing problem on the m × n grid with one-register vertices and one-way edges. We give a routing algrithm of O(m + n) steps which is local, that is, the routing decision of every vertex depends on the states of vertices O(1) apart. Previous work investigated either local routings on two-way edges or non local routings on one-way edges.

APA, Harvard, Vancouver, ISO, and other styles

3

Bobier, Kim, and Marisa Williamson. "Routing." Women & Performance: a journal of feminist theory 30, no. 3 (2020): 257–63. http://dx.doi.org/10.1080/0740770x.2020.1907683.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kumar, B. N. Mohan. "Geographic Routing Protocol Using Vanet Routing." WSEAS TRANSACTIONS ON COMMUNICATIONS 22 (October 5, 2023): 117–24. http://dx.doi.org/10.37394/23204.2023.22.11.

Full text

Abstract:

Previously, vehicular ad hoc networks (VANETs) were designed by using several geographic routing schemes. That doesn’t sustaining any routing configurations in the existing geographic routing methods. Vehicular Ad hoc Network is networks which consist of mobile nodes, consequently it is very harsh to make and remain up end-to-end links. The main aim of this research work is widespread inter vehicle distance, high speed of vehicles also support the density of vehicle is altered. The exact real time location information of vehicles is accessed with high reliability via vehicle to vehicle inter c

APA, Harvard, Vancouver, ISO, and other styles

5

Phonekhamma, Chitnavanh. "Performance Analysis of Routing Protocols for Urban VANET Based on SUMO and NS2.35." Souphanouvong University Journal Multidisciplinary Research and Development 8, no. 2 (2024): 303–12. http://dx.doi.org/10.69692/sujmrd0802303.

Full text

Abstract:

To make the dream of intelligent transportation systems come true, the development of the autonomous cars is considered as a tremendous disruptive innovation in the coming years. Vehicular ad hoc networks (VANETs) are being used as a tool for improving road safety by alarming the drivers about accidents occurred ahead of them or for providing internet access via gateways along the road. Due to highly dynamic nature of nodes in VANETs, designing a routing protocol for VANET is quite challenging compared to other networks environment. Researchers have suggested several routing algorithms for VAN

APA, Harvard, Vancouver, ISO, and other styles

6

Mishra, Priya, Charu Gandhi, and Buddha Singh. "Link Quality and Energy Aware Geographical Routing in MANETs using Fuzzy Logics." Journal of Telecommunications and Information Technology, no. 3 (September 30, 2016): 5–17. http://dx.doi.org/10.26636/jtit.2016.3.731.

Full text

Abstract:

In literature, varieties of topology and geographical routing protocols have been proposed for routing in the MANETs. It is widely accepted that the geographical routings are a superior decision than topological routings. Majority of geographical routing protocols assume an ideal network model and choose the route that contains minimum number of hops. However, in reality, nodes have limited battery power and wireless links are additionally unreliable, so they may highly affect the routing procedure. Thus, for reliable data transmission, condition of the network such as link quality and residua

APA, Harvard, Vancouver, ISO, and other styles

7

Liu, Yao Lin, You Rong Chen, Ying Zhou, and Xue Jiang Gao. "Research on Typical Wireless Hoc Routings for Vehicular Network." Advanced Materials Research 756-759 (September 2013): 1511–16. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1511.

Full text

Abstract:

In the market, there was only specific software for network simulation or traffic simulation. They were expensive and could not support the routing simulation for vehicular network. In order to solve the problem, typical wireless ad hoc routings for vehicular network was researched in the free network simulation software NS2. The obstacle model and node mobile model were added. The nodes moved in random speed and direction on the road. Then the typical wireless ad hoc routings such as DSR (dynamic source routing), DSDV(destination sequenced distance vector) and AODV (ad hoc on-demand distance

APA, Harvard, Vancouver, ISO, and other styles

8

Azhari, Muhammad Ikhsan, Tengku Mohd Diansyah, and Ari Usman. "PERBANDINGAN ROUTING PROTOCOL EXTERIOR BGP VERSI 4 DENGAN ROUTING INTERIOR EIGRP PADA ALGORITMA LINKSTATE MENGGUNAKAN PARAMETER PACKET LOSS." JURNAL TEKNOLOGI INFORMASI 3, no. 2 (2019): 185. http://dx.doi.org/10.36294/jurti.v3i2.1071.

Full text

Abstract:

Abstract - Computer networks very influential on the speed of transferring data from one computer to another computer by using a PC or server, in this case, the routing configuration is very influential. The best routing route selection is the solution to determine the most rapid and efficient routing, and as the best routing consideration, the researcher has examined two routings, namely BGP (Border Gateway Protocol) routing and EIGRP (Enhanced Interior Gateway Routing Protocol) using the Cisco Paket Traccer application. After the researcher was done an experiment, the researcher gets the res

APA, Harvard, Vancouver, ISO, and other styles

9

Choi, Ick-Sung, Gwang-Hoon Kwark, and Geun-Hyung Kim. "A Routing Algorithm with Small Routing Traffic." KIPS Transactions:PartC 18C, no. 4 (2011): 279–86. http://dx.doi.org/10.3745/kipstc.2011.18c.4.279.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Patel, A. M., N. L. Soong, and R. K. Korn. "Hierarchical VLSI Routing--An Approximate Routing Procedure." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 4, no. 2 (1985): 121–26. http://dx.doi.org/10.1109/tcad.1985.1270104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Xianhui, Yang, Ren Honge, and Jing Weipeng. "Predictive Routing For Mobile Sink Routing Algorithm." International Journal of Grid and Distributed Computing 7, no. 3 (2014): 143–54. http://dx.doi.org/10.14257/ijgdc.2014.7.3.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Luccio, F. "Masked Interval Routing: A New Routing Scheme." Computer Journal 43, no. 2 (2000): 121–29. http://dx.doi.org/10.1093/comjnl/43.2.121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Oppen, Johan, and Arne Løkketangen. "Arc routing in a node routing environment." Computers & Operations Research 33, no. 4 (2006): 1033–55. http://dx.doi.org/10.1016/j.cor.2004.09.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Pearn, Wen-Lea, Arjang Assad, and Bruce L. Golden. "Transforming arc routing into node routing problems." Computers & Operations Research 14, no. 4 (1987): 285–88. http://dx.doi.org/10.1016/0305-0548(87)90065-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Al-Ani, Khalid W., Salman Yussof, Hussein M. Haglan, Hothefa Shaker, and Linda Mahdi Alani. "Determining an optimum zone radius for zone routing protocol (ZRP) based on node mobility." Indonesian Journal of Electrical Engineering and Computer Science 21, no. 2 (2021): 1230–37. https://doi.org/10.11591/ijeecs.v21.i2.pp1230-1237.

Full text

Abstract:

Mobility is one of the important issues in mobile ad hoc networks (MANET). By definition, MANET nodes are free to move around and this may cause difficulty in routing. MANET routing protocols must consider this factor when making routing decision. zone routing protocol (ZRP) is a hybrid routing protocol, which utilizes the proactive and reactive routing protocols advantages. ZRP proactively maintains routing information within a routing zone, while reactively discovering routes to destinations beyond the routing zone. Since ZRP is based on the concept of routing zone, determining an optimum ro

APA, Harvard, Vancouver, ISO, and other styles

16

SHINJO, K., S. SHIMOGAWA, J. YAMADA, and K. OIDA. "A STRATEGY OF DESIGNING ROUTING ALGORITHMS BASED ON IDEAL ROUTINGS." International Journal of Modern Physics C 10, no. 01 (1999): 63–94. http://dx.doi.org/10.1142/s012918319900005x.

Full text

Abstract:

This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to provide the upper performance limits attained by improving routing algorithm and it serves as a standard to measure the performance of other algorithms; [B] a method of constructing simple algorithms is presented under implementation conditions from ideal routings; [C] a method is described to enhance the performance limits of [A]. By using these elements, simple algorithms with

APA, Harvard, Vancouver, ISO, and other styles

17

Hussein, M. Haglan, Yussof Salman, W. Al-Ani Khalid, Shaker Jassim Hothefa, and A. Jasm Dhamea. "The effect of network size and density to the choice of zone radius in ZRP." Indonesian Journal of Electrical Engineering and Computer Science 20, no. 1 (2020): 206–13. https://doi.org/10.11591/ijeecs.v20.i1.pp206-213.

Full text

Abstract:

Mobile Ad hoc Network (MANET) is a network that consists of several nodes that connect without using a permanent infrastructure. Each node in MANET moves inside and outside of the network freely and randomly. The free and random movements of nodes may cause the topology of the network to change constantly. Therefore, the task of finding routes between nodes is a big challenge. Routing protocols in MANET can be divided into three categories, namely, proactive, reactive and hybrid routing protocols. Hybrid routing protocols such as the Zone Routing Protocol (ZRP) combines the advantages of both

APA, Harvard, Vancouver, ISO, and other styles

18

Putra R.R, Aqmal, Abdul Rohman, and Wibisono Iwan Setiawan. "Pembuatan Jaringan Local Area Network Menggunakan Protokol Routing OSPF di SMK NU Ungaran." Jurnal Mahasiswa Teknik Informatika 1, no. 1 (2021): 29–35. http://dx.doi.org/10.35473/.v1i1.1282.

Full text

Abstract:

The purpose of this research is to determine the efficiency of the access speed of the routing protocol itself, the implementation of this research at SMK NU Ungaran, using the ospf (Open Short Path First) routing protocol can at least reduce the risk of link-state on the network, this study uses a single method. area routin ospf protocol which is implemented using 3 routers with type 1814 which are implemented using Cisco packet tracer software. The results of the trials that have been carried out with the OSPF routing protocol are to maximize the best roting path. so that in developing the n

APA, Harvard, Vancouver, ISO, and other styles

19

Rahul, Desai, P. Patil B, and Pal Sharma Davinder. "Learning Based Route Management in Mobile Ad Hoc Networks." Indonesian Journal of Electrical Engineering and Computer Science 5, no. 1 (2017): 718–23. https://doi.org/10.11591/ijeecs.v7.i3.pp718-723.

Full text

Abstract:

Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector (DSDV), Optimized list state routing protocols (OLSR), Ad hoc on demand routing protocol (AODV), dynamic source routing (DSR) are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on reinforcement learning that learns from the delayed reinforcements and becomes more popular in area

APA, Harvard, Vancouver, ISO, and other styles

20

Liu, Jun Jian, Jiu Lei Jiang, and Jiao Zhang. "Multipath Routing." Applied Mechanics and Materials 519-520 (February 2014): 288–93. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.288.

Full text

Abstract:

Multipath routing can be effectively used for maximum utilization of network resources. It gives the node a choice of next hops for the same destination. We present two tree based algorithms, which we call MSPT and MBFT that can help a node to find multiple next hops for a destination. Both of them are distributed algorithm, allowing the traffic to switch off the shortest path and fully exploiting the path diversity of the network. MSPT has lower cost, while MBFT has less hops between the source and destination, end system can select next hop according to the application requirements. The simu

APA, Harvard, Vancouver, ISO, and other styles

21

Meinzer, Nina. "Reconfigurable routing." Nature Physics 15, no. 11 (2019): 1105. http://dx.doi.org/10.1038/s41567-019-0718-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Lin, Y. L., Y. C. Hsu, and F. S. Tsai. "Hybrid routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 9, no. 2 (1990): 151–57. http://dx.doi.org/10.1109/43.46781.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Van Leeuwen, J. "Interval Routing." Computer Journal 30, no. 4 (1987): 298–307. http://dx.doi.org/10.1093/comjnl/30.4.298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Pelley, Steven, David Meisner, Pooya Zandevakili, Thomas F. Wenisch, and Jack Underwood. "Power routing." ACM SIGARCH Computer Architecture News 38, no. 1 (2010): 231–42. http://dx.doi.org/10.1145/1735970.1736047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pelley, Steven, David Meisner, Pooya Zandevakili, Thomas F. Wenisch, and Jack Underwood. "Power routing." ACM SIGPLAN Notices 45, no. 3 (2010): 231–42. http://dx.doi.org/10.1145/1735971.1736047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Goldschlag, David, Michael Reed, and Paul Syverson. "Onion routing." Communications of the ACM 42, no. 2 (1999): 39–41. http://dx.doi.org/10.1145/293411.293443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Kim, J. H., Z. Liu, and A. A. Chien. "Compressionless routing." ACM SIGARCH Computer Architecture News 22, no. 2 (1994): 289–300. http://dx.doi.org/10.1145/192007.192050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Loo, Boon Thau, Joseph M. Hellerstein, Ion Stoica, and Raghu Ramakrishnan. "Declarative routing." ACM SIGCOMM Computer Communication Review 35, no. 4 (2005): 289–300. http://dx.doi.org/10.1145/1090191.1080126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Godfrey, P. Brighten, Igor Ganichev, Scott Shenker, and Ion Stoica. "Pathlet routing." ACM SIGCOMM Computer Communication Review 39, no. 4 (2009): 111–22. http://dx.doi.org/10.1145/1594977.1592583.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Narten, T. "Internet routing." ACM SIGCOMM Computer Communication Review 19, no. 4 (1989): 271–82. http://dx.doi.org/10.1145/75247.75273.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Roscoe, Timothy, Steve Hand, Rebecca Isaacs, Richard Mortier, and Paul Jardetzky. "Predicate routing." ACM SIGCOMM Computer Communication Review 33, no. 1 (2003): 65–70. http://dx.doi.org/10.1145/774763.774773.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Hughes, Larry, Omid Banyasad, and Evan Hughes. "Cartesian routing." Computer Networks 34, no. 3 (2000): 455–66. http://dx.doi.org/10.1016/s1389-1286(00)00130-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Arnold, Wolfgang, Hans Hellendoorn, Rudolf Seising, Christoph Thomas, and Andreas Weitzel. "Fuzzy routing." Fuzzy Sets and Systems 85, no. 2 (1997): 131–53. http://dx.doi.org/10.1016/0165-0114(95)00357-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Levin, Dave, Youndo Lee, Luke Valenta, et al. "Alibi Routing." ACM SIGCOMM Computer Communication Review 45, no. 4 (2015): 611–24. http://dx.doi.org/10.1145/2829988.2787509.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

FENTON, JOHN D. "Reservoir routing." Hydrological Sciences Journal 37, no. 3 (1992): 233–46. http://dx.doi.org/10.1080/02626669209492584.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Maxemchuk, N. F., and S. H. Low. "Active routing." IEEE Journal on Selected Areas in Communications 19, no. 3 (2001): 552–65. http://dx.doi.org/10.1109/49.917714.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Kaje, Ram Sudhakarrao. "Review of Different Routing Protocols and Routing Techniques." International Journal for Research in Applied Science and Engineering Technology 10, no. 6 (2022): 3540–42. http://dx.doi.org/10.22214/ijraset.2022.44679.

Full text

Abstract:

Abstract: Mobile Ad- hoc Network could be a dynamic network that works with the characteristic of wireless Communication Network. It doesn't have a centralized server or an arbiter. it's a system that works separately connecting with wireless links using mobile routers. because of the infrastructure less network each mobile node moves freely with the absolute direction with no warranted path. Routing in Manet could be a challenge because of the quality of Nodes and lack of server. thus a routing protocol is important to own an economical communication between nodes in numerous network things t

APA, Harvard, Vancouver, ISO, and other styles

38

Wang, Fan, Yan Yang, Kunpeng Wang, Xiaopeng Hu, and Ning Zhang. "Efficient Clustering Routing Algorithm Based on Opportunistic Routing." International Journal of Communications, Network and System Sciences 09, no. 05 (2016): 198–208. http://dx.doi.org/10.4236/ijcns.2016.95019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Nelakuditi, S., Zhi-Li Zhang, R. P. Tsang, and D. H. C. Du. "Adaptive proportional routing: a localized QoS routing approach." IEEE/ACM Transactions on Networking 10, no. 6 (2002): 790–804. http://dx.doi.org/10.1109/tnet.2002.804832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Phuong Thanh, Cao Thai, Ha Hai Nam, and Tran Cong Hung. "Solving Bandwidth-Guaranteed Routing Problem Using Routing Data." International journal of Computer Networks & Communications 6, no. 6 (2014): 97–108. http://dx.doi.org/10.5121/ijcnc.2014.6607.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Chen, Si, Bruce Golden, Richard Wong, and Hongsheng Zhong. "Arc-Routing Models for Small-Package Local Routing." Transportation Science 43, no. 1 (2009): 43–55. http://dx.doi.org/10.1287/trsc.1080.0255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Hamamreh, Rushdi. "Routing path authentication in link-state routing protocols." Network Security 2012, no. 5 (2012): 14–20. http://dx.doi.org/10.1016/s1353-4858(12)70037-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Rekersbrink, Henning, Thomas Makuschewitz, and Bernd Scholz-Reiter. "A distributed routing concept for vehicle routing problems." Logistics Research 1, no. 1 (2008): 45–52. http://dx.doi.org/10.1007/s12159-008-0003-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Reddy, P. C. "New Routing Metrics for ADHOC Network Routing Protocols." Journal of The Institution of Engineers (India): Series B 95, no. 4 (2014): 351–61. http://dx.doi.org/10.1007/s40031-014-0116-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Ben-Ameur, Walid, and Mateusz Żotkiewicz. "Multipolar routing: where dynamic and static routing meet." Electronic Notes in Discrete Mathematics 41 (June 2013): 61–68. http://dx.doi.org/10.1016/j.endm.2013.05.076.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kumar, Rohit. "IMPLEMENTING POWER OPTIMIZATION IN WSN USING A PRAGMATIC APPROACH." International Journal of Engineering Science and Humanities 14, no. 1 (2024): 15–27. http://dx.doi.org/10.62904/qqnddg76.

Full text

Abstract:

Routing involves transferring data from one point to another within a network of interconnected devices. During the transmission of data, there is at least one middle nodethat is encountered in the network. Essentially, this concept includes two main tasks: findingthebest routing paths and sending packets across a network. The process of moving packets across an internetwork is known as packet switching, and while it is direct, determiningthepath can be quite complicated. Routing protocols utilize various metrics as a standardtodetermine the best path for routing packets to their destination,

APA, Harvard, Vancouver, ISO, and other styles

47

Vistro, Daniel Mago, Ishtiaque Mahmood, Attique Ur Rehman, and Farwa Javed. "Review and Comparative Analysis of Routing Protocols in Network." International Journal of Data Science and Advanced Analytics 4 (June 19, 2023): 171–76. http://dx.doi.org/10.69511/ijdsaa.v4i0.160.

Full text

Abstract:

In network correspondence, directing is the way toward moving information across network between various end gadgets. In the network of Local and Wide Area communication is an important aspect. Routings is considered as a significant interaction in network correspondence Router works with routing protocols. Different router used different routing protocols that is used for data communication. Various conventions have various qualities that makes them fit to accomplish efficient communication. According to this different routing protocol is used. The information gets across various organization

APA, Harvard, Vancouver, ISO, and other styles

48

Serhani, Abdellatif, Najib Naja, and Abdellah Jamali. "AQ-Routing: mobility-, stability-aware adaptive routing protocol for data routing in MANET–IoT systems." Cluster Computing 23, no. 1 (2019): 13–27. http://dx.doi.org/10.1007/s10586-019-02937-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Yu, Song Sen, Xiao Peng Huang, and Jian Yang. "Quantization Strategies of RFID Routing in Internet of Things." Applied Mechanics and Materials 203 (October 2012): 148–52. http://dx.doi.org/10.4028/www.scientific.net/amm.203.148.

Full text

Abstract:

This paper researches wireless RFID routings in Internet of Things based on the idea of quantization. The researches include the obtaining of routing contexts, the measurement of contexts in evaluating the performance of routing, methods for controlling the quantification of contexts, the realization of a perceptive computational model, the mergence of the security policies. Its goal is to construct a precise lightweight and perceptive model of wireless RFID routing protocols in Internet of Things, and to lay a foundation for accelerating the developments in Internet of Things.

APA, Harvard, Vancouver, ISO, and other styles

50

Hung Le, Phu. "A Source Routing Interference-Aware Multi-Path Routing Protocol for Mobile Ad Hoc Networks." International Journal of Future Computer and Communication 3, no. 5 (2014): 304–8. http://dx.doi.org/10.7763/ijfcc.2014.v3.316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!