Filters








5,113 Hits in 3.6 sec

Dynamic routing and admission control for virtual circuit networks

A. A. Economides, P. A. Ioannou, J. A. Silvester
1995 Journal of Network and Systems Management  
Then a multi-objective cost function of rejecting & maintaining virtual circuits, as well as of delaying & servicing packets is defined.  ...  A nonlinear dynamic queueing model for virtual circuit networks that considers the dynamic interaction among the virtual circuit and packet processes is introduced.  ...  Vikram Saksena of AT & T Bell Laboratories for suggesting the virtual circuit routing problem and for many useful suggestions. The comments of two anonymous reviewers are gratefully acknowledged,  ... 
doi:10.1007/bf02146082 fatcat:cpqgywc33vhaxdl35r4wb32wiq

Inside parallel computers: trends in interconnection networks

H.J. Siegel, C.B. Srunkel
1996 IEEE Computational Science & Engineering  
Packet routing can adhere to minimal or nonminimal path length.  ...  Connecting all nodes via a single nonblocking crossbar switch provides optimal performance.  ... 
doi:10.1109/99.537098 fatcat:srezupouzfgstfz4cdrqtsunr4

Maximizing lifetime of a mobile ad hoc network using energy efficient routing

Divya Sharma, Ashwani Kush, Pooja Madkan
2014 Proceedings of 3rd International Conference on Reliability, Infocom Technologies and Optimization  
This paper focuses on an in-depth study of energy efficient-routing in ad hoc wireless network.  ...  Energy management is an optimization technique, used to maximize the operational lifetime of networks through energy-efficient routing.  ...  In MMBCR, a cost metric Cp associates with a specific path P is given by Cp = min {Bi} where Bi is the residual battery capacity of node i lies on route P.  ... 
doi:10.1109/icrito.2014.7014689 fatcat:jikyqokdnnh2bmbzuklt23awdy

Better Algorithms for Hybrid Circuit and Packet Switching in Data Centers [article]

Liang Liu, Long Gong, Sen Yang, Jun Xu, Lance Fortnow
2017 arXiv   pre-print
A hybrid-switched DCN employs a much faster circuit switch that is reconfigurable with a nontrivial cost, and a much slower packet switch that is reconfigurable with no cost, to interconnect its racks  ...  Hybrid circuit and packet switching for data center networking (DCN) has received considerable research attention recently.  ...  It was shown in [3] that Eclipse++ can switch roughly 10% more data, via indirect routing, than Eclipse under representative workloads.  ... 
arXiv:1712.06634v1 fatcat:fjvdc33yvnb7fnqnf3po5tyuca

Costly Circuits, Submodular Schedules: Hybrid Switch Scheduling for Data Centers [article]

Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, Pramod Viswanath
2015 arXiv   pre-print
Hybrid switching - in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch - is a promising alternative to interconnect servers in today's  ...  These ideas naturally generalize: we see that indirect routing leads to exponential connectivity; this is another phenomenon of the power of multi hop routing, distinct from the well-known load balancing  ...  over the circuit switch; only direct routing of packets from source to destination ports are allowed here.  ... 
arXiv:1512.01271v2 fatcat:rm2nvspk5favpk5qbmnw3pme44

A Multipath Energy-Efficient Routing Protocol for Ad hoc Networks

Yuan Ping, Bai Yu, Wang Hao
2006 2006 International Conference on Communications, Circuits and Systems  
In order to maximize the lifetime of ad hoc networks, packet should be sent via a route that can avoid nodes with low power. A lot of routing protocols about ad hoc networks have been proposed.  ...  Accordingly, this paper proposes a new multipath routing protocol, MEER (Multipath Energy-Efficient Routing) that includes the advantages of ondemand protocols, also prolongs the network lifetime by using  ...  Therefore, to prolong the lifetime of an individual node, MMBCR (Min-Max Battery Cost Routing) [9] introduces a new path cost which is defined as R j =max i route-j f(B i ), and it selects the route  ... 
doi:10.1109/icccas.2006.284949 fatcat:7k6nlrcy3rdzjmqccuzsbfjqxu

Costly Circuits, Submodular Schedules and Approximate Carathéodory Theorems

Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, Pramod Viswanath
2016 Performance Evaluation Review  
Hybrid switching -in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch -is a promising alternative to interconnect servers in today's  ...  These ideas naturally generalize: we see that indirect routing leads to exponential connectivity; this is another phenomenon of the power of multi-hop routing, distinct from the well-known load balancing  ...  Now, for any path p the "effective cost" of the path per packet is simply the total cost of p in Gw. Thus for the path (β, p) carrying β packets, the effective cost is given by e∈E βwe1e∈p.  ... 
doi:10.1145/2964791.2901479 fatcat:uq7glpic6je2ll67yz3ccu6jci

Costly circuits, submodular schedules and approximate Carathéodory Theorems

Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, Pramod Viswanath
2017 Queueing systems  
Hybrid switching -in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch -is a promising alternative to interconnect servers in today's  ...  These ideas naturally generalize: we see that indirect routing leads to exponential connectivity; this is another phenomenon of the power of multi-hop routing, distinct from the well-known load balancing  ...  Now, for any path p the "effective cost" of the path per packet is simply the total cost of p in Gw. Thus for the path (β, p) carrying β packets, the effective cost is given by e∈E βwe1e∈p.  ... 
doi:10.1007/s11134-017-9546-x fatcat:bq5xtyxxhzb2tj2ymxxbdptuym

A Multifunctional Integrated Circuit Router for Body Area Network Wearable Systems

Fardin Derogarian Miyandoab, Joao Canas Ferreira, Vitor M. Grade Tavares, Jose Machadoda da Silva, Fernando J. Velez
2020 IEEE/ACM Transactions on Networking  
Index Terms-Integrated circuit, body area network, wearable sensor network, hardware implementation, digital circuits, routing. 1063-6692  ...  The adopted hybrid circuit and packet switching scheme significantly improve network performance in terms of end-to-end delay, throughput and power consumption.  ...  After processing the packet at t = 5.6 µs, SN2 sends it to the BN by establishing a circuit path via SN1, finishing at t = 63.6 µs.  ... 
doi:10.1109/tnet.2020.3004550 fatcat:43mrkv34engftm5uxhmmk2whra

Distributed cooperative routing algorithms for maximizing network lifetime

Charles Pandana, W. Pam Siriwongpairat, Thanongsak Himsoon, K.J. Ray Liu
2006 IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.  
We study the performance of the cooperative routing in terms of network lifetime (defined as the time until the first node dies) and the total delivered packets before the first node dies.  ...  We demonstrate that the proposed solution achieves 1 ∼ 3.5 and 1 ∼ 2 times longer network lifetime and more total delivered packets compared to noncooperative routing, when it is used with MTE and FA algorithms  ...  The Q i (j, d) has the interpretation of node i's best estimated cost that a packet would incur to reach its destination node d from node i when the packet is sent via node i's neighbor node j.  ... 
doi:10.1109/wcnc.2006.1683506 dblp:conf/wcnc/PandanaSHL06 fatcat:fkncdoorgrc5pf7l7uybxqwv7e

Selective randomized load balancing and mesh networks with changing demands

F. B. Shepherd, P. J. Winzer
2006 Journal of Optical Networking  
Traditional approaches include single-hop architectures based on a (static or dynamic) circuitswitched core infrastructure, and multi-hop (packet-switched) architectures based on point-to-point circuits  ...  tree routing.  ...  The architectures we consider are: single-hop routing, hub routing (dual-hop routing via one node), Valiant's randomized load balancing and selective randomized load balancing (dual-hop routing via all  ... 
doi:10.1364/jon.5.000320 fatcat:ieq4a6ynf5codcdxwx57nstrtq

An Effective Ant-Colony Based Routing Algorithm for Mobile Ad-Hoc Network

Yingzhuang Liu, Hong Zhang, Qiang Ni, Zongyi Zhou, Guangxi Zhu
2008 2008 4th IEEE International Conference on Circuits and Systems for Communications  
In this routing scheme, each path is marked by path grade, which is calculated from the combination of multiple constrained QoS parameters such as the time delay, packet loss rate and bandwidth, etc. packet  ...  routing schemes.  ...  the cost: C P t < cos , (8) where, T, L, B and C are the restrictions of time delay, packet loss rate, bandwidth and cost of path respectively.  ... 
doi:10.1109/iccsc.2008.28 fatcat:6vv6d67yevfcvcwj74mc424tpe

A ZigBee-based Aquiculture Water Quality Monitoring System

Li Jinfeng, Shun Cao
2015 International Journal of u- and e- Service, Science and Technology  
The low-power MSP430F149 and CC2530 RF chip are the core of the system which is constituted with the sensor nodes, routing nodes and coordination nodes.  ...  The test results illustrate that the network packet loss rate is 0.83% when the distance between the two nodes is 80 m, which meets the demands of aquiculture.  ...  The water quality parameter data collected by the sensor nodes are uploaded to the coordinator node via the routing nodes.  ... 
doi:10.14257/ijunesst.2015.8.10.35 fatcat:rqmrspuqjbbgzcw5yv46t5kvbi

Coarse optical circuit switching by default, rerouting over circuits for adaptation

Jerry Chou, Bill Lin
2008 Journal of Optical Networking  
ID 98177͒ As Internet traffic continues to grow unabated at an exponential rate, it is unclear whether the existing packet-routing network architecture based on electronic routers will continue to scale  ...  In particular, by adaptively load balancing across circuits with spare capacity, excess traffic is routed to its final destination without the need to create circuits on the fly.  ...  Specifically, since our experiments compare both packet routing [e.g., open shortest path first (OSPF) and equal cost multiple path (ECMP)] and circuit switching, the demand of IE flows is considered to  ... 
doi:10.1364/jon.8.000033 fatcat:7th7zyfnvfam3ffuxgplipnquu

Network Optimization for Unified Packet and Circuit Switched Networks [article]

Ping Yin, Steven Diamond, Bill Lin, Stephen Boyd
2019 arXiv   pre-print
Such pass-through traffic can be better circuit-switched through the underlying optical transport network by means of pre-established circuits, which is possible in a unified packet and circuit switched  ...  adds substantial delays and processing costs.  ...  A simple greedy algorithm is just to re-route traffic to node m via the circuit to node m with the most residual capacity rather than directly to destination k.  ... 
arXiv:1808.00586v4 fatcat:xien2dig2vdhffbb5xjbaghfti
« Previous Showing results 1 — 15 out of 5,113 results