In　modern　networks,　administrators　realize　their　desired　functions　such　as　network　measurement　in　several　data　plane　programs.　They　often　employ　the　network-wide　program　deployment　paradigm　that　decomposes　input　programs　into　matchaction　tables　(MATs)　while　deploying　each　MAT　on　a　specific　programmable　switch.　Since　MATs　may　be　deployed　on　different　switches,　existing　solutions　propose　the　inter-switch　coordination　that　uses　the　per-packet　header　space　to　deliver　crucial　packet　processing　information　among　switches.　However,　such　coordination　introduces　non-trivial　per-packet　byte　overhead,　leading　to　significant　end-to-end　network　performance　degradation.　In　this　paper,　we　propose　Hermes,　a　program　deployment　framework　that　aims　to　minimize　the　per-packet　byte　overhead.　The　key　idea　of　Hermes　is　to　formulate　the　network-wide　program　deployment　as　a　mixed-integer　linear　programming　(MILP)　problem　with　the　objective　of　minimizing　the　per-packet　byte　overhead.　In　view　of　the　NP　hardness　of　the　MILP　problem,　Hermes　further　offers　a　greedy-based　heuristic　that　solves　the　problem　in　a　near-optimal　and　timely　manner.　We　have　implemented　Hermes　on　Tofino-based　switches.　Our　experiments　show　that　compared　to　existing　frameworks,　Hermes　decreases　the　per-packet　byte　overhead　by　156　bytes　while　preserving　end-to-end　performance　in　terms　of　flow　completion　time　and　goodput.