Relevant bibliographies by topics / Traffic Aware Routing

Academic literature on the topic 'Traffic Aware Routing'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Traffic Aware 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.

Journal articles on the topic "Traffic Aware Routing"

1

Mohammadzadeh, Hekmat, and Shapour Joudi Bigdello. "UTCARP: Urban Traffic Control Aware Routing Protocol." International Journal on AdHoc Networking Systems 3, no. 1 (January 31, 2013): 1–13. http://dx.doi.org/10.5121/ijans.2013.3101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vinnarasi, F. Sangeetha Francelin, and A. Chandrasekar. "VANET routing protocol with traffic aware approach." International Journal of Advanced Intelligence Paradigms 12, no. 1/2 (2019): 3. http://dx.doi.org/10.1504/ijaip.2019.096944.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chandrasekar, A., and F. Sangeetha Francelin Vinnarasi. "VANET routing protocol with traffic aware approach." International Journal of Advanced Intelligence Paradigms 12, no. 1/2 (2019): 3. http://dx.doi.org/10.1504/ijaip.2019.10017739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Parsa, Ali, and Neda Moghim. "QoS-aware routing and traffic management in multi-flow opportunistic routing." Computers & Electrical Engineering 94 (September 2021): 107330. http://dx.doi.org/10.1016/j.compeleceng.2021.107330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hu, Yaqin, Mingyue Xu, Ming Tang, Dingding Han, and Ying Liu. "Efficient traffic-aware routing strategy on multilayer networks." Communications in Nonlinear Science and Numerical Simulation 98 (July 2021): 105758. http://dx.doi.org/10.1016/j.cnsns.2021.105758.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

YAMASHITA, Shigeyuki, Tomohiko YAGYU, and Miki YAMAMOTO. "Time-Dimensional Traffic Engineering with Storage Aware Routing." IEICE Transactions on Communications E97.B, no. 12 (2014): 2641–49. http://dx.doi.org/10.1587/transcom.e97.b.2641.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Della Valle, Emanuele, Irene Celino, Daniele Dell'Aglio, Ralph Grothmann, Florian Steinke, and Volker Tresp. "Semantic Traffic-Aware Routing Using the LarKC Platform." IEEE Internet Computing 15, no. 6 (November 2011): 15–23. http://dx.doi.org/10.1109/mic.2011.107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Park, Chongmyung, Harksoo Kim, and Inbum Jung. "Traffic-aware routing protocol for wireless sensor networks." Cluster Computing 15, no. 1 (December 4, 2010): 27–36. http://dx.doi.org/10.1007/s10586-010-0146-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Anderson, Eric J., Thomas E. Anderson, Steven D. Gribble, Anna R. Karlin, and Stefan Savage. "A quantitative evaluation of traffic-aware routing strategies." ACM SIGCOMM Computer Communication Review 32, no. 1 (January 2002): 67. http://dx.doi.org/10.1145/510726.510741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Cuixiang, Xing Shao, Zhi Gao, Chuanxin Zhao, and Jun Gao. "Common network coding condition and traffic matching supported network coding aware routing for wireless multihop network." International Journal of Distributed Sensor Networks 15, no. 6 (June 2019): 155014771985397. http://dx.doi.org/10.1177/1550147719853978.

Full text
Abstract:
Network coding–based routing has been widely considered as a promising technology to improve the network throughput of wireless multihop network. However, existing network coding aware routings have the problem of failure decoding and usually neglect the transmission scheduling, which degrades the gain of network coding. In this article, a common network coding condition and traffic matching supported network coding aware routing is proposed for wireless multihop network. In this, common network coding condition is proposed to avoid the problem of failed decoding. In addition, traffic matching mechanism is presented to promote the occurrence of network coding. Besides, a coding and load aware routing metric, which jointly considers the network coding opportunity and node load, is designed to evaluate the discovered paths. Extensive simulations on NS2 demonstrate that CTNR increases the number of coding opportunities and network coding occurrence, and improves network throughput.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Traffic Aware Routing"

1

Al-Qassas, Raad S. "On the performance of traffic-aware reactive routing in MANETs." Thesis, University of Glasgow, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lim, Sejoon. "Congestion-aware traffic routing for large-scale mobile agent systems." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78452.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 191-201).
Traffic congestion is a serious world-wide problem. Drivers have little knowledge of historical and real-time traffic congestion for the paths they take and often tend to drive suboptimal routes. Congestion phenomena are sure to be influenced by the coming of autonomous cars. This thesis presents route planning algorithms and a system for either autonomous or human-driven cars in road networks dealing with travel time uncertainty and congestion. First, a stochastic route planning algorithm is presented that finds the best path for a group of multiple agents. Our algorithm provides mobile agents with optimized routes to achieve time-critical goals. Optimal selections of agent and visit locations are determined to guarantee the highest probability of task achievement while dealing with uncertainty of travel time. Furthermore, we present an efficient approximation algorithm for stochastic route planning based on pre-computed data for stochastic networks. Second, we develop a distributed congestion-aware multi-agent path planning algorithm that achieves the social optimum, minimizing aggregate travel time of all the agents in the system. As the number of agents grows, congestion created by agents' path choices should be considered. Using a data-driven congestion model that describes the travel time as a function of the number of agents on a road segment, we develop a practical method for determining the optimal paths for all the agents in the system to achieve the social optimum. Our algorithm uses localized information and computes the paths in a distributed manner. We implement the algorithm in multi-core computers and demonstrate that the algorithm has a good scalability. Third, a path planning system using traffic sensor data is then implemented. We predict the traffic speed and flow for each location from a large set of sensor data collected from roving taxis and inductive loop detectors. Our system uses a data-driven traffic model that captures important traffic patterns and conditions using the two sources of data. We evaluate the system using a rich set of GPS traces from 16,000 taxis in Singapore and show that the city-scale congestion can be mitigated by planning drivers' routes, while incorporating the congestion effects generated by their route choices.
by Sejoon Lim.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
3

Al-Momin, Mohammed M. Saeed Abdullah. "QoS-aware content oriented flow routing in optical computer network." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7670.

Full text
Abstract:
In this thesis, one of the most important issues in the field of networks communication is tackled and addressed. This issue is represented by QoS, where the increasing demand on highquality applications together with the fast increase in the rates of Internet users have led to massive traffic being transmitted on the Internet. This thesis proposes new ideas to manage the flow of this huge traffic in a manner that contributes in improving the communication QoS. This can be achieved by replacing the conventional application-insensitive routing schemes by others which take into account the type of applications when making the routing decision. As a first contribution, the effect on the potential development in the quality of experience on the loading of Basra optical network has been investigated. Furthermore, the traffic due to each application was dealt with in different ways according to their delay and loss sensitivities. Load rate distributions over the various links due to the different applications were deployed to investigate the places of possible congestions in the network and the dominant applications that cause such congestions. In addition, OpenFlow and Optica Burst Switching (OBS) techniques were used to provide a wider range of network controllability and management. A centralised routing protocol that takes into account the available bandwidth, delay, and security as three important QoS parameters, when forwarding traffics of different types, was proposed and implemented using OMNeT++ networks simulator. As a novel idea, security has been incorporated in our QoS requirements by incorporating Oyster Optics Technology (OOT) to secure some of the optical links aiming to supply the network with some secure paths for those applications that have high privacy requirements. A particular type of traffic is to be routed according to the importance of these three QoS parameters for such a traffic type. The link utilisation, end to end delays and securities due to the different applications were recorded to prove the feasibility of our proposed system. In order to decrease the amount of traffic overhead, the same QoS constraints were implemented on a distributed Ant colony based routing. The traditional Ant routing protocol was improved by adopting the idea of Red-Green-Blue (RGB) pheromones routing to incorporate these QoS constraints. Improvements of 11% load balancing, and 9% security for private data was achieved compared to the conventional Ant routing techniques. In addition, this Ant based routing was utilised to propose an improved solution for the routing and wavelength assignment problem in the WDM optical computer networks.
APA, Harvard, Vancouver, ISO, and other styles
4

Tekdogan, Ridvan. "Improving Throughput By Traffic Aware Routing In Non-transparent Ieee 802.16j Networks." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611806/index.pdf.

Full text
Abstract:
WiMAX is one of the rising communications technology which enables last mile broadband mobile wireless Internet connectivity. IEEE Std 802.16-2009 is the last accepted standard which targets mobile and fixed wireless broadband access. The standard defines two types of stations which are base and mobile stations. A base station has a wired connection to backhaul network and gives broadband wireless service to mobile stations. IEEE 802.16j standard which is an amendment to IEEE 802.16, introduces Multihop Relaying for increasing coverage and throughput. Deployment of relay stations, where the backbone network does not exist, is a cost effective solution. Two modes of operations are defined for relay station: transparent mode and non-transparent mode. Relays in transparent mode, are deployed for improving signal quality, so that mobile stations can use relay link for increasing throughput. In non-transparent mode, relays can send management packets, so that mobile stations, which are not in the direct reach of a base station, can connect to network through relay stations. In domain specific networks main data traffic is caused by the communication between subscribers in same region. In this thesis shortcut routing scheme is proposed as sending packets to destination directly through relay station for data traffic between two subscribers with a common relay. With shortcut routing, network throughput is increased by preventing links at higher layer in topology from becoming bottleneck. Moreover, by traversing fewer hops, latency decreases. We also propose traffic aware path selection method, where a path will more.
APA, Harvard, Vancouver, ISO, and other styles
5

MAHAPATRA, ABINASH. "QOS AND ENERGY AWARE ROUTING FOR REAL TIME TRAFFIC IN WIRELESS SENSOR NETWORKS." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1070555178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bianzino, Aruna Prem. "Ingénierie de trafic avec conscience d'énergie dans les réseaux filaires." Phd thesis, Télécom ParisTech, 2012. http://pastel.archives-ouvertes.fr/pastel-01002105.

Full text
Abstract:
Que le phénomène découle d'une prise de conscience des conséquences sur l'environnement, d'une opportunité économique ou d'une question de réputation et de commerce, la réduction des émissions de gaz à effets de serre est récemment devenue un objectif de premier plan. Les individus, les entreprises et les gouvernements effectuent un effort important pour réduire la dépense énergétique de multiples secteurs d'activité. Parallèlement, les technologies de l'information et de la communication sont de plus en plus présentes dans la plupart des activités humaines et l'on a estimé que 2% des émissions de gaz à effets de serre pouvaient leur être attribuées, cette proportion atteignant 10 % dans les pays fortement industrialisés [1, 2]. Si ces chiffres paraissent raisonnables aujourd'hui, ils sont certainement appelés à croître à l'avenir. À l'heure du cloud computing, les infrastructures de calcul et de communication demandent de plus en plus de performance et de disponibilité et imposent l'utilisation de matériels puissants et engendrant une consommation d'énergie importante du fait de leur fonctionnement direct, mais aussi à cause du refroidissement qu'ils nécessitent. En outre, les contraintes de disponibilité imposent une conception d'architectures redondantes et dimensionnées sur une charge crête. Les infrastructures sont donc souvent sous-utilisées et adapter leur niveau de performance à la charge effectivement constatée constitue une piste d'optimisation prometteuse à divers niveaux. Si l'on adopte un strict point de vue environnemental, l'objectif du Green Networking consiste à réduire le volume d'émissions de gaz à effets de serre dues au processus de communication. L'utilisation de sources d'énergie renouvelables ou d'électronique de faible consommation (par exemple asynchrone) constituent des pistes évidentes d'amélioration.
APA, Harvard, Vancouver, ISO, and other styles
7

Cho, Woon Hyung. "TIDR traffic-aware inter-domain routing /." 2007. http://etd.lib.fsu.edu/theses/available/etd-07092007-213717.

Full text
Abstract:
Thesis (M.S.)--Florida State University, 2007.
Advisor: Zhenhai Duan, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Oct. 8, 2007). Document formatted into pages; contains vii, 25 pages. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
8

Guo, Tsz-heng, and 郭慈恆. "A Constraint-based Routing for DiffServ-aware MPLS Traffic Engineering." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/zqbh66.

Full text
Abstract:
碩士
銘傳大學
資訊工程學系碩士班
96
In this thesis, we propose a new per-class bandwidth constraint algorithm, namely multi-path selection algorithm (MSA), for a DiffServ-aware MPLS Traffic Engineering (DiffServ-TE) network. MSA use technique that finds multiple paths per-class and allows flexible division of traffic over these paths. The MSA is achieved in three steps. First, the source uses the proposed MSA to find multiple label switch paths (LSPs) to the destination for a CT based on the transmission time of a path and the available bandwidth of a link. Second, the source uses the available bandwidth of the CT on all the links along these found LSPs to assign the initial traffic over these found paths. Third, the source adjusts dynamically traffics for each LSPs based on their transmission time. The simulation results have shown that the proposed approach has lower transmission time, lower packet loss rate, higher throughput, and lower variance in each link compared to the shortest path algorithm. Therefore, we believe that the proposed scheme is suitable for end-to-end QoS routing in a DiffServ-TE network.
APA, Harvard, Vancouver, ISO, and other styles
9

Lin, Chih-Chieh, and 林稚捷. "Traffic-Aware Routing Algorithms for IEEE 802.16j Multihop Relay Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/25851443977441081970.

Full text
Abstract:
碩士
國立臺灣大學
電機工程學研究所
96
The amendment of 802.16e has been released lately by IEEE 802.16 Relay Task Group j. For the sake of improving throughput and extension of cell coverage, relay stations (RSs) are deployed in the network. Intuitively, the base station (BS) selects a path for a target subscriber station (SS) according to Signal to Interference plus Noise Ratio (SINR) or the available bandwidth. However, it will lead to inefficient resource utilization and low system capacity since some RSs may have high traffic load whereas others may have redundant bandwidth. To tackle this problem, we propose a traffic-aware routing algorithm. By taking into account both resource utilization and load balance, our proposed scheme ensures that paths with heavy traffic load and long hop distance will not be selected while establishing the route. Simulations results demonstrate that, with the proposed traffic-aware routing algorithm, users are able to transmit more packets over the same period. Not only is the latency maintained in a reasonable range but also the throughput as well as packet delivery ratio are enhanced.
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Chih-Chieh. "Traffic-Aware Routing Algorithms for IEEE 802.16j Multihop Relay Networks." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2901200823082300.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Traffic Aware Routing"

1

Long, Fei. "Satellite Network Traffic Engineering." In Satellite Network Robust QoS-aware Routing, 75–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54353-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Avallone, Stefano, Fernando Kuipers, Giorgio Ventre, and Piet Van Mieghem. "Dynamic Routing in QoS-Aware Traffic Engineered Networks." In IFIP International Federation for Information Processing, 45–58. Boston, MA: Springer US, 2006. http://dx.doi.org/10.1007/0-387-31170-x_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Giudici, Francesco, and Elena Pagani. "Spatial and Traffic-Aware Routing (STAR) for Vehicular Systems." In High Performance Computing and Communications, 77–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11557654_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Xue. "Traffic-Aware Geographical Routing in Vehicle Ad Hoc Networks." In Lecture Notes in Electrical Engineering, 755–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27323-0_94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Kun-Chih, Chih-Hao Chao, Shu-Yen Lin, and An-Yeu Wu. "Traffic- and Thermal-Aware Routing Algorithms for 3D Network-on-Chip (3D NoC) Systems." In Routing Algorithms in Networks-on-Chip, 307–38. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8274-1_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lee, Youngseok, and Biswanath Mukherjee. "A Traffic Engineering-Aware Shortest-Path Routing Algorithm in IP Networks." In Lecture Notes in Computer Science, 1204–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24693-0_99.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shen, Meng, Hongying Liu, Ke Xu, Ning Wang, and Yifeng Zhong. "Routing On Demand: Toward the Energy-Aware Traffic Engineering with OSPF." In NETWORKING 2012, 232–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30045-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Amaldi, Edoardo, Antonio Capone, Luca G. Gianoli, and Luca Mascetti. "A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing." In Lecture Notes in Computer Science, 464–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21527-8_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sanogo, Kader, Abdelkader Mekhalef Benhafssa, M’hammed Sahnoun, Belgacem Bettayeb, and Abdelghani Bekrar. "Multi-agent Simulation for Flexible Job-Shop Scheduling Problem with Traffic-Aware Routing." In Service Oriented, Holonic and Multi-agent Manufacturing Systems for Industry of the Future, 573–83. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99108-1_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ke, Chih-Kun, Szu-Cheng Lai, and Li-Te Huang. "Developing a Context-Aware POI Network of Adaptive Vehicular Traffic Routing for Urban Logistics." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 319–28. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-06158-6_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Traffic Aware Routing"

1

Basso, Rafael, Peter Lindroth, Balazs Kulcsar, and Bo Egardt. "Traffic aware electric vehicle routing." In 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC). IEEE, 2016. http://dx.doi.org/10.1109/itsc.2016.7795588.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Lei, Tae-Hyun Kim, Chunlei Liu, Min-Te Sun, and Alvin Lim. "TART: Traffic-Aware Routing Tree for Geographic Routing." In 2008 IEEE Wireless Communications and Networking Conference. IEEE, 2008. http://dx.doi.org/10.1109/wcnc.2008.458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Delling, Daniel, Dennis Schieferdecker, and Christian Sommer. "Traffic-Aware Routing in Road Networks." In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 2018. http://dx.doi.org/10.1109/icde.2018.00172.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mankar, Gunjan, and Sonali T. Bodkhe. "Traffic aware energy efficient routing protocol." In 2011 3rd International Conference on Electronics Computer Technology (ICECT). IEEE, 2011. http://dx.doi.org/10.1109/icectech.2011.5942106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McBride, Benjamin D., and Caterina Scoglio. "Characterizing Traffic Demand Aware Overlay Routing Network Topologies." In 2007 Workshop on High Performance Switching and Routing. IEEE, 2007. http://dx.doi.org/10.1109/hpsr.2007.4281227.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fernández-Fernández, Adriana, Cristina Cervelló-Pastor, and Leonardo Ochoa-Aday. "Evaluating the Impact of Energy-Aware Routing on Software-Defined Networking Performance." In XIII Jornadas de Ingenieria Telematica - JITEL2017. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/jitel2017.2017.6489.

Full text
Abstract:
Increasing power consumption and CO2 emissions generated by large data networks have become a major concern over the last decade. For this problem, the emerging paradigm of Software-Defined Networks (SDN) can be seen as an attractive solution. In these networks an energy-aware routing model could be easily implemented leveraging the control and data plane separation. This paper investigates the impact of energy-aware routing on SDN performance. To that end, we propose a novel energy- aware mechanism that reduces the number of active links in SDN with multiple controllers, considering in-band control traffic, i.e. links are shared between data and control plane traffic. The proposed strategy exploits knowledge of the network topology combined with traffic engineering techniques to reduce the overall power consumption. Therefore, two heuristic algorithms are designed: a static network configuration and a dynamic energy-aware routing. Significant values of switched-off links are reached in the simulations using real topologies and demands data. Moreover, obtained results confirm that crucial network parameters such as control traffic delay, data path latency, link utilization and TCAM occupation are affected by the performance-agnostic energy-aware model.
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Yang, Min Sheng, and Yan Zhang. "Traffic-Aware Routing Protocol for Cognitive Network." In 2010 IEEE Vehicular Technology Conference (VTC 2010-Fall). IEEE, 2010. http://dx.doi.org/10.1109/vetecf.2010.5594376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sukumaran, Sangheethaa, Lakshmi Ramachandran, and Surya Rani Sunny. "Intersection based Traffic Aware Routing in VANET." In 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI). IEEE, 2013. http://dx.doi.org/10.1109/icacci.2013.6637386.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ting Cao, Xinchao Zhang, Linghe Kong, Xiao-Yang Liu, Wei Shu, and Min-You Wu. "Traffic Aware Routing in urban vehicular networks." In 2013 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2013. http://dx.doi.org/10.1109/wcnc.2013.6554872.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Peng, Woon Hyung Cho, Zhenhai Duan, and Xin Yuan. "Traffic-Aware Inter-Domain Routing for Improved Internet Routing Stability." In IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference. IEEE, 2008. http://dx.doi.org/10.1109/glocom.2008.ecp.429.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Traffic Aware Routing' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography